Result for B8D93A7E5A952EE48AC558378FA3AEB787441F88

Query result

Key Value
FileName./usr/lib/python3/dist-packages/fuzzywuzzy/fuzz.py
FileSize8099
MD5FCB6AC6BB1214BFF2277DA32F66D8DC5
SHA-1B8D93A7E5A952EE48AC558378FA3AEB787441F88
SHA-2569B8A28CBAC2AEE3BA0C6AA774438069A34C399936A074DFE2F5E5D75DFA92C2F
SSDEEP192:qbQHTqwxKd5xoSJRHM4YlvRjcvRj7WCqpTPspXRZPXRZ4QgqzC3Pl:e65Yd5xowa4I2XWlpTMBZPBZrmd
TLSHT1C7F132EBFDD01F978F8618B7089B86026259DA635F4725B8F8AD85502F04C98C3FB095
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