[Python-modules-commits] r34194 - in packages/fuzzywuzzy/trunk/debian (changelog control)
edward at users.alioth.debian.org
edward at users.alioth.debian.org
Tue Sep 8 10:40:19 UTC 2015
Date: Tuesday, September 8, 2015 @ 10:40:18
Author: edward
Revision: 34194
new upstream version and longer description
Modified:
packages/fuzzywuzzy/trunk/debian/changelog
packages/fuzzywuzzy/trunk/debian/control
Modified: packages/fuzzywuzzy/trunk/debian/changelog
===================================================================
--- packages/fuzzywuzzy/trunk/debian/changelog 2015-09-07 21:46:47 UTC (rev 34193)
+++ packages/fuzzywuzzy/trunk/debian/changelog 2015-09-08 10:40:18 UTC (rev 34194)
@@ -1,3 +1,10 @@
+fuzzywuzzy (0.6.2-1) unstable; urgency=medium
+
+ * New upstream release
+ * debian/control: add a longer extended description
+
+ -- Edward Betts <edward at 4angle.com> Tue, 08 Sep 2015 10:34:12 +0100
+
fuzzywuzzy (0.6.1-1) unstable; urgency=low
* New upstream release.
Modified: packages/fuzzywuzzy/trunk/debian/control
===================================================================
--- packages/fuzzywuzzy/trunk/debian/control 2015-09-07 21:46:47 UTC (rev 34193)
+++ packages/fuzzywuzzy/trunk/debian/control 2015-09-08 10:40:18 UTC (rev 34194)
@@ -23,12 +23,34 @@
Depends: python-levenshtein (>= 0.12), ${misc:Depends}, ${python:Depends}
Provides: ${python:Provides}
Description: Fuzzy string matching in Python
- Various methods for fuzzy matching of strings 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.
+
Package: python3-fuzzywuzzy
Architecture: all
Depends: python3-levenshtein (>= 0.12), ${misc:Depends}, ${python3:Depends}
Description: Fuzzy string matching in Python (Python 3 version)
- Various methods for fuzzy matching of strings 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.
+ .
This package contains fuzzywuzzy for Python 3.
More information about the Python-modules-commits
mailing list