http://qs321.pair.com?node_id=289186


in reply to measuring the similarity between strings

To make more efficient you can also try Text::LevenshteinXS that is 1000% faster than plain Text::Levenshtein.
  • Comment on Re: measuring the similarity between strings