Result for DF6BA9A2A5BAD084219E159FF6B4AFAD0DAAD64B

Query result

Key Value
FileName./usr/share/doc/python3-fuzzywuzzy/copyright
FileSize2369
MD55A55FCB593A8283B06C6FC06D45F11BC
SHA-1DF6BA9A2A5BAD084219E159FF6B4AFAD0DAAD64B
SHA-2561AB99DF97AF098095A6293B6C5FE1E0C7CB8FFA0643DA8D37FA4EEE48A13565F
SSDEEP48:yAjAP0J5PPv2Ew1QH+shIpa3ecFrhGEyvHqyImQc:/fP+rQHdes83gFc
TLSHT1EF41C50D7540877B149023E13D566CCAF32B73AB75BF52C0904ED389AA0A87C62F64D8
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
FileSize17590
MD54FB2FC83E1049F06BC0FC9451418C442
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.15.0-2
SHA-1265EACA81B6DEF56947C42B353DAF4711407954B
SHA-25628DF5EB1EAFDA648D58240B00AAF003FA78DB18244D468D8B7E03636ECB8081A
Key Value
FileSize17686
MD565AC28C4DE899C836D5B6C4B97A093AB
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.15.0-2
SHA-117B5F4A40F116E414E24D60C487E6D7B0C15AC6A
SHA-2568CC0453CB2C5397C5F39670E0E17588894FD91F16C49C48ADD23F7BD73428042