Re^2: Fast string similarity method

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
[download]

Comment on Re^2: Fast string similarity method Download Code

Replies are listed 'Best First'.
Re^3: Fast string similarity method by Limbic~Region (Chancellor) on May 29, 2007 at 17:00 UTC
icanwin, I am glad Text::LevenshteinXS looks promising. You have missed my other point though. You have asked for helping optimizing your solution but have not provided enough information to do so. There are plenty of "what if" scenarios but you are holding all the cards. If you want more advice beyond faster edit distance checking, please provide more information. Cheers - L~R	[reply]