I genuinely love seeing 50+ year old academic papers being used in modern projects - and there is certainly no shortage of occurrences like these.
This episode of Commit History covers functionality in the DuckDB project - specifically the levenshtein and damerau_levenshtein string similarity functions. We dive into their past, their differences, and how they can be used.
Links referenced in this episode:
The String-to-String Correction Problem by Wagner and Fischer (pub 1974)
A Technique for Computer Detection and Correction of Spelling Errors by Damerau (pub 1964)
An Extension of the String-to-String Correction Problem by Wagner and Lowrance (pub 1975)
Damerau-Levenshtein Distance wikipedia
Share this post