| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python-fuzzywuzzy/changelog.Debian.gz |
| FileSize | 655 |
| MD5 | 392BFFCB7AFCB521630409347FE2AFE2 |
| SHA-1 | B64AE07900C5364AB14870CF099C2F0CC1E6B7B1 |
| SHA-256 | E684D33CDF43C10F47D23497ABC0DE8033BD945754D8738185F1FE649A55BF26 |
| SSDEEP | 12:X7mFCMShhd+uqiGTAp7oy68YrgyH8Ox3xvtZAfZ2j9jDgIG4sb61y2R:XyFtS3GlA+QYkyFbLAfZ2jB041y2R |
| TLSH | T10CF083081DABA1D8DCE000FF80187EA6ECE78C2397B12910208A9A4BA22480BAD2400C |
| hashlookup:parent-total | 1 |
| hashlookup:trust | 55 |
The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:
| 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 |