String comparison algorithm (likeness)

added by alexandermp
9/21/2010 1:00:52 AM

7 Kicks, 664 Views

Compare strings. How much alike are 2 strings. Pseudo semantic analysis. Levenshtein distance.


1 comments

dvhh
9/21/2010 12:26:55 AM
thecomment system on the site is broken returned an error on a callback (didn't dig further )
however the wikipedia entry (http://en.wikipedia.org/wiki/Levenshtein_distance) specifies some obvious optimization of the levenshtein distance algorithm
you can store only the current and previous row to minimize memory requirement. thus optimizing the memory allocation for your calculations:
http://pastebin.ca/1945598