Result for C6E6EBBA278D6BD647B82F24D81EE2EA19A2CF0E

Query result

Key Value
FileName./usr/lib/python3/dist-packages/fuzzywuzzy/process.py
FileSize8790
MD5633FDB752DA9AB9C6F311742C814BB60
SHA-1C6E6EBBA278D6BD647B82F24D81EE2EA19A2CF0E
SHA-2562BCC28AE3706BF84B6BB38CD9E12B2C144C074EF8748137AC24AFF096446A0B5
SSDEEP192:6bQHTkW5/yhFzTFTca3fVccEiOks3hb600kK5tEY:u6FyhFvF13tnEBkoh30kK53
TLSHT12802742FB4C7266289C64429B08BC0C1975AD97B6316556C7DAEC2AC2F03C3D83F66E5
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
FileSize10696
MD51A66E56A8159C65F771D80862B5C19D2
PackageDescriptionFuzzy string matching in Python (Python 3 version) 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. . This package contains fuzzywuzzy for Python 3.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamepython3-fuzzywuzzy
PackageSectionpython
PackageVersion0.10.0-1
SHA-1F5F5A24DEE4F58C5B727B3A8569ED7D9E683D9BD
SHA-256DCC85146942FD7506E469955923A12AB99F8133D1E4A0892D23B74F633A55A14
Key Value
FileSize10592
MD5961F10023E5877F9DB09E673EC490326
PackageDescriptionFuzzy 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamepython-fuzzywuzzy
PackageSectionpython
PackageVersion0.10.0-1
SHA-12F269922E786C97F0C0C969B603D6CC3CAD375F8
SHA-2560990E0D9EBC76FFA87893A017A613448901AFDB051A119A138577E14F1DE1A5C