I already check for the string length in order to reduce the comparisions. I didn't post the code due to make it as short as possible.
I'm currently testing the Text::LevenshteinXS method. It is extremly fast in comparision with the String::Similarity, but I still have to make some changes in order to get the same results.
UPDATE
I've made a mistake testing the Text::LevenshteinXSL. Here I post the real time each method took using a 5000 string collection
Text::LevenshteinXS -> 2m 40s String::Similarity -> 3m
In reply to Re^2: Fast string similarity method
by icanwin
in thread Fast string similarity method
by icanwin
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |