| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python3-levenshtein/changelog.Debian.gz |
| FileSize | 1038 |
| MD5 | 02547D34E3BECD4E5C1F6E69D1CA5616 |
| SHA-1 | ECC3A4E162942688B634400188F5830DE4CB37D7 |
| SHA-256 | 441825EABDAB25FE2B8F70A598F3F52D6ADA1172B823C4478A75D74B992B739A |
| SSDEEP | 24:XFX3V2cp6NP8lk82tDpegfbXfZtPXzLzMR0cdvCO+aPEl:XFnUNUePtDpeWbP3/zMqASa0 |
| TLSH | T18011E50EDAD31982027B82BEAAA993310768E4CB712EC08A400005F02F88029DEE418C |
| hashlookup:parent-total | 16 |
| hashlookup:trust | 100 |
The searched file hash is included in 16 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 34190 |
| MD5 | 69ECE438A4954C4498F944AD77F74763 |
| 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.11.2-2 |
| SHA-1 | 019226F2A12B194B6096027D259FAAF4012265CF |
| SHA-256 | 704BE1921C44820D88B34FE64721BBBC795CACAB52D2A8C8CA143D484EC86B8A |
| Key | Value |
|---|---|
| FileSize | 32532 |
| MD5 | FCABB8DFA99980A870DEE9E8D550C7B3 |
| 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.11.2-2 |
| SHA-1 | 0A97463A0AB8E4AEF227EF898807FD9418B603C9 |
| SHA-256 | 7A882E3C87DBAB0EC96BB3EF26C56393C1A57603F96E3A321CC7815BB8B88531 |
| Key | Value |
|---|---|
| FileSize | 75554 |
| MD5 | 7C20DC43DE143587D830C45542DEEDA5 |
| 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.11.2-2 |
| SHA-1 | 2236123C02F99AC6CB2FF3DDA166D92E8F9E7284 |
| SHA-256 | 3A583146F13AD62C9F60798310E044461D0FD285EB64A906031F8AA8ED9969A2 |
| Key | Value |
|---|---|
| FileSize | 90074 |
| MD5 | 4122D82B63654A1A708B3E16FAAA9009 |
| 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.11.2-2 |
| SHA-1 | 33C483A9B9B99432730F806630A3D390C1702D60 |
| SHA-256 | CB0F02954B301E2E0319DE3556C66611D4C81F29E008E50E46EE9E853E9AB677 |
| Key | Value |
|---|---|
| FileSize | 30280 |
| MD5 | 3D0C6585F09C306BE5AEBBE2E7D4BFE7 |
| 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.11.2-2 |
| SHA-1 | 46B677DB50766A4AB16B3601DF8D75E5C9DB38DB |
| SHA-256 | 93A98833EFCE6828775D13ED138DAF79B943E881EAC37259BD05C3DCD54C5000 |
| Key | Value |
|---|---|
| FileSize | 87992 |
| MD5 | 8B72FDB86A0F16855AB655D64F1AADCA |
| 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.11.2-2 |
| SHA-1 | 901B76A872BBFAEEB2C0900A4D79CA464CA0040A |
| SHA-256 | 3CCCC30550E9B590D6AD9A7A4289DC0440903FD689599F96DE20F026A8A6502F |
| Key | Value |
|---|---|
| FileSize | 78598 |
| MD5 | 3EA5556526E9DE84BC5DAD8747651797 |
| 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.11.2-2 |
| SHA-1 | A3AB2BA124FCADE5150B2624ADFE0585E4148EF0 |
| SHA-256 | B06FC8F9525914CF2F238A0024A822D0F63F240E6772BB957EEAE1A812E4E8AD |
| Key | Value |
|---|---|
| FileSize | 85872 |
| MD5 | 1E78AD9BAF7C86E9C6418401F4EE3B57 |
| 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.11.2-2 |
| SHA-1 | A3E787A498263CAFCD66BC5ED02030A13D270DB1 |
| SHA-256 | 292CD46F0710C120126408FD5A6AE850C36E3227729D15A3F446A04F5B0C0D65 |
| Key | Value |
|---|---|
| FileSize | 87508 |
| MD5 | 397D4A1320508C45EA09A79EBCA4D311 |
| 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.11.2-2 |
| SHA-1 | BCBE5E4A2093E2A455964312D09BC610EBEB93E6 |
| SHA-256 | FE83CFDF875020E11D3FD837C18B92C09FDE8239EB6402AE4A7581BA7B539252 |
| Key | Value |
|---|---|
| FileSize | 34310 |
| MD5 | C3664FB2257DF4B9D1A914AC17A9AA1C |
| 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.11.2-2 |
| SHA-1 | BD86849E63453DA3CC403724150782FFAA3D7337 |
| SHA-256 | 99C9D2FB97897DE6B677FABE5937E9FEAA94B228C1A5FE6FF04519AF6D71CE1B |