Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

Bug#547144: ITP: python-editdist -- small and fast implementation of Levenshtein's edit distance algorithm for Python

0 views
Skip to first unread message

Ehren Kret

unread,
Sep 17, 2009, 5:20:10 AM9/17/09
to
Package: wnpp
Severity: wishlist
Owner: Ehren Kret <ehren...@gmail.com>


* Package name : python-editdist
Version : 0.3
Upstream Author : Damien Miller <d...@mindrot.org>
* URL : http://www.mindrot.org/projects/py-editdist/
* License : ISC
Programming Lang: Python, C
Description : small and fast implementation of Levenshtein's edit distance algorithm for Python

python-editdist is a Python module to calculate the Levenshtein edit distance
between two strings. It is implemented as a CPython module and is quite fast.

-- System Information:
Debian Release: 5.0
APT prefers jaunty-updates
APT policy: (500, 'jaunty-updates'), (500, 'jaunty-security'), (500, 'jaunty')
Architecture: amd64 (x86_64)

signature.asc

Sandro Tosi

unread,
Sep 17, 2009, 5:50:08 AM9/17/09
to
On Thu, Sep 17, 2009 at 10:25, Ehren Kret <ehren...@gmail.com> wrote:
> Package: wnpp
> Severity: wishlist
> Owner: Ehren Kret <ehren...@gmail.com>
>
>
> * Package name    : python-editdist
>  Version         : 0.3
>  Upstream Author : Damien Miller <d...@mindrot.org>
> * URL             : http://www.mindrot.org/projects/py-editdist/
> * License         : ISC
>  Programming Lang: Python, C
>  Description     : small and fast implementation of Levenshtein's edit distance algorithm for Python
>
> python-editdist is a Python module to calculate the Levenshtein edit distance
> between two strings.  It is implemented as a CPython module and is quite fast.

what's the difference with python-levenshtein:

$ apt-cache show python-levenshtein
...
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.

--
Sandro Tosi (aka morph, morpheus, matrixhasu)
My website: http://matrixhasu.altervista.org/
Me at Debian: http://wiki.debian.org/SandroTosi

--
To UNSUBSCRIBE, email to debian-bugs-...@lists.debian.org
with a subject of "unsubscribe". Trouble? Contact listm...@lists.debian.org

0 new messages