Re:Sift4: Fast and accurate string distance algorithm
by gingerlime on Tuesday October 27, 2015 @06:06PM
(#10461515)
Could someone explain the differences in simple terms?
I thought that Levenstein was the "golden standard" for this, but just curious what makes algorithms different. Is it purely a question of performance in terms of how fast it executes or memory consumption? Or is there a performance difference in terms of accuracy?
I thought that Levenstein was the "golden standard" for this, but just curious what makes algorithms different. Is it purely a question of performance in terms of how fast it executes or memory consumption? Or is there a performance difference in terms of accuracy?