Python extension computing string distances and similarities
The Levenshtein Python C extension module contains functions for fast
computation of
* Levenshtein (edit) distance, and edit operations
* string similarity
* approximate median strings, and generally string averaging
* string sequence and set similarity
It supports both normal and Unicode strings.
Python 2.2 or newer is required.
StringMatcher.py is an example SequenceMatcher-like class built on the top of
Levenshtein. It misses some SequenceMatcher's functionality, and has some extra
OTOH.
Levenshtein.c can be used as a pure C library, too. You only have to define
NO_PYTHON preprocessor symbol (-DNO_PYTHON) when compiling it. The
functionality is similar to that of the Python extension. No separate docs are
provided yet, RTFS. But they are not interchangeable:
* C functions exported when compiling with -DNO_PYTHON (see Levenshtein.h) are
not exported when compiling as a Python extension (and vice versa)
* Unicode character type used with -DNO_PYTHON is wchar_t, Python
extension uses Py_UNICODE, they may be the same but don't count on it
Authors:
--------
mFabrik Research Oy
- Sources inherited from project openSUSE:Leap:15.2:Rings:1-MinimalX
- Links to openSUSE:Leap:15.2 / python-Levenshtein
- Has a link diff
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Leap:15.2:Staging:B/python-Levenshtein && cd $_
- Create Badge
Source Files
Filename | Size | Changed |
---|---|---|
Levenshtein-0.25.1.tar.gz | 0000149954 146 KB | |
python-Levenshtein.changes | 0000008108 7.92 KB | |
python-Levenshtein.spec | 0000002028 1.98 KB |
Comments 0