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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
Source: python-levenshtein
Section: python
Priority: optional
Maintainer: Sandro Tosi <morph@debian.org>
Uploaders: Debian Python Modules Team <python-modules-team@lists.alioth.debian.org>
Build-Depends: python-all-dev (>= 2.5.3-1~), python-all-dbg, python3-all-dev, python3-all-dbg, dh-python, debhelper (>= 11), python-setuptools, python3-setuptools
X-Python-Version: all
Standards-Version: 4.3.0
Homepage: https://github.com/ztane/python-Levenshtein
Vcs-Git: https://salsa.debian.org/python-team/modules/python-levenshtein.git
Vcs-Browser: https://salsa.debian.org/python-team/modules/python-levenshtein
Package: python-levenshtein
Architecture: any
Depends: ${shlibs:Depends}, ${python:Depends}, ${misc:Depends}
Description: extension for computing string similarities and edit distances
The Levenshtein module computes Levenshtein distances, similarity ratios,
generalized medians and set medians of Unicode or non-Unicode strings.
Because it's implemented in C, it's much faster than the corresponding
Python library functions and methods.
.
The Levenshtein distance is the minimum number of single-character
insertions, deletions, and substitutions to transform one string into
another.
.
It is useful for spell checking, or fuzzy matching of gettext messages.
Package: python3-levenshtein
Architecture: any
Depends: ${shlibs:Depends}, ${python3:Depends}, ${misc:Depends}
Description: extension for computing string similarities and edit distances (Python 3)
The Levenshtein module computes Levenshtein distances, similarity ratios,
generalized medians and set medians of Unicode or non-Unicode strings.
Because it's implemented in C, it's much faster than the corresponding
Python library functions and methods.
.
The Levenshtein distance is the minimum number of single-character
insertions, deletions, and substitutions to transform one string into
another.
.
It is useful for spell checking, or fuzzy matching of gettext messages.
.
This package contains Levenshtein for Python 3.
Package: python-levenshtein-dbg
Section: debug
Architecture: any
Depends: python-levenshtein (= ${binary:Version}), ${shlibs:Depends}, ${python:Depends}, ${misc:Depends}
Description: extension for computing string similarities and edit distances(debug extension)
The Levenshtein module computes Levenshtein distances, similarity ratios,
generalized medians and set medians of Unicode or non-Unicode strings.
Because it's implemented in C, it's much faster than the corresponding
Python library functions and methods.
.
The Levenshtein distance is the minimum number of single-character
insertions, deletions, and substitutions to transform one string into
another.
.
It is useful for spell checking, or fuzzy matching of gettext messages.
.
This package contains the extensions built for the Python debug interpreter.
Package: python3-levenshtein-dbg
Section: debug
Architecture: any
Depends: python3-levenshtein (= ${binary:Version}), ${shlibs:Depends}, ${python3:Depends}, ${misc:Depends}
Description: extension for computing string similarities and edit distances(py3k debug ext)
The Levenshtein module computes Levenshtein distances, similarity ratios,
generalized medians and set medians of Unicode or non-Unicode strings.
Because it's implemented in C, it's much faster than the corresponding
Python library functions and methods.
.
The Levenshtein distance is the minimum number of single-character
insertions, deletions, and substitutions to transform one string into
another.
.
It is useful for spell checking, or fuzzy matching of gettext messages.
.
This package contains the extensions built for the Python 3 debug interpreter.
|
