Paper: Spelling Correction In Agglutinative Languages

ACL ID A94-1037
Title Spelling Correction In Agglutinative Languages
Venue Applied Natural Language Processing Conference
Session Main Conference
Year 1994
Authors

A finite state generator Mg = (P, 6, V, S, F) where P is a set of states, $ is the state transition function, V is the output alphabet, S is the starting state, and F is a set of final states, generates, all correctly formed words of the language. The transitions of Mg are of the form /5(pi) = pj (Pi and pj 6 P), with an output v~ 6 V which denotes the lexical form of a morpheme in the language and also labels the transition. It should be noted that it is possible to go from one state Pi to another pj by more than one transition, outputting a different morpheme. We say a string Ytez is generated by Mg, if Y)e, is formed by concatenating, in order, the outputs of the machine as we traverse starting from S to one of the states in F. We denote by L(Mg) as the set of all lexical strings genera...