python-levenshtein 0.12.0-5 source package in Ubuntu
Changelog
python-levenshtein (0.12.0-5) unstable; urgency=medium
* debian/python3-levenshtein.doc-base
- update Document and other info, to avoid conflict with the previous
python-levenshtein bin package; Closes: #946721
-- Sandro Tosi <email address hidden> Sat, 14 Dec 2019 16:08:25 -0500
Upload details
- Uploaded by:
- Sandro Tosi
- Uploaded to:
- Sid
- Original maintainer:
- Sandro Tosi
- Architectures:
- any
- Section:
- python
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| python-levenshtein_0.12.0-5.dsc | 2.1 KiB | a214eda663f644736c2141c984a30ab038259d5f78c9e088f160fde9b27085e9 |
| python-levenshtein_0.12.0.orig.tar.gz | 47.5 KiB | 033a11de5e3d19ea25c9302d11224e1a1898fe5abd23c61c7c360c25195e3eb1 |
| python-levenshtein_0.12.0-5.debian.tar.xz | 3.3 KiB | 035ae8642ca1dec6caed5f53035653ded40f5ffa6a1870f10c41114e7354d12c |
Available diffs
- diff from 0.12.0-3build1 (in Ubuntu) to 0.12.0-5 (2.1 KiB)
- diff from 0.12.0-4 to 0.12.0-5 (566 bytes)
No changes file available.
Binary packages built by this source
- python3-levenshtein: 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.
- python3-levenshtein-dbg: 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.
