Key | Value |
---|---|
FileName | ./usr/share/pyshared-data/python-levenshtein |
FileSize | 266 |
MD5 | 52F41E9E96C1CE94D9905740E4A5779A |
SHA-1 | C3289A5990571990CE37AE919EB23B2CF0A488B4 |
SHA-256 | F11BF92C9C8E824D0BE7C891B6C3F5B5056C5C88A7FE17622A7B0EACE52BB545 |
SSDEEP | 6:UZpMIN3gLQW9Y/9Y3LPUe2zOnM9Y3fxe2zOnl9yOUhSn4LWg:B/9OglnM1nljk |
TLSH | T116D02B1422DCE37398E19DEC7F26002887D034F02E0294C7FA301882CD7C1C97603E0A |
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 | 68270 |
MD5 | 4D27B447DA155D1170652940F132C0B1 |
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 | EEDC7A91E2EF67A750D7CFE9F9F35812B9A0136E |
SHA-256 | D9EFCDC4D5C12C41E4ED8B75E1670406FBD146DA1B9EBF352CB5717BF1BAC32B |