fuzzywuzzy 0.8.0-1ubuntu1 source package in Ubuntu
Changelog
fuzzywuzzy (0.8.0-1ubuntu1) xenial; urgency=medium * Build-depend on python-pep8 instead of pep8 to fix FTBFS. -- Logan Rosen <email address hidden> Mon, 21 Dec 2015 01:45:00 -0500
Upload details
- Uploaded by:
- Logan Rosen
- Uploaded to:
- Xenial
- Original maintainer:
- Ubuntu Developers
- 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.0.orig.tar.gz | 16.3 KiB | 3845ecd7c790beae111a2d3956b4ba80fe1113eecf045c4b364394eaa01ad9ce |
| fuzzywuzzy_0.8.0-1ubuntu1.debian.tar.xz | 3.1 KiB | 937382ee0c816d661fccff597ca482ebed36b8eba1594afbf1cdb6a6074c97c7 |
| fuzzywuzzy_0.8.0-1ubuntu1.dsc | 2.0 KiB | 9f24b4fc1129ed6f3056f027fcbd727b3b01ac7f513a1f97223f27b4c03a0110 |
Available diffs
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.
