Result for 56B3F49252E40ADD71D1223CE27D591A0BA8FE02

Query result

Key Value
FileName./usr/lib/python3/dist-packages/fuzzywuzzy-0.16.0.egg-info/PKG-INFO
FileSize5422
MD5173F0074E07DC3CE57889645186B7F80
SHA-156B3F49252E40ADD71D1223CE27D591A0BA8FE02
SHA-256805D6580E862BBF9AB711D3716BE490352E33D775AD76FFBA1016C8011B8FCC3
SSDEEP96:DayqHBWUGmOsjF+XLy2w2j+DSXWCSxqjaaDYxfJqM:8HZGujF+XG2w2j+tpqM
TLSHT102B1F04F48C07CA19B5619F91E8A0512927E005BB6570C8CFEEE0F8AAF31B7E49391DC
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize12036
MD56CF16F017F310E64F026A767E31F5A17
PackageDescriptionPython 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamepython-fuzzywuzzy
PackageSectionpython
PackageVersion0.16.0-2
SHA-15CC40B87E3967560027A26982A7A82FC5E7EDE18
SHA-2564E98805C5DDEB56C5C2D000270F9222F02EF4DB16041A18E577DE92F27787C89
Key Value
FileSize12124
MD52E9FE63C79AC0006F74F24162768F259
PackageDescriptionPython 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. . This package contains fuzzywuzzy for Python 3.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamepython3-fuzzywuzzy
PackageSectionpython
PackageVersion0.16.0-2
SHA-16560B03A850344E69453ABCE8398AC8FEC4D911D
SHA-2567EE58920866A9EAAC92CC4D95FD1EDCCB827BE1D328F5E634D7931FF973D6107