| 1 |
Source: fuzzywuzzy |
| 2 |
Maintainer: Debian Python Team <[email protected]> |
| 3 |
Uploaders: Edward Betts <[email protected]> |
| 4 |
Section: python |
| 5 |
Priority: optional |
| 6 |
Build-Depends: debhelper-compat (= 13), |
| 7 |
dh-sequence-python3, |
| 8 |
python3-all, |
| 9 |
python3-levenshtein, |
| 10 |
python3-pycodestyle <!nocheck>, |
| 11 |
python3-setuptools |
| 12 |
Rules-Requires-Root: no |
| 13 |
Standards-Version: 4.6.1 |
| 14 |
Homepage: https://github.com/seatgeek/fuzzywuzzy |
| 15 |
Vcs-Browser: https://salsa.debian.org/python-team/packages/fuzzywuzzy |
| 16 |
Vcs-Git: https://salsa.debian.org/python-team/packages/fuzzywuzzy.git |
| 17 |
|
| 18 |
Package: python3-fuzzywuzzy |
| 19 |
Architecture: all |
| 20 |
Depends: python3-levenshtein, ${misc:Depends}, ${python3:Depends} |
| 21 |
Description: Python 3 module for fuzzy string matching |
| 22 |
Various methods for fuzzy matching of strings in Python, including: |
| 23 |
. |
| 24 |
- String similarity: Gives a measure of string similarity between 0 and 100. |
| 25 |
- Partial string similarity: Inconsistent substrings are a common problem |
| 26 |
when string matching. To get around it, use a "best partial" heuristic |
| 27 |
when two strings are of noticeably different lengths. |
| 28 |
- Token sort: This approach involves tokenizing the string in question, |
| 29 |
sorting the tokens alphabetically, and then joining them back into a |
| 30 |
string. |
| 31 |
- Token set: A slightly more flexible approach. Tokenize both strings, but |
| 32 |
instead of immediately sorting and comparing, split the tokens into two |
| 33 |
groups: intersection and remainder. |