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
|
Welcome to Levenshtein's documentation!
=======================================
A C extension module for fast computation of:
- Levenshtein (edit) distance and edit sequence manipulation
- string similarity
- approximate median strings, and generally string averaging
- string sequence and set similarity
Levenshtein has a some overlap with difflib (SequenceMatcher). It
supports only strings, not arbitrary sequence types, but on the
other hand it's much faster.
It supports both normal and Unicode strings, but can't mix them, all
arguments to a function (method) have to be of the same type (or its
subclasses).
.. toctree::
:maxdepth: 2
:caption: Installation:
installation
.. toctree::
:maxdepth: 2
:caption: Usage:
levenshtein
.. toctree::
:maxdepth: 2
:caption: Changelog:
changelog
Indices and tables
==================
* :ref:`genindex`
* :ref:`modindex`
* :ref:`search`
|
