Key | Value |
---|---|
FileName | ./usr/share/doc/python3-levenshtein/changelog.Debian.mips64el.gz |
FileSize | 238 |
MD5 | D3542D84EBE42A043995BA04CB087BD6 |
SHA-1 | 04F6270C4729CE01879B715CA752CEE4D6B7748E |
SHA-256 | 2A6476B333AA101C6594E5E181B0442B0CEAEAD788E0C4037A9EF86A9AE6884C |
SSDEEP | 6:XtFkzSswA3Q8L9YPzBtBgt3TQqQR9mDdiSNkukCuuVBktveZOpD9Tsl:Xf6SswI/JizBtiiqqs5xN3uEBktGZq9o |
TLSH | T12BD097C1F4838D23CF8EA8A11308A022E808021700A884A2CC752AC8BC26B54C1A2834 |
hashlookup:parent-total | 4 |
hashlookup:trust | 70 |
The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 87114 |
MD5 | 255F4613FC7024376B2D73652E1F55C0 |
PackageDescription | extension for computing string similarities and edit distances(debug extension) 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. . This package contains the extensions built for the Python debug interpreter. |
PackageMaintainer | Sandro Tosi <morph@debian.org> |
PackageName | python-levenshtein-dbg |
PackageSection | debug |
PackageVersion | 0.12.0-2+b2 |
SHA-1 | 206A59E8D064363C154B10A965D2EE2D7355DDF9 |
SHA-256 | 0336CF24240F715F6FAA663BFBC7FAB7B77E624453F490CA080B7D880DF97066 |
Key | Value |
---|---|
FileSize | 31904 |
MD5 | 5DC1DF57E7D488C0CC433C8C3D289A58 |
PackageDescription | extension for computing string similarities and edit distances (Python 3) 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. . This package contains Levenshtein for Python 3. |
PackageMaintainer | Sandro Tosi <morph@debian.org> |
PackageName | python3-levenshtein |
PackageSection | python |
PackageVersion | 0.12.0-2+b2 |
SHA-1 | 0B1738CD5A40302C80A96C9822989E5592E92A6D |
SHA-256 | 85C9C4D03C80AF553B48E1E0A54FBD219882B000F2F4F53508D8F3B09E3987EF |
Key | Value |
---|---|
FileSize | 113860 |
MD5 | BA263793FCAC96B04B1001C27C3A61FD |
PackageDescription | extension for computing string similarities and edit distances(py3k debug ext) 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. . This package contains the extensions built for the Python 3 debug interpreter. |
PackageMaintainer | Sandro Tosi <morph@debian.org> |
PackageName | python3-levenshtein-dbg |
PackageSection | debug |
PackageVersion | 0.12.0-2+b2 |
SHA-1 | D1E93735BC76CC0BC59BEE8AE49870BFD7F4766D |
SHA-256 | 590F5AD248DD30DE1375A42475C17D55C763B30A4956CC1F3EE41CBC1F417A3C |
Key | Value |
---|---|
FileSize | 34484 |
MD5 | 4462FA0E25925944A0946D276943E0AB |
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 | Sandro Tosi <morph@debian.org> |
PackageName | python-levenshtein |
PackageSection | python |
PackageVersion | 0.12.0-2+b2 |
SHA-1 | DD8C9444B94F3AC413119CA94691587A0A11923C |
SHA-256 | A8E9D9E3CAA8AEDCC781F5B80F7F30CBAFBE4EA239DAE32A96EFF90182928EB7 |