1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
Source: fuzzywuzzy
Maintainer: Debian Python Modules Team <python-modules-team@lists.alioth.debian.org>
Uploaders: Edward Betts <edward@4angle.com>
Section: python
Priority: optional
Build-Depends: debhelper (>= 9),
dh-python,
python-all,
python-levenshtein (>= 0.12),
python-nose,
python-pycodestyle,
python-setuptools,
python3-all,
python3-levenshtein (>= 0.12),
python3-nose,
python3-pycodestyle,
python3-setuptools
Standards-Version: 3.9.8
Homepage: https://github.com/seatgeek/fuzzywuzzy
Vcs-Browser: https://anonscm.debian.org/cgit/python-modules/packages/fuzzywuzzy.git
Vcs-Git: https://anonscm.debian.org/git/python-modules/packages/fuzzywuzzy.git
Package: python-fuzzywuzzy
Architecture: all
Depends: python-levenshtein (>= 0.12), ${misc:Depends}, ${python:Depends}
Provides: ${python:Provides}
Description: 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 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.
Package: python3-fuzzywuzzy
Architecture: all
Depends: python3-levenshtein (>= 0.12), ${misc:Depends}, ${python3:Depends}
Description: 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 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.
|
