Key | Value |
---|---|
FileName | ./usr/lib/python2.6/dist-packages/Levenshtein.so |
FileSize | 59108 |
MD5 | D0589B93BA0057123ED7724BC1107873 |
SHA-1 | A536E4ABAA8CC21F32C7B261D7112456E9264687 |
SHA-256 | D4C5ED0557511C8AF923A6B1C1B6954D99ABD6E66CBC8E6D88932288621EFBB4 |
SSDEEP | 768:WiaxfT/J6zHDEhFRjSu+WlkEE/XiV+PsbzGY8g0x4IPWMCHTUc:exzDj1+W2dXiVvVz04MEgc |
TLSH | T158437EA7210341F6C4B301F19B8755EBD6B0C3026439A3EEFDAC0D59AF67EA4663D528 |
hashlookup:parent-total | 1 |
hashlookup:trust | 55 |
The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 35410 |
MD5 | B728CB64DADD720A5583721684DAC4A7 |
PackageDescription | extension for computing string similarities and edit distances The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | python-levenshtein |
PackageSection | python |
PackageVersion | 0.10.1-1.1 |
SHA-1 | 9CE66F6613C2B4E67423CF9F9FE16AEB145F299D |
SHA-256 | 76D69270E3572A900B50D981ACB6A0889150E862B3A672AC1173AA6D032C1E9D |