| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python3-levenshtein/changelog.Debian.gz |
| FileSize | 1914 |
| MD5 | 043024354DB514B5791772CE4E0ACC2B |
| SHA-1 | B46D2761782636F56E344D3DB2C38CCE72F8F021 |
| SHA-256 | 937649A279C4216257CFACE0942C59209BD46EE55EF974991CF12CEBC963AD25 |
| SSDEEP | 48:XgPK/3VJ7nO4eWeSFrTwPkf+cPuIZhp6lu1TSi7r:PVtJlFvBf+cVLQvin |
| TLSH | T14E411BEFE2933ECD0241C5B1640E98445A1917308851C80F67E5F49825BEA552C327AE |
| hashlookup:parent-total | 18 |
| hashlookup:trust | 100 |
The searched file hash is included in 18 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 197636 |
| MD5 | D18A22E9206ADB020A2734B88783F5E6 |
| 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.2-1 |
| SHA-1 | 11498CB0D5E66EC047463E04637D628D6DC6306F |
| SHA-256 | EE51A1352D67FFAB85074971021AE65D496A9B0BD274F3D39F7C40171C767225 |
| Key | Value |
|---|---|
| FileSize | 206612 |
| MD5 | 59256723AD4FE64C60A2853636E1AC76 |
| 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.2-1 |
| SHA-1 | 2466B4D8659C0A0FD44EAEEB0840FB13EF30C3C8 |
| SHA-256 | 8783F8A4DF1830718EC0C830EC93BB524151A02B4CC1AAE20C1A9662DBD2F62B |
| Key | Value |
|---|---|
| FileSize | 36736 |
| MD5 | D15928AA514881E585ACDD5C62B28AE2 |
| 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.2-1 |
| SHA-1 | 267B46156D37EB81B019E4E0582890655BE640AF |
| SHA-256 | 3151A1FAA17B08B68512831F820381F9A9941A1878F8ABF0C881809FB75C888B |
| Key | Value |
|---|---|
| FileSize | 37180 |
| MD5 | 06135EB9473837952629DF2AA25CF99F |
| 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.2-1 |
| SHA-1 | 2956FEB1636D149690EA508E18C6ADCC4F773C10 |
| SHA-256 | 4EF6A72839F3DE7944E23C8258359C9CBBE99D18CEE18D8C8B4FA303AC4444FC |
| Key | Value |
|---|---|
| FileSize | 39092 |
| MD5 | 84E6C5A8FFA4E92ADA49395E7B771414 |
| 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.2-1 |
| SHA-1 | 356D7968732A42544E91A6FF750BB4CE6330687B |
| SHA-256 | 853C662EEF6C244AB035BEB4A657C047AD7DC0D81A28C62F48ECB477E2F549B1 |
| Key | Value |
|---|---|
| FileSize | 199584 |
| MD5 | 5956324ED48C0860749D9A1446D9677A |
| 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.2-1 |
| SHA-1 | 4108200FCDCBF51E155ADB069230544B8506D104 |
| SHA-256 | A45554FFFA0312BD4ACDA8BE2E767C56283ABFF7BE5B743FB342719AF247EC73 |
| Key | Value |
|---|---|
| FileSize | 186980 |
| MD5 | FDE3178FB757A509F8F7E42041626BAE |
| 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.2-1 |
| SHA-1 | 4DC3AFF7526E544B21F1290A5A07FA0C2CB807A0 |
| SHA-256 | 84273B60399DCA80E3285089CE905AAAB7D27A9D231EA1160AA9AAE771A22125 |
| Key | Value |
|---|---|
| FileSize | 186960 |
| MD5 | 1454274BB788AC5114F37AE69F60A5AC |
| 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.2-1 |
| SHA-1 | 5DC0637D04DDC0C8FBFA216F0AE89E9EC7EFF953 |
| SHA-256 | F75098383BF97D54CDC29249849984910A21FFAD4F47DF65F3D020F06F3B848F |
| Key | Value |
|---|---|
| FileSize | 34792 |
| MD5 | 4D1EFE837F001E91CFDF9ADC0073F3FF |
| 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.2-1 |
| SHA-1 | 6E297265EB5E1C23597DF5B774A55CD8E7B53BBD |
| SHA-256 | 60FB81758867B81DA77500B13C3EE115BBBF52E66D0336F2F604DA44B32B071C |
| Key | Value |
|---|---|
| FileSize | 36596 |
| MD5 | BF39B3F1B2ECB9F810B4F67480CBF327 |
| 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.2-1 |
| SHA-1 | 7CBBE3C95C09521B7FD13A4DD607B92707358D32 |
| SHA-256 | 55EA00FD668AB8CD2000537C427736839527A25AD8084732B7B30280A19736E5 |