Key | Value |
---|---|
FileName | ./usr/share/doc/python3-levenshtein/changelog.Debian.mips.gz |
FileSize | 236 |
MD5 | 7A026ABF57FACE2C7F4C28944A334979 |
SHA-1 | D4C7A5344717CC6C8D13313EBC8461BC843D2FBC |
SHA-256 | B8565D3449642B62D36493E76BF3EC69236AE18F6D14E48F2D3E4556151ACE25 |
SSDEEP | 6:XtRILfl8YkLLcyCn5ffPeekXcuuIGodNTD/wVgC7oNZasQeQ61mE:X/ILt8Yk/m5feeiHjdNTzwVgC7oNhQM5 |
TLSH | T1FBD0970DE12910D66003572741B332111298528543485C303EEAB82430DD53F197717F |
hashlookup:parent-total | 4 |
hashlookup:trust | 70 |
The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 107924 |
MD5 | 96EB2B0444C86A78B100C7E17380720C |
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 | C4C1E13F453A5C52C5012C74BC3AB7F8ECE99494 |
SHA-256 | D96C00B01D1150759737975A14C80F49D15D089D2D7BAD2606FE57B30C6436CB |
Key | Value |
---|---|
FileSize | 31820 |
MD5 | B195DBD5485C4702B97E58869808DDA9 |
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 | 9082EE3A1769CEC67193C1561100BED4E653BE0F |
SHA-256 | 5F7EE75D687A52267F34571F41B302A07EE209FC0B8FB3E6395E76D7E1D39738 |
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 | 34498 |
MD5 | 287A4C12D8AC220CE9DE56B65C9B1E08 |
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 | 6B69DCDC32F2EF29BDE7DD271480AE1DC8510A4B |
SHA-256 | C592C446ABB3C20D0AF17A83FCDDE0F1B5202D7E925A24EFCFE5049CBF39171A |