| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python-fuzzywuzzy/changelog.Debian.gz |
| FileSize | 683 |
| MD5 | 016A80BE18DEF95F96B979E07C947040 |
| SHA-1 | F2621E61485C39FB2BF970FF29E504361200A147 |
| SHA-256 | 48BA159FFCC92BBDDD18637FDEBCAB99937D3D443506B9DAD3959EA198103845 |
| SSDEEP | 12:XDdEnaZv37Ga5u0HvudTwU6oUplBiSIEL/2zc8bhGpOuetWYVkRDJy7q/Yf5C:XZEncT00H2dsviSbacgoegYVkRD/Yf5C |
| TLSH | T1C6018308EA721E7D6FDF7368A86F570D0B224B670E3E8A43DE6301D2641ECCC55A60C9 |
| 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 | 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 |