Result for A075BC0BA6EA8C7A56945AA06C74AE9C06F64135

Query result

Key Value
FileName./usr/lib/python3/dist-packages/fuzzywuzzy-0.16.0.egg-info/PKG-INFO
FileSize5432
MD595536D1CA8B3BFA5E5D4F69DF0EA81CC
SHA-1A075BC0BA6EA8C7A56945AA06C74AE9C06F64135
SHA-25654EAF5ECF427AFEC1FF81CE9A99062D85B4AE2AD42AAF601990D02758F0DB954
SSDEEP96:DZuIqHBWUGmOsjF+XLy2w2j+DSXWCSxqjaaDYxi:sHZGujF+XG2w2j+tq
TLSHT129B1E04F48C07CA19B5619F91E4A0512927E045BB6570C8CFDEE0F8AAF35B7E49391EC
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
FileSize11980
MD5B4AF2FA394F31E439486DE6EA0061C16
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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamepython-fuzzywuzzy
PackageSectionpython
PackageVersion0.16.0-1
SHA-1A1EFEE5116075329D26B76A22F186A139EBC5C23
SHA-2564C7E249565840306071300B41D8F8E90C0BBE96D012A9E85B4CE166BF0EEDF68
Key Value
FileSize12076
MD53A8D2DBC2D0B927D9BE81779F4BE9DFA
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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamepython3-fuzzywuzzy
PackageSectionpython
PackageVersion0.16.0-1
SHA-181F23818DAD0DF0E28FDEF327F1E3421C219EBCB
SHA-25615418DAECADE631B79E99ED0B76B23D33B22FE6F436B2F05057BBF909BF7BA29