| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python3-fuzzywuzzy/changelog.Debian.gz |
| FileSize | 895 |
| MD5 | 10743C394391E0681FFF9F4F461870A5 |
| SHA-1 | 2403C869AD51BA28260F1E30AA3984AA9D24EC57 |
| SHA-256 | 2DAD441F69CE38514CCD6004CCF7DD85FC790827B364B3B45E554666F4E76FE2 |
| SSDEEP | 12:XE3pbCATMUlh7yI0akA2edgLxYPG6wJcZy6oWHO6WWWo2GmgOLnoclA0n2vIK99M:X0p2ATHbmI5kEMoG6HyYTv8iv/9Tw |
| TLSH | T15711EB1FCDC86504ECE34DBC79844CB54142AB6BF94035855E43F6A500418434E60F2B |
| 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 | 20048 |
| MD5 | 058104A505D5B80F70FCB20B6E2DE29C |
| 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 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 | Debian Python Team <team+python@tracker.debian.org> |
| PackageName | python3-fuzzywuzzy |
| PackageSection | python |
| PackageVersion | 0.18.0-4 |
| SHA-1 | B6498C5D8E6F48ED7854253E4779934A03A90477 |
| SHA-256 | DDDC6694F53D48179CE2B3A181CD25616357508D25B7102222334731734E7861 |