fuzzywuzzy 0.8.1-4 source package in Ubuntu
Changelog
fuzzywuzzy (0.8.1-4) unstable; urgency=medium * debian/tests/control: fix Depends, pep8 module is now in python-pep8 -- Edward Betts <edward@4angle.com> Fri, 11 Mar 2016 07:10:55 +0000
Upload details
- Uploaded by:
- Debian Python Modules Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Python Modules Team
- Architectures:
- all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| fuzzywuzzy_0.8.1-4.dsc | 2.2 KiB | 961070264c3e27d71f3dedf5da2e374ff55b835e80358628b8baa480cb12380d |
| fuzzywuzzy_0.8.1.orig.tar.gz | 16.3 KiB | d940bcf50b0046354fe0e9955389dd17b3771a22c5c62f92e99c449e6dc6aac6 |
| fuzzywuzzy_0.8.1-4.debian.tar.xz | 3.1 KiB | ddab1bfcf288168bb34ce0e9164be89b0d0c642f4ea3570bcb10c085d38225bc |
Available diffs
- diff from 0.8.1-2ubuntu1 (in Ubuntu) to 0.8.1-4 (865 bytes)
No changes file available.
Binary packages built by this source
- python-fuzzywuzzy: Fuzzy 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.
- python3-fuzzywuzzy: Fuzzy 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.
