Result for 08F6CC9818B8990EB037E5613DCDD3E00E2373A7

Query result

Key Value
FileName./usr/share/doc/python3-fuzzywuzzy/changelog.Debian.gz
FileSize1125
MD518F7FDF3C1E94539282BCC949878CB6B
SHA-108F6CC9818B8990EB037E5613DCDD3E00E2373A7
SHA-2566C87709549B624B14EA3EC3C858A714E42FD0A9659BCD38028D18060E5BC0017
SSDEEP24:XJOUS/PEug5Smt2mFlt10wA18r2jSjxKqvUTFAqO06K3NS0/ExOUwxCt:XJOUS0LnlwwGMUiqkK//mwxCt
TLSHT1E221B9D4952E973F9D1EA97108167801E34185EF6B74E5CC8DB5BEC01453478AEE0E51
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

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

Key Value
FileSize20312
MD57F389FBEF12E24B2504176B4A18F6555
PackageDescriptionPython 3 module for fuzzy string matching Various methods for fuzzy matching of strings in Python, including: . - String similarity: Gives a measure of string similarity between 0 and 100. - Partial string similarity: Inconsistent substrings are a common problem when string matching. To get around it, use a "best partial" heuristic when two strings are of noticeably different lengths. - Token sort: This approach involves tokenizing the string in question, sorting the tokens alphabetically, and then joining them back into a string. - Token set: A slightly more flexible approach. Tokenize both strings, but instead of immediately sorting and comparing, split the tokens into two groups: intersection and remainder. . This package contains fuzzywuzzy for Python 3.
PackageMaintainerDebian Python Modules Team <python-modules-team@lists.alioth.debian.org>
PackageNamepython3-fuzzywuzzy
PackageSectionpython
PackageVersion0.17.0-1
SHA-198A628CBAAFECE46895A5FA33353CF1B4C2375F9
SHA-256C0D25CC23F8961874D508B82A6EAC787B04CE775E31D1085E060729E722A3E32
Key Value
FileSize20224
MD5094EF4F25BA704CA0B3AEAEC569112E9
PackageDescriptionPython module for fuzzy string matching Various methods for fuzzy matching of strings in Python, including: . - String similarity: Gives a measure of string similarity between 0 and 100. - Partial string similarity: Inconsistent substrings are a common problem when string matching. To get around it, use a "best partial" heuristic when two strings are of noticeably different lengths. - Token sort: This approach involves tokenizing the string in question, sorting the tokens alphabetically, and then joining them back into a string. - Token set: A slightly more flexible approach. Tokenize both strings, but instead of immediately sorting and comparing, split the tokens into two groups: intersection and remainder.
PackageMaintainerDebian Python Modules Team <python-modules-team@lists.alioth.debian.org>
PackageNamepython-fuzzywuzzy
PackageSectionpython
PackageVersion0.17.0-1
SHA-1A08501F54F963293F752AA59DC4647BEA1A61EDA
SHA-2563371E702B716188BA1FEFF57427ECEC58F71F6FA45AAD3515F18DD8524D9BFD6