Jeni's Musings

... so it doesn’t overlap the right-hand column.] Levenshtein distance is a measure of how many edits it takes to get from one ... and two additions. One of the interesting features of Levenshtein distance is that there’s a fairly straight-forward dynamic ...

Story - Jeni - 2010-07-31 18:41 - 19 comments - 1 attachment

The big problem with the previous Levenshtein distance implementation is that it recurses so much a number of ... The problem is that the standard dynamic programming Levenshtein distance algorithm is written for procedural programming ... The dynamic programming algorithm for computing Levenshtein distance between two strings creates a matrix like this ...

Story - Jeni - 2010-07-31 18:43 - 5 comments - 0 attachments