Parents (Total: 4)

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	35410
MD5	B728CB64DADD720A5583721684DAC4A7
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	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	python-levenshtein
PackageSection	python
PackageVersion	0.10.1-1.1
SHA-1	9CE66F6613C2B4E67423CF9F9FE16AEB145F299D
SHA-256	76D69270E3572A900B50D981ACB6A0889150E862B3A672AC1173AA6D032C1E9D

Key	Value
FileSize	38280
MD5	A90E9B63C1706CAA84344FEA5E747040
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	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	python-levenshtein
PackageSection	python
PackageVersion	0.10.1-1.1
SHA-1	370270C7DA0BBDD1E9E867A7E9FF7643E6FB192E
SHA-256	1CFE7482A8E1B139B3B7FFCBB6F8D4A060EA7DF5AB93FAC7B3CBD82A93DB1F37

Key	Value
FileSize	36242
MD5	3723CB67A5E57C6FBA6EFEC89DBBA4AC
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	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	python-levenshtein
PackageSection	python
PackageVersion	0.10.1-1.1
SHA-1	BB085DC6200853639A9D70F8FCF895B4D726B78E
SHA-256	0685248B75000631160261E7A241A6521EE3671BB958BBF5322002664F992F0F

Key	Value
FileSize	38170
MD5	981532A67A314C0EC87CA38BD41F2F42
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	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	python-levenshtein
PackageSection	python
PackageVersion	0.10.1-1.1
SHA-1	5102525E247BB32477983CF1270382F77A34D9CC
SHA-256	ABB043E06D070BD5EF0F91B0676E1A5FB8FD6C9B0732E0C6260D4B742F8F0128