|File Search||Catalog||Content Search|
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.
Levenshtein Python extension and C library. The Levenshtein Python C extension module contains functions for fast computation of - Levenshtein (edit) distance, and edit operations - string similarity - approximate median strings, and generally string averaging - string sequence and set similarity It supports both normal and Unicode strings. Please see PKG-INFO for basic info, NEWS for news and more»
v0.10.1 2005-01-13 - apply_edit() broken for Unicodes was fixed (thanks to Radovan Garabik) - subtract_edit() function was added v0.10 2004-04-14 - Hamming distance, Jaro similarity metric and Jaro-Winkler similarity metric were added - ValueErrors raised on wrong argument types were fixed to TypeErrors v0.9 2003-12-31 - a poor-but-fast generalized median method quickme more»
python-levenshtein (0.10.1-1) unstable; urgency=low * Initial Release. Closes: #473274 -- Nicolas FRANCOIS (Nekral) <firstname.lastname@example.org> Sat, 29 Mar 2008 18:04:18 +0100
This package was debianized by Nicolas FRANCOIS (Nekral) <email@example.com> on Sat, more»