Peter Kugel
ABSTRACT
We discuss some sets of grammars whose generative power lies between that of the set of context-free grammars and that of the set of context-sensitive grammars. These sets are developed by subjecting generators of context-sensitive grammars to abstract versions of a "hardware" restriction to which the users of natural languages, unlike the describers of natural languages, might be subject.
- Chomsky, N., Syntactic Structures, Mouton, 1957.Google Scholar
- Miller, G. A. and Chomsky, N., "Finitary Models of Language Users" in Handbook of Mathematical Psychology, (Luce, Bush and Galanter eds.) Volume 2, John Wiley, 1963.Google Scholar
- Yngve, V. H., "A Model and an Hypothesis for Language Structure", Proceedings of the American Philosophical Society, Volume 104, pp. 444--466, 1960.Google Scholar
- Fraser, J. B., "Some Remarks on Elementary Transformations", in Quarterly Progress Report of the Research Laboratory of Electronics (M.I.T.), No. 71.Google Scholar
- Davis, M., Computability and Unsolvability, McGraw---Hill, 1958.Google Scholar
- Chomsky, N., "On Certain Formal Properties of Grammars", Information and Control, Volume 2, pp. 137--167, 1959.Google ScholarCross Ref
- Sets of grammars between context-free and context-sensitive
Recommendations
Lexicalized context-free grammars
ACL '93: Proceedings of the 31st annual meeting on Association for Computational LinguisticsLexicalized context-free grammar(LCFG) is an attractive compromise between the parsing efficiency of context-free grammar (CFG) and the elegance and lexical sensitivity of lexicalized tree adjoining grammar (LTAG). LCFG is a restricted form of LTAG that ...
LR(k)-parsing of Coupled-Context-Free Grammars
COLING '94: Proceedings of the 15th conference on Computational linguistics - Volume 1Coupled-Context-Free Grammars are a generalization of context-free grammars obtained by combining nonterminals to parentheses which can only be substituted simultaneously. Referring to the generative capacity of the grammars we obtain an infinite ...
Ordered Context-Free Grammars
Implementation and Application of AutomataAbstractWe propose a new unambiguous grammar formalism, referred to as ordered context-free grammars, which is identical to context-free grammars, apart from the property that it also places an order on parse trees. Since only a minor modification to ...
Comments