python-levenshtein 0.25.1-3 source package in Ubuntu
Changelog
python-levenshtein (0.25.1-3) unstable; urgency=medium * Team upload. * Upload to unstable. * Fix compilation with Python 3.12 (Closes: #1061434, #1065976) -- Stuart Prescott <email address hidden> Sat, 27 Apr 2024 11:45:48 +1000
Upload details
- Uploaded by:
- Debian Python Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Python Team
- Architectures:
- any all
- Section:
- python
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | python |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| python-levenshtein_0.25.1-3.dsc | 2.2 KiB | 7efb1ca2ea32973030dd607c920c6237884bb5469d4d71570daa0b8c895015cf |
| python-levenshtein_0.25.1.orig.tar.xz | 33.9 KiB | 705509c919caf701346d0cfa7f0c703fd39854abe314f1f6998cfa91c30bc9b4 |
| python-levenshtein_0.25.1-3.debian.tar.xz | 3.8 KiB | 215302622d09516d909a53a7e1627a783b7a955318230c0b40714a20e948de2f |
Available diffs
- diff from 0.25.1-2 to 0.25.1-3 (353 bytes)
No changes file available.
Binary packages built by this source
- python-levenshtein-doc: extension for computing string similarities and edit distances (Documentations)
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 documentation.
- 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-dbgsym: debug symbols for python3-levenshtein
