Parents (Total: 56)

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

Key	Value
FileSize	71206
MD5	D5105716D2D04C7A2976FFA98635CE03
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.1build1
SHA-1	032A97ACA5A725FEAD02BDFB09E315EC8667BDC2
SHA-256	206949A3DB518950C24AB3AA270710C2047F0D892719CCBADAE8D7DE83FFC02C

Key	Value
FileSize	61756
MD5	03FC256C329C4A704F8EE23B8EF94DC9
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.1build1
SHA-1	052C264CAFEE0585D7384D43FDE00B709430E792
SHA-256	139747CA9C8501A2DD0167687770A2BA525DCFB22635965648408C8E153F21D1

Key	Value
FileSize	36622
MD5	5EF9D7CC86A659D97FA25A96A7E72975
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	156D0C3EC243F11E82CA6755A45F0A6B35DE84A0
SHA-256	AF76A04DEF908CE1568794001670FA0A8E44581BDD1A8E59EA8FE3A6212E4917

Key	Value
FileSize	37320
MD5	E2CE8851EB919266254FCD0A3AF7F72E
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.1ubuntu1
SHA-1	19AFED28F63DAF8FBAF2C7228B843F30FD757474
SHA-256	110B966146F0A1A4BEEE22F4AF1E1C674796066D814CDF0C8069BA7288BFDEC5

Key	Value
FileSize	40226
MD5	815DB4F6A3A10F342FC167FC29702513
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.1ubuntu1
SHA-1	1EA13709707A567B9ABBAF0BC630C478AEF3F97A
SHA-256	1ADF10C566927455F5AE8146BE402E53799E71B71F20FB351B7116C1E4219C0A

Key	Value
FileSize	63318
MD5	58C11DE212FD056B26F7EDB9A7CEEB30
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 MOTU Developers <ubuntu-motu@lists.ubuntu.com>
PackageName	python-levenshtein
PackageSection	python
PackageVersion	0.10.1-1ubuntu1
SHA-1	22932742EDDFDFD37D21839B5D4B480736A1CEA7
SHA-256	7860E8869D784E2B204F3ADD61F3FCB27A4FD0403FE88002ED2283FB6584C1A8

Key	Value
FileSize	93394
MD5	6159D43F34033EAF05C3AC1606648874
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 MOTU Developers <ubuntu-motu@lists.ubuntu.com>
PackageName	python-levenshtein
PackageSection	python
PackageVersion	0.10.1-1ubuntu1
SHA-1	31F3D763B673F0D1A9A17D03303420A311F71DF7
SHA-256	5B8C6CAE0D0898FF734D0F3521EC0C63C03D133FE0BF27EE2B7F363B9E61BFB5

Key	Value
FileSize	38192
MD5	309D005A7CD51331AC207E70451CC488
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 MOTU Developers <ubuntu-motu@lists.ubuntu.com>
PackageName	python-levenshtein
PackageSection	python
PackageVersion	0.10.1-1ubuntu2
SHA-1	3693AC0EF422ECFECD8395EC0D8F535EC3DB3008
SHA-256	B3725B99D34D51A04BDA5C064F5E6C8C89E375304F0B0E1FCE4494582EE398FB

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	35674
MD5	35FE3C9EB0F975000362401497D8D726
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.12.0-2build1
SHA-1	40E14C2D4DEAACADDA9437DB571EA446C77F1502
SHA-256	D3318E3746DF813BDB1165F89DBB6C779AECCEEF31061698597D6673394700A5