Rechercher une page de manuel
Text::LevenshteinXS.3pm
Langue: en
Version: 2004-06-29 (fedora - 05/07/09)
Section: 3 (Bibliothèques de fonctions)
NAME
Text::LevenshteinXS - An XS implementation of the Levenshtein edit distanceSYNOPSIS
use Text::LevenshteinXS qw(distance); print distance("foo","four"); # prints "2" print distance("foo","bar"); # prints "3"
DESCRIPTION
This module implements the Levenshtein edit distance in a XS way.The Levenshtein edit distance is a measure of the degree of proximity between two strings. This distance is the number of substitutions, deletions or insertions (``edits'') needed to transform one string into the other one (and vice versa). When two strings have distance 0, they are the same. A good point to start is: <http://www.merriampark.com/ld.htm>
CREDITS
All the credits go to Vladimir Levenshtein the author of the algorithm and to Lorenzo Seidenari who made the C implementation <http://www.merriampark.com/ldc.htm>SEE ALSO
Text::Levenshtein , Text::WagnerFischer , Text::Brew , String::ApproxAUTHOR
Copyright 2003 Dree Mistrut <dree@friul.it> Modifications Copyright 2004 Josh Goldberg <josh@3io.com>This package is free software and is provided ``as is'' without express or implied warranty. You can redistribute it and/or modify it under the same terms as Perl itself.
Contenus ©2006-2024 Benjamin Poulain
Design ©2006-2024 Maxime Vantorre