Fast String Correction with Levenshtein Automata (2002) (10.1.1.16.652) 计算机科学

Fast String Corre tion with Levenshtein-AutomataKlaus U. S hulzCISUniversity of Muni hs hulz� is.uni-muen hen.de Stoyan MihovLinguisti Modelling LaboratoryLPDP { Bulgarian A ademy of S ien esstoyan�lml.bas.bg2 Abstra tThe Levenshtein-distan e between two words is the minimal number of insertions,deletions or substitutions that are needed to transform one word into the other.Levenshtein-automata of degree n for a wordW are de�ned as �nite state automatathat regognize the set of all words V where