| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python3-levenshtein/changelog.Debian.gz |
| FileSize | 1474 |
| MD5 | 9FE7580D42418CF8FD2B134D10813AC1 |
| SHA-1 | 14473E3C92AE56392AD21875EC422F85227FF3AE |
| SHA-256 | BA1AA6EA914BCD681B9CC834EA20BB3E091BC4FB312946493A1313D8A85CEE50 |
| SSDEEP | 24:XjJbsEpuQIDdCtvwtBmhfe6RfKruKDoETv5i0JAa33qJlVzNHK3bhA:XtNAq4tBmNemKrPdisr3qJ3RGA |
| TLSH | T1B9311B3CD957638FD44DC7C78D3980D5AD0889D568B5D413623078C06BB4044C3A54EE |
| 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 | 37744 |
| MD5 | 849310B3366BB2713FD66F7DFE1CE2D7 |
| 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-3 |
| SHA-1 | 01450F9B98D8AB65EAF6F27705E88730ECB0E81B |
| SHA-256 | FBB46412DFA34E9BC631921840032E2B48640F581D01565127D1620573C77313 |
| Key | Value |
|---|---|
| FileSize | 34644 |
| MD5 | 6B58742CD0A892E3EB475EB59799E1DE |
| 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-3 |
| SHA-1 | 05A0264E4E9CDC7F3E67BDD1BEA9600D9EB889DF |
| SHA-256 | A3203BE745FCD620A25FCAEACDB1AC658B0A51F5011411A1E6C7487141269C9F |
| Key | Value |
|---|---|
| FileSize | 188048 |
| MD5 | 8C53D110B06EF9C4FE4980F98A4DB81F |
| 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-3 |
| SHA-1 | 1DC0B280C4D876A92ACAB67A4A4552084A893942 |
| SHA-256 | 4FAFE0B7423D6C1B487B05C632552120B7ADE3639B05831039CC5B553238016D |
| Key | Value |
|---|---|
| FileSize | 164720 |
| MD5 | 708AA377D9565E016B7AACCFA063EC49 |
| 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-3 |
| SHA-1 | 23F2CF7E75980D0815D08C73146929F6A26628BD |
| SHA-256 | 44148FB1C6E211C99C81F77A0BD7B84DE35F8B72B2EA4BD1AFB3CF716077E7E9 |
| Key | Value |
|---|---|
| FileSize | 181192 |
| MD5 | D84206E7BE619E889FB45DB51AAEE960 |
| 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-3 |
| SHA-1 | 249F14BB2767BB5DF29D807DE352BF358E07EE74 |
| SHA-256 | FCC53F41B36468833E7081C50D613128C547553521D789432836A0E9C8ADFA74 |
| Key | Value |
|---|---|
| FileSize | 178532 |
| MD5 | 4D5B793D9F6424DFE4364FC65932ED2B |
| 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-3 |
| SHA-1 | 2FBF3CF9F50C923C9CF8664F131A852D96189302 |
| SHA-256 | 743C34CB2DD4FE0C753B2DFFC8395F9A127E08F03805F50B030B5886E1763B5B |
| Key | Value |
|---|---|
| FileSize | 174764 |
| MD5 | E4F11E2952B4FACEC1621A4FFCC96CDD |
| 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-3 |
| SHA-1 | 30947878E141C98D29C19FC5BB747A07960BDBDD |
| SHA-256 | AF91E43BDA37F9A99F9FBED7DB6195405D855FAD18FA49B532A5B65F210DACD5 |
| Key | Value |
|---|---|
| FileSize | 36100 |
| MD5 | 6BE78C49F4F4EBA935F188B4E13F73CF |
| 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-3 |
| SHA-1 | 328A5F820400FB5398A09FBFBE787221C1172E9F |
| SHA-256 | F8F9D2CD0C851D0AA8408739C011B9B39F0A2070618E99B4CE8CF8149A3C60ED |
| Key | Value |
|---|---|
| FileSize | 32336 |
| MD5 | E3880A9D82A52909DD2364AC7EDD32A4 |
| 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-3 |
| SHA-1 | 32B609CFC7162D33D1EBDE6F6F7F7F41C0F40246 |
| SHA-256 | E9A2606883BE00D249BEF73CC6845EEDA3E59C7814EA98C0835811BF7F859BCD |
| Key | Value |
|---|---|
| FileSize | 30084 |
| MD5 | D0B4C7C9CE9242FA06C7B32833944FB2 |
| 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-3 |
| SHA-1 | 4078A02711D72ACA2FC30CC9C83FFAC8B7A3E45B |
| SHA-256 | 86577D7AD79079C8DC0B81A811A95FFEFDB11100A8EF18357D1AC3E4F0F5E3E2 |