| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python-fuzzywuzzy/changelog.Debian.gz |
| FileSize | 601 |
| MD5 | A6293FB344F5CE9C6729136F00E05270 |
| SHA-1 | 6E9E983F9884990639DC92EC593BC57100F811E0 |
| SHA-256 | BFC347AE8CA778C9A26EE701D6E066BCFD811E65E89234C1FAC0FBF4854CC2E0 |
| SSDEEP | 12:XHUbi6YOqYDhDIz22sayAFao71LRGsy8Qo7xQtLDyLMsvlyxA4R2B5FK3/:X36YshUag1LUJ8TQlAbvlV4R2B5c3/ |
| TLSH | T17CF04762145ADF570475B5F0C81155B906BCD69F02BAD1F1B915DCBD4530326C3D7874 |
| 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 | 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 |