levenshtein-distance

I'm back with another longish question. Having experimented with a number of Python-based Damerau-Levenshtein edit distance implementations, I finally found the one listed below as editdistance_reference() . It seems to deliver correct results and appears to have an efficient implementation. So I set down to convert the code to Cython. on my test data, the reference method manages to deliver results for 11,000 comparisons (for pairs of words aound 12 letters long), while the Cythonized method does over 200,000 comparisons per second. Sadly, the results are incorrect: when you look at the

I found this bit of code that computes Levenshtein's distance between an answer and a guess: int CheckErrors(string Answer, string Guess) { int[,] d = new int[Answer.Length + 1, Guess.Length + 1]; for (int i = 0; i <= Answer.Length; i++) d[i, 0] = i; for (int j = 0; j <= Guess.Length; j++) d[0, j] = j; for (int j = 1; j <= Guess.Length; j++) for (int i = 1; i <= Answer.Length; i++) if (Answer[i - 1] == Guess[j - 1]) d[i, j] = d[i - 1, j - 1]; //no operation else d[i, j] = Math.Min(Math.Min( d[i - 1, j] + 1, //a deletion d[i, j - 1] + 1), //an insertion d[i - 1, j - 1] + 1 //a substitution );

I try to get the most matching color name depending on an given hex-value. For example if we have the hex-color #f00 we've to get the colorname red . '#ff0000' => 'red' '#000000' => 'black' '#ffff00' => 'yellow' I use currently the levenshtein-distance algorithm to get the closest color name, works well so far, but sometimes not as expected. For example: '#0769ad' => 'chocolate' '#00aaee' => 'mediumspringgreen' So any ideas how to get the result closer? Here's what I made to get the closest color: Array.closest = (function () { // http://en.wikibooks.org/wiki/Algorithm_Implementation/Strings

Regarding how they work, I was wondering low-level working stuff: What will trigger a merge conflict? Is the context also used by the tools in order to apply the patch? How do they deal with changes that do not actually modify source code behavior? For example, swapping function definition places. Regarding safety, truth be told, the huge Linux kernel repository is a testament for their safety. But I wondering about the following points: Are there any caveats/limitations regarding the tools that the user should be aware of? Have the algorithms been proven to not generate wrong results? If not,

I have a stored procedure that uses Levenshtein distance to determine the result closest to what the user typed. The only thing really affecting the speed is the function that calculates the Levenshtein distance for all the records before selecting the record with the lowest distance (I've verified this by putting a 0 in place of the call to the Levenshtein function). The table has 1.5 million records, so even the slightest adjustment may shave off a few seconds. Right now the entire thing runs over 10 minutes. Here's the method I'm using: ALTER function dbo.Levenshtein ( @Source nvarchar(200)

I've found a great python library implementing Levenshtein functions (distance, ratio, etc.) at http://code.google.com/p/pylevenshtein/ but the project seems inactive and the documentation is nowhere to be found. I was wondering if anyone knows better than me and can point me to the documentation. You won't have to generate the docs yourself. There's an online copy of the original Python Levenshtein API: http://www.coli.uni-saarland.de/courses/LT1/2011/slides/Python-Levenshtein.html Here is an example: # install with: pip install python-Levenshtein from Levenshtein import distance edit_dist =