From: Jeremy <jwells@...>
Date: 2007-05-18T17:40:55+09:00
Subject: Re: Damerau-Levenshtein_distance

Daniel Martin wrote:
> Well, the algorithm itself is O(n*m), where n and m are the size of
> the strings involved, so on large strings it's going to get slow.
>
> I was able to shave about 40% off the time for your method, and fix a
> bug.
>
>   
Thanks, thats really useful.  I guess that now the data i'm comparing 
has grown it would be better to use a diff type method than this.