Key | Value |
---|---|
FileName | ./usr/share/pyshared-data/python-levenshtein |
FileSize | 266 |
MD5 | BC72620B1F97B5627293286F8C079742 |
SHA-1 | 745CC5D27E21A1428954804A7C0570DAC8BF9F8A |
SHA-256 | 7253D38F8CFD31B41D66C2EF7644487D1B84F5035E9B671B3701A547802C38BD |
SSDEEP | 6:UZpMINJgLQW9Y49yOUhSn4LWb9Y3LPUe2zOnM9Y3kre2zOz:f/9DjvglnMUz |
TLSH | T13AD02B1417DCD37399E19DEC7F1600288BD434F06E0294C3FA305882DD282C97603F0A |
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 | 70862 |
MD5 | 0410AF69B5969A4594B487863E2CD16A |
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 MOTU Developers <ubuntu-motu@lists.ubuntu.com> |
PackageName | python-levenshtein |
PackageSection | python |
PackageVersion | 0.10.1-1ubuntu1 |
SHA-1 | 9CCD63ABDA7767A7989123C6B595ACDC49A0D4A9 |
SHA-256 | EFA071AE51BF9CE0D3AEDC55558CE363A7B09745889B0840D0AD17C8F41D923F |