| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python3-fuzzywuzzy/copyright |
| FileSize | 2369 |
| MD5 | 5A55FCB593A8283B06C6FC06D45F11BC |
| SHA-1 | DF6BA9A2A5BAD084219E159FF6B4AFAD0DAAD64B |
| SHA-256 | 1AB99DF97AF098095A6293B6C5FE1E0C7CB8FFA0643DA8D37FA4EEE48A13565F |
| SSDEEP | 48:yAjAP0J5PPv2Ew1QH+shIpa3ecFrhGEyvHqyImQc:/fP+rQHdes83gFc |
| TLSH | T1EF41C50D7540877B149023E13D566CCAF32B73AB75BF52C0904ED389AA0A87C62F64D8 |
| hashlookup:parent-total | 2 |
| hashlookup:trust | 60 |
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 |
|---|---|
| FileSize | 17590 |
| MD5 | 4FB2FC83E1049F06BC0FC9451418C442 |
| PackageDescription | Python 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. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | python-fuzzywuzzy |
| PackageSection | python |
| PackageVersion | 0.15.0-2 |
| SHA-1 | 265EACA81B6DEF56947C42B353DAF4711407954B |
| SHA-256 | 28DF5EB1EAFDA648D58240B00AAF003FA78DB18244D468D8B7E03636ECB8081A |
| Key | Value |
|---|---|
| FileSize | 17686 |
| MD5 | 65AC28C4DE899C836D5B6C4B97A093AB |
| PackageDescription | Python 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. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | python3-fuzzywuzzy |
| PackageSection | python |
| PackageVersion | 0.15.0-2 |
| SHA-1 | 17B5F4A40F116E414E24D60C487E6D7B0C15AC6A |
| SHA-256 | 8CC0453CB2C5397C5F39670E0E17588894FD91F16C49C48ADD23F7BD73428042 |