- 989 Downloads
We have seen the definitions of Finite State Automata (FSA) and of Push-Down Automata (PDA) in Chapter 1. The former accept all regular languages while the latter accept all context-free languages. In this chapter, we present automaton models for different extensions of CFG, in particular for TAG and LCFRS.
Unable to display preview. Download preview PDF.
- Rambow, Owen. 1994. Formal and Computational Aspects of Natural Language Syntax. Ph.D. thesis, University of Pennsylvania.Google Scholar
- Weir, David J. 1988. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania.Google Scholar
- Schabes, Yves and K.Vijay-Shanker. 1990. Deterministic left to right parsing of tree adjoining languages. In Proceedings of ACL, Pittsburgh.Google Scholar
- Vijay-Shanker, K. 1987. A Study of Tree Adjoining Grammars. Ph.D. thesis, University of Pennsylvania.Google Scholar
- Villemonte de la Clergerie, Éric. 2002. Parsing mildly context-sensitive languages with thread automata. In Proceedings of COLING’02, August.Google Scholar