fuzzywuzzy 0.10.0-1 source package in Ubuntu
Changelog
fuzzywuzzy (0.10.0-1) unstable; urgency=medium * New upstream release. -- Edward Betts <edward@4angle.com> Mon, 21 Mar 2016 17:14:04 +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 | |
|---|---|---|---|---|
| Xenial | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| fuzzywuzzy_0.10.0-1.dsc | 2.2 KiB | b1e8b46c7a8b01530959ee1e746e105c5677c80c8a66fdead9b0cde51f030314 |
| fuzzywuzzy_0.10.0.orig.tar.gz | 16.4 KiB | d9c361944476006e4d9feee4ed1e3e0d9c51906c841d9a7ce9217050e9bfa4fc |
| fuzzywuzzy_0.10.0-1.debian.tar.xz | 3.1 KiB | 8c25676cc2750feb4409549cb6b27498e63aa96af331c7c6af8431d0e0ada587 |
Available diffs
- diff from 0.8.1-4 to 0.10.0-1 (2.5 KiB)
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.
