Result for D80CD65AA00249B0168D87B10C97CB7020AFB5E9

Query result

Key Value
FileName./usr/share/doc/python3-levenshtein/changelog.Debian.gz
FileSize1948
MD521DA476B432EB09172A10BF4B92C8C4C
SHA-1D80CD65AA00249B0168D87B10C97CB7020AFB5E9
SHA-256A2536C57B68FE2DDE3C2869B213A95477B44A0F308CD4FB8F40A5367C21B0316
SSDEEP48:XJHDvPEH/42KurWB1nlD/GiyJ3wbO6yzTGkVcYnr4ktp5Bcd:ZDPEHdKjTlbfO00rD/Bcd
TLSHT1B541280238AA5891E007A8B8BE48C46C9E9F0CB9FDF745614C13F7EB08824C87D562E9
hashlookup:parent-total9
hashlookup:trust95

Network graph view

Parents (Total: 9)

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

Key Value
FileSize34816
MD5CE2871E1BBFD9A93B380F0EEA6C3357F
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-1F879A97648810D93D2D40BFD2F8E7E3EFBDA1813
SHA-256BCF9576DE346C375A044246300301010E538C7B35A8A16C5D8F64C596FCD8651
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
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
FileSize43696
MD5308050A8CA2817D0E45BF26FBBF8815C
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-1A4E404EF78098D5C663CEB562B2DCBED133AF778
SHA-256145671E8A5E88A35D4FAC2D21FEF35803DD0517282938B5D5905A5E9730AD7B0
Key Value
FileSize36172
MD58623B8877F4E5AF6BEA6D635C9D6D856
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-1ADA5A751F7C3A7733F7985AD5A25CFC671C58B43
SHA-256CC33FE3A1502A03911FE10A69DB6DC698600D29C6867FE6EF3789E4F0101E0A3
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
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
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
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