1LevenshteinXS(3)      User Contributed Perl Documentation     LevenshteinXS(3)
2
3
4

NAME

6       Text::LevenshteinXS - An XS implementation of the Levenshtein edit
7       distance
8

SYNOPSIS

10        use Text::LevenshteinXS qw(distance);
11
12        print distance("foo","four");
13        # prints "2"
14
15        print distance("foo","bar");
16        # prints "3"
17

DESCRIPTION

19       This module implements the Levenshtein edit distance in a XS way.
20
21       The Levenshtein edit distance is a measure of the degree of proximity
22       between two strings.  This distance is the number of substitutions,
23       deletions or insertions ("edits") needed to transform one string into
24       the other one (and vice versa).  When two strings have distance 0, they
25       are the same.  A good point to start is:
26       <http://www.merriampark.com/ld.htm>
27

CREDITS

29       All the credits go to Vladimir Levenshtein the author of the algorithm
30       and to Lorenzo Seidenari who made the C implementation
31       <http://www.merriampark.com/ldc.htm>
32

SEE ALSO

34       Text::Levenshtein , Text::WagnerFischer , Text::Brew , String::Approx
35

AUTHOR

37       Copyright 2003 Dree Mistrut <dree@friul.it> Modifications Copyright
38       2004 Josh Goldberg <josh@3io.com>
39
40       This package is free software and is provided "as is" without express
41       or implied warranty.  You can redistribute it and/or modify it under
42       the same terms as Perl itself.
43
44
45
46perl v5.28.0                      2004-06-29                  LevenshteinXS(3)
Impressum