python-levenshtein 0.12.0-2build3 source package in Ubuntu
Changelog
python-levenshtein (0.12.0-2build3) artful; urgency=medium * No change rebuild to drop Python 3.5 support. -- Michael Hudson-Doyle <email address hidden> Fri, 04 Aug 2017 18:54:00 +1200
Upload details
- Uploaded by:
- Michael Hudson-Doyle
- Uploaded to:
- Artful
- Original maintainer:
- Sandro Tosi
- Architectures:
- any
- Section:
- python
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Bionic | release | universe | python |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| python-levenshtein_0.12.0.orig.tar.gz | 47.5 KiB | 033a11de5e3d19ea25c9302d11224e1a1898fe5abd23c61c7c360c25195e3eb1 |
| python-levenshtein_0.12.0-2build3.debian.tar.xz | 3.3 KiB | a03399dd45c39732d4059236b245b2d37c3d49976235f5073c8ddbe65509876c |
| python-levenshtein_0.12.0-2build3.dsc | 2.4 KiB | f9ecd62737f5da8fd270794d188611b03f11ba13b87cd7345f2b35254668ef47 |
Available diffs
- diff from 0.12.0-2build2 to 0.12.0-2build3 (338 bytes)
Binary packages built by this source
- python-levenshtein: 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.
- python-levenshtein-dbg: 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.
- python3-levenshtein: No summary available for python3-levenshtein in ubuntu artful.
No description available for python3-levenshtein in ubuntu artful.
- python3-levenshtein-dbg: No summary available for python3-levenshtein-dbg in ubuntu artful.
No description available for python3-
levenshtein- dbg in ubuntu artful.
