Tweet Notes (CSE 494/598 F11)
This will contain collectively generated notes
Tuesday, September 13, 2011
9/13/2011
The Damerau-Levenshtein distance between two queries is the minimum
number of basic insert, delete, replace, and swap operations to
convert one query to the other.
Kalin Jonas
Newer Post
Older Post
Home