| Key | Value |
|---|---|
| FileName | ./usr/lib/python3/dist-packages/fuzzywuzzy/__init__.py |
| FileSize | 47 |
| MD5 | 1F35110400C604BDEC773CDDCCCEB8D5 |
| SHA-1 | 36589762B60609EDBE572D26A0931E74ED31CF91 |
| SHA-256 | 8723B93E29FB23CD87C36F85E065D613D3E062112BC905262B36BB9D383BAA1F |
| SSDEEP | 3:SyIFGaMIQlAyItyLvYgSUCvn:SbFGaMtlAyq2YgCv |
| TLSH | |
| 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 | 10796 |
| MD5 | 9B63717E5859651B144808240A7EFE53 |
| 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 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. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | python-fuzzywuzzy |
| PackageSection | python |
| PackageVersion | 0.11.1-2 |
| SHA-1 | A7FE4F10628635E9AF609B5A50EBE59620F37840 |
| SHA-256 | EC5A042CCA0DE032EC8DC6C12F53587F8C5D55ECCB48B7CBD5AAEF8968D9121B |
| Key | Value |
|---|---|
| FileSize | 10884 |
| MD5 | 1700071CD20EFC3971A7B552E17C0B00 |
| 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 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. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | python3-fuzzywuzzy |
| PackageSection | python |
| PackageVersion | 0.11.1-2 |
| SHA-1 | 71D15538CDD47E9E897CA15F85DFDBEE8844CEC5 |
| SHA-256 | 4FA84942674D8D152B7AA8D7FFE2B3683522256F77D854DC0FC57B251BDBBF61 |