Parents (Total: 7)

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

Key	Value
FileSize	62324
MD5	525B492ECBB21F837135C74606011F73
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	480C1EF3CCC9D7B11D75ADF5B4800C0E41B2BCB3
SHA-256	DFD57B64ACDEBB2ABD41DB9960B45F0194085C6627FD8474F8C5C0B9F75A5FCC

Key	Value
FileSize	70862
MD5	0410AF69B5969A4594B487863E2CD16A
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	9CCD63ABDA7767A7989123C6B595ACDC49A0D4A9
SHA-256	EFA071AE51BF9CE0D3AEDC55558CE363A7B09745889B0840D0AD17C8F41D923F

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	66194
MD5	6A4D68EA138D336EC53D866A67387CED
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	552847A564A597669B02421A518156A00AB350EB
SHA-256	399CE782468B6CF3D300099661578F195F933B50A9AF01B8DF18308EF7D75E96

Key	Value
CRC32	FC88D0A4
FileName	python-levenshtein_0.10.1-1ubuntu1_i386.deb
FileSize	63316
MD5	8CEFA1BD56D22EF2869B620E1A727611
OpSystemCode	362
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
ProductCode	9525
RDS:package_id	9525
SHA-1	9545696A40E23889A685D0B0487E750AF969F9D0
SHA-256	A64E37F2736A7AA68C5F3473B3B7180DCF83BBFD9B4CA5054442419004195AE4
SpecialCode
db	nsrl_legacy
insert-timestamp	1648719998.803767
source	RDS_2022.03.1_legacy.db

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	71964
MD5	7C36E1DA007450AFAFB335CF14803006
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	67BE75E7A82010E4FF15824415EF2F9560031AAE
SHA-256	C475D727C454BDDCB2A446EF0FA401304375FCEF34617CAC484D33F93B8AFECB