Key | Value |
---|---|
FileName | ./usr/share/pyshared-data/python-levenshtein |
FileSize | 266 |
MD5 | ECE1020203D42581F180FACBF92CDA26 |
SHA-1 | B4F0B9FF4B6FF564514283892E95DF005A5165BF |
SHA-256 | 982F1960CF0A5CA60996373DAD4C708F3036793402F8ADCD678C83E895341B35 |
SSDEEP | 6:UZpMIN3gLQW9Y49yOUhSn4LWb9Y3fxe2zOnM9Y3LPUe2zOz:B/9Djv1nMglz |
TLSH | T1BBD02B1422DCE37398E19DEC7F26002887D034F02E0294C7FA301882CD7C1C97603E0A |
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 | 71206 |
MD5 | D5105716D2D04C7A2976FFA98635CE03 |
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 | 032A97ACA5A725FEAD02BDFB09E315EC8667BDC2 |
SHA-256 | 206949A3DB518950C24AB3AA270710C2047F0D892719CCBADAE8D7DE83FFC02C |