Paper: Text Disambiguation By Finite State Automata An Algorithm And Experiments On Corpora

ACL ID C92-3153
Title Text Disambiguation By Finite State Automata An Algorithm And Experiments On Corpora
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1992
Authors
  • Emmanuel Roche (University of Marne la Vallee, Marne la Vallee France)

Consulting a dictionary for the words of a given text provides multiple solutions, that is, ambiguities; thus, the sequence of words pilot studies could lead for example to: pilot: N singular, V infinitive, V (conjugated) studies: N plural, V (conjugated) pilot studies: N plural (compound). These informations could be organized in the form of a finite automaton such as: pilot studies N plural | "'" (compound) | The exploration of the context should provide clues that eliminate the non-relevant solutions. For this purpose we use local grammar constraints represented by finite automata. We have designed and implemented an algorithm which performs this task by using a large variety of linguistic constraints. Both the texts and the rules (or constraints) are represented in the same formalism,...