python-pyxDamerauLevenshtein
pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance. Courtesy `Wikipedia http://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance`_:
In information theory and computer science, the Damerau-Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a "distance" (string metric) between two strings, i.e., finite sequence of symbols, given by counting the minimum number of operations needed to transform one string into the other, where an operation is defined as an insertion, deletion, or substitution of a single character, or a transposition of two adjacent characters.
This implementation is based on `Michael Homer's pure Python implementation http://mwh.geek.nz/2009/04/26/python-damerau-levenshtein-distance/`_. It runs in ``O(N*M)`` time using ``O(M)`` space. It supports unicode characters.
For more information on pyxDamerauLevenshtein, visit the `GitHub project page https://github.com/gfairchild/pyxDamerauLevenshtein`_.
- Sources inherited from project devel:languages:python:misc
-
1
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout home:smarty12:Python/python-pyxDamerauLevenshtein && cd $_
- Create Badge
Source Files
Filename | Size | Changed |
---|---|---|
python-pyxDamerauLevenshtein.changes | 0000000144 144 Bytes | |
python-pyxDamerauLevenshtein.spec | 0000002752 2.69 KB | |
pyxDamerauLevenshtein-1.2.tar.gz | 0000027286 26.6 KB |
Latest Revision
Non-integrated tw package cleanup, batched
Comments 0