| Key | Value |
|---|---|
| FileName | ./usr/lib/python3/dist-packages/fuzzywuzzy-0.10.0.egg-info/pbr.json |
| FileSize | 46 |
| MD5 | 160C815760116B7FA2E682C07BE8B46B |
| SHA-1 | BBD439A89ED31F8441D55FC30F172A8534D7E07F |
| SHA-256 | E8A94E8332FBE5906982F918C077647AB8D1807B76D7C51773E62D4A5D170157 |
| SSDEEP | 3:YM9XMtjcMu11s4:YM1Aq1J |
| 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 | 10696 |
| MD5 | 1A66E56A8159C65F771D80862B5C19D2 |
| PackageDescription | Fuzzy string matching in Python (Python 3 version) 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.10.0-1 |
| SHA-1 | F5F5A24DEE4F58C5B727B3A8569ED7D9E683D9BD |
| SHA-256 | DCC85146942FD7506E469955923A12AB99F8133D1E4A0892D23B74F633A55A14 |
| Key | Value |
|---|---|
| FileSize | 10592 |
| MD5 | 961F10023E5877F9DB09E673EC490326 |
| PackageDescription | Fuzzy string matching in Python 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.10.0-1 |
| SHA-1 | 2F269922E786C97F0C0C969B603D6CC3CAD375F8 |
| SHA-256 | 0990E0D9EBC76FFA87893A017A613448901AFDB051A119A138577E14F1DE1A5C |