Result for 94D786886F59ED56183DF65EE8CF9F68667543C4

Query result

Key Value
FileName./usr/share/doc/python3-levenshtein/README.rst
FileSize3081
MD52B0D37D563E692E88921A6B80A0FE370
SHA-194D786886F59ED56183DF65EE8CF9F68667543C4
SHA-256CC0EFC588780231DD89CE5469047218940CB2A4D9AD7E6AE4373328BEA7F15AC
SSDEEP96:puBL6F1rWlQuL6ciQ7XHvQ9tEN3Zr32QH4tUfhMH:BFUQu2BQDPQ4NprBH4Cf4
TLSHT15051A65A4F8C2332A9D3C15D7FEA5093E72592B572A5C1B0B88D82884727C62627F9D8
hashlookup:parent-total19
hashlookup:trust100

Network graph view

Parents (Total: 19)

The searched file hash is included in 19 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize36736
MD5D15928AA514881E585ACDD5C62B28AE2
PackageDescriptionextension 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.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-1
SHA-1267B46156D37EB81B019E4E0582890655BE640AF
SHA-2563151A1FAA17B08B68512831F820381F9A9941A1878F8ABF0C881809FB75C888B
Key Value
FileSize37180
MD506135EB9473837952629DF2AA25CF99F
PackageDescriptionextension 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.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-1
SHA-12956FEB1636D149690EA508E18C6ADCC4F773C10
SHA-2564EF6A72839F3DE7944E23C8258359C9CBBE99D18CEE18D8C8B4FA303AC4444FC
Key Value
FileSize39092
MD584E6C5A8FFA4E92ADA49395E7B771414
PackageDescriptionextension 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.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-1
SHA-1356D7968732A42544E91A6FF750BB4CE6330687B
SHA-256853C662EEF6C244AB035BEB4A657C047AD7DC0D81A28C62F48ECB477E2F549B1
Key Value
FileSize36292
MD5E5D5A259082B04BA22D2A581156EF52C
PackageDescriptionextension 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.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-2
SHA-138D61261C4D80778C6AF56D5D575801DEDC44A00
SHA-256225A8205D338D082C62A606760015233C23FC99D3EC2BCCE33A60BFF0E46AC11
Key Value
FileSize36764
MD53AF69069A03E31FA81B067EA9ADEE83F
PackageDescriptionextension 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.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-2
SHA-1393DAD6EA68DED5965921ACBB0D236831DEFB62C
SHA-25645AFB8A81DB7FC42A3D75A55E42C018936988CA5723DAE34D86565D1D3BBABCA
Key Value
FileSize37232
MD5404AA36468F3FC0F1F0999387202CEF6
PackageDescriptionextension 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.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-2
SHA-1462E6E514DC2617D8ADF2DCE4E2F43D0136A6D7F
SHA-256DB31F2B5ADC1D112BA2C709B3661F98BC9B4E4D22FDC3606B98B791E2C17BC54
Key Value
FileSize39104
MD59B43BED6AC351DBDCFC7D44213022FC0
PackageDescriptionextension 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.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-2
SHA-15F0D6254F9940E178061779A68E1FB04B553C41D
SHA-256CC7DE6E9506399E901D99F85F8D12B257B739CC9E7A46AE7A15AF3B684C99EAF
Key Value
FileSize34792
MD54D1EFE837F001E91CFDF9ADC0073F3FF
PackageDescriptionextension 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.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-1
SHA-16E297265EB5E1C23597DF5B774A55CD8E7B53BBD
SHA-25660FB81758867B81DA77500B13C3EE115BBBF52E66D0336F2F604DA44B32B071C
Key Value
FileSize40788
MD56A64815B368BDEBF44DD85AE0BC4051B
PackageDescriptionextension 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.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-2
SHA-17A63258015825C8BDACFFD4BD306901CB693643A
SHA-25600B53167C94A91904802D9CAEDED9C817327E845338990DF82A74F7FD6C9D3CD
Key Value
FileSize36616
MD5F1C9ADF9F590A3BF2E66E44613F31294
PackageDescriptionextension 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.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-2
SHA-17A929BBA2D5343DD6896D17A144C04F4AA004561
SHA-256D5EE0AB6BFEFCFE03AB5F148A57C49BC0B905D179CAB534AC6ADEBF005B2C355