Syntactic Confectionery Delight | |
PerlMonks |
Re: Match Algorithm: How close of a matchby jethro (Monsignor) |
on Aug 17, 2010 at 15:50 UTC ( [id://855532]=note: print w/replies, xml ) | Need Help?? |
Usually the levenshtein distance is used for this. Search CPAN for the name and you will find Text::Levenshtein and Text::LevenshteinXS. And there are other algorithms, Text::WagnerFischer and Text::PhraseDistance
In Section
Seekers of Perl Wisdom
|
|