fuzzywuzzy 0.15.0-2 source package in Ubuntu
Changelog
fuzzywuzzy (0.15.0-2) unstable; urgency=medium * Correct package description (Closes: #858487) -- Edward Betts <edward@4angle.com> Mon, 17 Apr 2017 18:06:00 +0100
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.15.0-2.dsc | 2.3 KiB | 71fec3a2069d6f676b816d9ae8cd8b2135bf4a39485bc53142167bdcf141bf4c |
| fuzzywuzzy_0.15.0.orig.tar.gz | 27.4 KiB | 5b36957ccf836e700f4468324fa80ba208990385392e217be077d5cd738ae602 |
| fuzzywuzzy_0.15.0-2.debian.tar.xz | 3.4 KiB | f76f09cf24bd2b5b60c8dcb520410e83d00649bed32008ea6df886c3b11042c4 |
Available diffs
- diff from 0.14.0-1 to 0.15.0-2 (3.3 KiB)
No changes file available.
Binary packages built by this source
- python-fuzzywuzzy: Python 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.
- python3-fuzzywuzzy: Python 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.
