A generalization of the offline parsable grammars
1989pp. 237–242
Abstract
The offline parsable grammars apparently have enough formal power to describe human language, yet the parsing problem for these grammars is solvable. Unfortunately they exclude grammars that use x-bar theory - and these grammars have strong linguistic justification. We define a more general class of unification grammars, which admits x-bar grammars while preserving the desirable properties of offline parsable grammars.
Related Papers
- → PUZZLE GRAMMARS AND CONTEXT-FREE ARRAY GRAMMARS(1991)33 cited
- → Decision Problems of Phrase-Structure Grammars(1964)29 cited
- → Linear Grammars with One-Sided Contexts and Their Automaton Representation(2014)3 cited
- Generalized Context - Free Grammars, Multiple Context - Free Grammars and Head Grammars(1987)
- → A generalization of the offline parsable grammars(1989)7 cited