On Thu, Sep 17, 2009 at 10:25, Ehren Kret <ehren.k...@gmail.com> wrote: > Package: wnpp > Severity: wishlist > Owner: Ehren Kret <ehren.k...@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-devel-requ...@lists.debian.org with a subject of "unsubscribe". Trouble? Contact listmas...@lists.debian.org
