| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python3-levenshtein/changelog.Debian.gz |
| FileSize | 1238 |
| MD5 | EC92FB408D350FC0071CF3DF6E0B923A |
| SHA-1 | 9F3B1C7921D29A84412A00CCC578D22B883850C5 |
| SHA-256 | EAC7E3CE9E3E5990EB3818431B907A6E4C767D2A8EB7CEB48ADC6B9877D05A17 |
| SSDEEP | 24:X/8mI4AWvw/tPIE9zA5k/3hm7I25cDl4KWvejroZ9IJKA2/nMeA8HE22xCpyq+:XEmI4W/tgE9zc23hm7IYcDliIuMeA8Hg |
| TLSH | T11D21EA751B684E96EEC8821215F30810696E32544C54B3F633186F5C211ED367782108 |
| hashlookup:parent-total | 40 |
| hashlookup:trust | 100 |
The searched file hash is included in 40 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 91436 |
| MD5 | D0D8568D13EE46255DDCF70B921B2A64 |
| 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 | 01B1528D40E36E4CE35196CFA30AAE9E953E93E2 |
| SHA-256 | E46BE053911EC730BD5DD82EA9EA77B17E09DFF2C5CECF3EEC35F3538F338A1F |
| Key | Value |
|---|---|
| FileSize | 113790 |
| MD5 | 63A4242B103A548952FB10E142C7D75D |
| 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 | 0855F5D09D4879528F078FD6A92826EDC7F61FC6 |
| SHA-256 | 6817BBC0C2488A98F3DD263E8F4DEA4BCD791E0826A79152FB2EED6AA1CD1B55 |
| Key | Value |
|---|---|
| FileSize | 87856 |
| MD5 | 54C9EF7C4EB040548ABA8E666F3B26A2 |
| 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 | 087525C29455AA8FEF021743AF06D7B381B0F3C1 |
| SHA-256 | DD14C21FBBEE3CDAB0BC0F78AB1238CE48934C0F8DEFA1F8A5CC94235A1F6196 |
| 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 | 36622 |
| MD5 | 5EF9D7CC86A659D97FA25A96A7E72975 |
| 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 | 156D0C3EC243F11E82CA6755A45F0A6B35DE84A0 |
| SHA-256 | AF76A04DEF908CE1568794001670FA0A8E44581BDD1A8E59EA8FE3A6212E4917 |
| Key | Value |
|---|---|
| FileSize | 84162 |
| MD5 | 6548B0C5318893B08546D411A54E9DA3 |
| 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 | 16312BFF7832DDDB68401A23FDAAE06116BDB44D |
| SHA-256 | 5E48920B8FEC686A77C3BAD5B3E92CDF64FB7ECB94D520414C21B0FF37D15188 |
| Key | Value |
|---|---|
| FileSize | 28318 |
| MD5 | EB35D4F1A19CA33817ABA951070C8E46 |
| 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 | 16F6044DCB7D6D82FB8A3457F56D1F70A5FA3142 |
| SHA-256 | 9159DEAD7B312C0CF21991A5BBE87373C28A4A65DBF6A032D8E8D65A061B4D32 |
| 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 | 87018 |
| MD5 | 9422192BE4ABCED37909E9CEA8BEBD87 |
| 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 | 2B1FD7AA3A01CC6F80DF4FE96DD04D1D3EFA6D7A |
| SHA-256 | 6083A951E37FA76050A136658ED2908049D9D0C82457FEE5B5A8B98FAF264F2A |
| Key | Value |
|---|---|
| FileSize | 33738 |
| MD5 | A41FB2A0365B3B6F8CC52936301EC1C3 |
| 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 | 355AC25BCA9E5D429B2A2345688D2ED429666488 |
| SHA-256 | 445E5104CF237D6FC2E0EE3E0AF67CCF023161BD937FB236368DD7B6FD80DB72 |