| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python-levenshtein/changelog.Debian.gz |
| FileSize | 519 |
| MD5 | 88BF3BF50A6EF6FFF8190743D6ED4154 |
| SHA-1 | 517B68B7121C90B089CED7F5F4FE0F1FE99A821E |
| SHA-256 | 66F02786ABED0ABE81A68BCFBEAE0993B03603EBF4551B637938465D7A055469 |
| SSDEEP | 12:XU9FoSgDXZs/2p4xjpwUgbNM1RS2n/M+ixWbYNT8fZnkCEzASF1QWX:XoKSgDXc+tARS+MvC5Rk9A3WX |
| TLSH | T1C8F00E5200EDA6E8C8B8CE5CAD85DCEF509E859CC46C6B570B8A1B43E6AC4855C24258 |
| hashlookup:parent-total | 5 |
| hashlookup:trust | 75 |
The searched file hash is included in 5 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 37520 |
| MD5 | 715EB6ACA2C82806DF8439AA2F502021 |
| 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.1ubuntu1 |
| SHA-1 | AF408FF21241EDD5AC9B15A165E0235E2436B5E9 |
| SHA-256 | A4AAC8E401DBEB60FA821E4E68D6D51988B56801B853DDC0D2B37901D617A373 |
| Key | Value |
|---|---|
| FileSize | 36254 |
| MD5 | 5523C2BE905B7AA0EF4CAC8BEC375C14 |
| 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.1ubuntu1 |
| SHA-1 | 6693638707FD26A0E20D8F47BC4832D01468CAB0 |
| SHA-256 | C78A7482C70AC532193208EB5BBEB5BD5D468C74A0E4601E3B33A7A00D016C93 |
| Key | Value |
|---|---|
| FileSize | 36250 |
| MD5 | A3A9FB49CA301BF7B3EC406B89B68605 |
| 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.1ubuntu1 |
| SHA-1 | 5113FF6346F90DF226F1F8E7F0BFA69CB94D05F6 |
| SHA-256 | 75F44013DC6F1356DFA8753A38B119AB2B2F8067634F66ABE76D9A3C6FD4045E |
| Key | Value |
|---|---|
| FileSize | 37320 |
| MD5 | E2CE8851EB919266254FCD0A3AF7F72E |
| 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.1ubuntu1 |
| SHA-1 | 19AFED28F63DAF8FBAF2C7228B843F30FD757474 |
| SHA-256 | 110B966146F0A1A4BEEE22F4AF1E1C674796066D814CDF0C8069BA7288BFDEC5 |
| Key | Value |
|---|---|
| FileSize | 40226 |
| MD5 | 815DB4F6A3A10F342FC167FC29702513 |
| 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.1ubuntu1 |
| SHA-1 | 1EA13709707A567B9ABBAF0BC630C478AEF3F97A |
| SHA-256 | 1ADF10C566927455F5AE8146BE402E53799E71B71F20FB351B7116C1E4219C0A |