It seems like Text::Levenshtein has been canonical in this field with repect to Perl. However, it may not be as well maintained as it could be. Jarkko Hietaniemi (co-author of Mastering Algorithms with Perl), in the POD for String::Approx (which is not appropriate for string comparisons) also mentions Text::WagnerFischer and Text::PhraseDistance. I don't find the latter still on CPAN. The Wagner-Fisher algorithm does look interesting but what I learn from Wikipedia leads me to believe it's just an implementation of measuring the Levenshtein distance. I have no idea whether it would be more or less suitable for your purposes than Text::Levenshtein, but might be worth a look to see if it fits your specific need. Sometimes where results are similar it just comes down to what fits better into your code design.
Dave
In reply to Re: Compare String within an Array
by davido
in thread Compare String within an Array
by tosaiju
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |