Result for A4811523BB06D9B993DED752DD3CAB5F09D2BDFD

Query result

Key Value
FileName./usr/lib/python3/dist-packages/fuzzywuzzy-0.11.1.egg-info/PKG-INFO
FileSize5049
MD5D343C22664A37B0613DE51A6E2372E87
SHA-1A4811523BB06D9B993DED752DD3CAB5F09D2BDFD
SHA-256FFB34F335134459B7D388E7D0BCAC1B6A1FD32C3ABB9F9CDAB282E84F48A8522
SSDEEP96:DZlPut0CQHT6lqHBWDYOsjF+XDBhqjaaN:ybQHTVHwkjF+XS
TLSHT1E1A1624F94D06EB29B0715F81E4A0402527A004BB9570C8CFCEF6F8AAF3576D0A7A5DC
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
FileSize10796
MD59B63717E5859651B144808240A7EFE53
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 sort: 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.11.1-2
SHA-1A7FE4F10628635E9AF609B5A50EBE59620F37840
SHA-256EC5A042CCA0DE032EC8DC6C12F53587F8C5D55ECCB48B7CBD5AAEF8968D9121B
Key Value
FileSize10884
MD51700071CD20EFC3971A7B552E17C0B00
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 sort: 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.11.1-2
SHA-171D15538CDD47E9E897CA15F85DFDBEE8844CEC5
SHA-2564FA84942674D8D152B7AA8D7FFE2B3683522256F77D854DC0FC57B251BDBBF61