The String::Approx module uses Levenshtein distance for its matching. According to the docs, the latest version is "2-3 times faster" than the previous one. Give it a try.
In reply to Re: Comparing likeness of two strings
by VSarkiss
in thread Comparing likeness of two strings
by RiotTown
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |