Key | Value |
---|---|
FileName | ./usr/lib/python2.7/dist-packages/Levenshtein.so |
FileSize | 68408 |
MD5 | 763F68F41E4CC48C7EB90C419044E723 |
SHA-1 | 27E8D2C623FC2B3D6FB564C97C0EDBF771B12083 |
SHA-256 | 4C8011D56B34E489C72C22F3787CFBFF1CE21E857CFA85972D35E12D391E18F9 |
SSDEEP | 1536:mXa0VqP2uxOi2UV+WeISBjIMUQcyBDXAk:mxi2cOi2UhSBZUQlB |
TLSH | T1DE631947B06264FDC5F780348ADB6562B5A1B01493396FBB38CC4A701B5AE781B7FB21 |
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 |