Key | Value |
---|---|
FileName | ./usr/lib/python2.6/dist-packages/Levenshtein.so |
FileSize | 59068 |
MD5 | BF35042D5A1BAFA282E54E21874CB29F |
SHA-1 | 5087987B172EA82BFEC08352E2C9E121DDB84E91 |
SHA-256 | 7DC2A552BB4D44C9258D273769968F3DD348D9ACF4BC85BA2B11CBA3EBA1A5D6 |
SSDEEP | 1536:nhOaZczrSepj2hCB6nE1avWnQsLqfMEgc:hOGcze86hy6nyQmlEg |
TLSH | T193437E97211341F6C4A301F0E68716EB9A71C202F029E7EFFDAC4D49AB53E94B63E654 |
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 | 65552 |
MD5 | ABE9EF324159931C1F9AAF311BD69FA4 |
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.1build1 |
SHA-1 | F0C759399C07554B399CE821A3B00A58E5B1C55F |
SHA-256 | 5B6A1BFCDD5DC8D264E0C4C1A897A5EBC720218D1CA3C7B6C4555F2FBFB6BE27 |