leolinardi / spelling-correction Goto Github PK
View Code? Open in Web Editor NEWA project from Design of Algorithms subject that implements a spelling correction algorithm, using a hash function with separate chaining and move-to-front technique. This program involves calculating Levenshtein distances.