http://qs1969.pair.com?node_id=855532


in reply to Match Algorithm: How close of a match

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