Parents (Total: 6)

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

Key	Value
FileSize	32742
MD5	2E3565C384C522438F1C23698F4C6534
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.11.2-2
SHA-1	EB3D8B02AA5597E20657982FA1E58C144224A788
SHA-256	D07C08B8E829818BF4F0C244F98B62DFF2D3A005390BA8A148561E07688A1B67

Key	Value
FileSize	37804
MD5	905C86CABD4C52E16E42AF31A26FB113
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.11.2-2
SHA-1	C506B27B02413C0AB9A5BC7B5CF85FD57EEB69E6
SHA-256	B06F90A303251658460425D6FA296503552E95290FB9A25D5B06D67A8007ECE3

Key	Value
FileSize	35250
MD5	6ECC4B4E218963A728166D906669566D
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.11.2-1build1
SHA-1	417D78AC9B454FEE1E4293B51633148BDC06301D
SHA-256	2749D160E31ED7333C40996BF9209FC59C7915EEEEBD60548D66C9E239D2A141

Key	Value
FileSize	36286
MD5	295517FA6CCC135C02DC16807B01CCA6
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.11.2-2
SHA-1	DFF7B8B25D0A2D35425E5843909C22D15980E79D
SHA-256	E71B3BFFA12AB46E3E04F09FE9AD174AE7AF8E3B5E82E831C4CBDF875842D337

Key	Value
FileSize	34310
MD5	C3664FB2257DF4B9D1A914AC17A9AA1C
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.11.2-2
SHA-1	BD86849E63453DA3CC403724150782FFAA3D7337
SHA-256	99C9D2FB97897DE6B677FABE5937E9FEAA94B228C1A5FE6FF04519AF6D71CE1B

Key	Value
FileSize	34952
MD5	54D750011C4E4AD288B5EF3A3231151E
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.11.2-1build1
SHA-1	F0DD2B53D5BA7D26FBA359E58EB7142DC35C8578
SHA-256	385C66D9B5E40E7AA600C29FF7F82B4FD176F1D77CC1A0FC367F236C3AD3E333