| Key | Value |
|---|---|
| FileName | ./usr/lib/python3/dist-packages/fuzzywuzzy-0.14.0.egg-info/PKG-INFO |
| FileSize | 22920 |
| MD5 | 8FC38351473F7BEB4EDD9A967FF7533B |
| SHA-1 | 13A47203CB8BF97006515332EDC9F670DD5A6A85 |
| SHA-256 | 53B47BD73BDCED5727A3C6F6D22B13379E6EAE8E0E07BD7B34B5E22633A6C9A5 |
| SSDEEP | 384:hEUwi5rPL67cyV12rPd34FomzM2/R+dWb7oUbHdB27u:h7F4ExGFzeda7oUrdR |
| TLSH | T10EA2A61F774413B206C206E16A4B58DBA32EC47B722A1454789DC25D2B7BF3583BFA98 |
| hashlookup:parent-total | 4 |
| hashlookup:trust | 70 |
The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 17112 |
| MD5 | BC496D5A5B0390D6CD37EE5585401DB8 |
| 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.14.0-1 |
| SHA-1 | 68DAC8661AA9DF8DEA057A3B0F63A34457EC59CC |
| SHA-256 | DC086A18D7A250B322761ECFE5FFE792D0958FE381A5B73617EEB8514CC07C93 |
| Key | Value |
|---|---|
| FileSize | 23320 |
| MD5 | 8EF7D36A7C45A5962F59882CE651AFDE |
| 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 | Debian Python Modules Team <python-modules-team@lists.alioth.debian.org> |
| PackageName | python-fuzzywuzzy |
| PackageSection | python |
| PackageVersion | 0.14.0-1 |
| SHA-1 | 660746C452898FCE31FA09C5D5E9BCD2AFC9EB54 |
| SHA-256 | 739DEAD6D740C807988F8ADF387344013BC3117EF7102E60A3CE81932E4A7674 |
| Key | Value |
|---|---|
| FileSize | 17020 |
| MD5 | DE62FF83CD3F669B3F405F7F751D853C |
| 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.14.0-1 |
| SHA-1 | 4F86407C98283D5B71F95361DA9A603A9AB4856E |
| SHA-256 | C4F5A98CEB9069D06872C3B00ECB8D2322535D4D2F0FE4A25DCAE595EAC70AE9 |
| Key | Value |
|---|---|
| FileSize | 23410 |
| MD5 | BA7F4169F8D4542A270421D97548E8A4 |
| 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 | Debian Python Modules Team <python-modules-team@lists.alioth.debian.org> |
| PackageName | python3-fuzzywuzzy |
| PackageSection | python |
| PackageVersion | 0.14.0-1 |
| SHA-1 | 138E65A749FCEFDBADCF077723029B97208E169F |
| SHA-256 | 5378BC889273C2094219510518CDF600BCDF6DF4F35D33CAB43A3A57A7174070 |