Key | Value |
---|---|
FileName | ./usr/share/pyshared-data/python-levenshtein |
FileSize | 211 |
MD5 | 6674DC22A2EE02ACBA05951D13BFA961 |
SHA-1 | BA56C86CEEAF7A375428B5789C8D91E955B80618 |
SHA-256 | D9A1CA3229EFACE125CCA9F51FC1647809FA34F18D65D46704524FD48FCFADA6 |
SSDEEP | 6:UZpMINz21gLQW9Y49yOUhSn4LWb9Y3LPUe2zOz:hy/9Djvglz |
TLSH | T157D0A714229CD27298908DEC7B2640185B9038E02E029093B6205482DD286CD6503A06 |
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 | 36242 |
MD5 | 3723CB67A5E57C6FBA6EFEC89DBBA4AC |
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 | BB085DC6200853639A9D70F8FCF895B4D726B78E |
SHA-256 | 0685248B75000631160261E7A241A6521EE3671BB958BBF5322002664F992F0F |