1package Text::LevenshteinXS; 2 3use strict; 4use warnings; 5use Carp; 6 7require Exporter; 8require DynaLoader; 9use AutoLoader; 10 11our @ISA = qw(Exporter DynaLoader); 12 13our %EXPORT_TAGS = ( 'all' => [ qw( 14 15) ] ); 16 17our @EXPORT_OK = ( @{ $EXPORT_TAGS{'all'} } ); 18 19our @EXPORT = qw( 20distance 21); 22our $VERSION = '0.03'; 23 24bootstrap Text::LevenshteinXS $VERSION; 25 261; 27__END__ 28 29=head1 NAME 30 31Text::LevenshteinXS - An XS implementation of the Levenshtein edit distance 32 33=head1 SYNOPSIS 34 35 use Text::LevenshteinXS qw(distance); 36 37 print distance("foo","four"); 38 # prints "2" 39 40 print distance("foo","bar"); 41 # prints "3" 42 43 44=head1 DESCRIPTION 45 46This module implements the Levenshtein edit distance in a XS way. 47 48The Levenshtein edit distance is a measure of the degree of proximity between two strings. 49This distance is the number of substitutions, deletions or insertions ("edits") 50needed to transform one string into the other one (and vice versa). 51When two strings have distance 0, they are the same. 52A good point to start is: <http://www.merriampark.com/ld.htm> 53 54 55=head1 CREDITS 56 57All the credits go to Vladimir Levenshtein the author of the algorithm and to 58Lorenzo Seidenari who made the C implementation <http://www.merriampark.com/ldc.htm> 59 60 61=head1 SEE ALSO 62 63Text::Levenshtein , Text::WagnerFischer , Text::Brew , String::Approx 64 65 66=head1 AUTHOR 67 68Copyright 2003 Dree Mistrut <F<dree@friul.it>> 69Modifications Copyright 2004 Josh Goldberg <F<josh@3io.com>> 70 71This package is free software and is provided "as is" without express 72or implied warranty. You can redistribute it and/or modify it under 73the same terms as Perl itself. 74 75=cut 76