Syntactic Analysis by Local Grammars Automata: an Efficient Algorithm

Abstract

Local grammars can be represented in a very convenient way by automata. This paper describes and illustrates an efficient algorithm for the application of local grammars put in this form to lemmatized texts.

13 pages,Postscript uuencoded,to appear in Proceedings of COMPLEX '94

Cited by in corpus (2)

• Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks
• Algorithms for Speech Recognition and Language Processing