Key | Value |
---|---|
FileName | ./usr/lib/python2.5/site-packages/Levenshtein.so |
FileSize | 72480 |
MD5 | FD8E681EFFE5978EA0BF1883C80AB657 |
SHA-1 | F200ED64C004685734D707140CE7915F08FD47EA |
SHA-256 | 8C1864FA5E81905AB56232931113EACA81F1F3FED55015AB0BEBF7ECE403D7D7 |
SSDEEP | 1536:mr4S1BLe2iMjWqKtt5RV/lLJg04R9MUQc:mcS1s2intTxI01UQ |
TLSH | T120633A5BA06210FCC4EBC0349AD7A522B5B1B0145375BF7F38988A711B4AF284B7FB64 |
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 | 66194 |
MD5 | 6A4D68EA138D336EC53D866A67387CED |
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 | 552847A564A597669B02421A518156A00AB350EB |
SHA-256 | 399CE782468B6CF3D300099661578F195F933B50A9AF01B8DF18308EF7D75E96 |