| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python-fuzzywuzzy/changelog.Debian.gz |
| FileSize | 694 |
| MD5 | 1DEA3E16632A23A8DC3AA038BD2ED443 |
| SHA-1 | 0AB11B065BB62656432ED1C4D07B4EFAAEAA35F1 |
| SHA-256 | CE31DEEB818C1D36D88ACB551A619AA8A6DB5C641FDDD8F3F56427880659A995 |
| SSDEEP | 12:XlemHsP4P59LngoVSX0VP6TxouQWPg3w0tVEZAeI6PO5OxgReB1:Xle1P4P59jgoy02xou63w/A/Oxgy1 |
| TLSH | T18C0144F9408570E9E0B30F79B631C19663EE6A02D2881D05525A009D806D46818E999F |
| 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 | 12064 |
| MD5 | 096CF5F6D874695BFE047E49669C24D0 |
| 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.17.0-1 |
| SHA-1 | 4E985B752D6F411294C3855823C28E5DAE70153D |
| SHA-256 | 30E95C0C4A7DEB50133C30C7011AA27BDB37BA49484E7E062690891FED01DAA7 |