Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Tree-oriented proofs of some theorems on context-free and indexed languages
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Syntax and semantics in parsing: an application to montague grammar.
Syntax and semantics in parsing: an application to montague grammar.
English and the class of context-free languages
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
On two recent attempts to show that English is not a CFL
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Strong generative capacity, weak generative capacity, and modern linguistic theories
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Phrase structure trees bear more fruit than you would have thought
Computational Linguistics
Computational complexity and lexical-functional grammar
Computational Linguistics
Coping with syntactic ambiguity or how to put the block in the box on the table
Computational Linguistics
The representation of constituent structures for finite-state parsing
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
The semantics of grammar formalisms seen as computer languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Formal constraints on metarules
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A finite-state parser for use in speech recognition
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A practical comparison of parsing strategies
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Computational aspects of M-grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Encyclopedia of Computer Science
Weighted interaction of syntax and semantics in natural language analysis
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
Metatheoretical findings regarding the decidability, generative capacity, and recognition complexity of several syntactic theories are surveyed. These include context-free, transformational, lexical-functional, generalized phrase structure, tree adjunct, and stratificational grammars. The paper concludes with a discussion of the implications of these results with respect to linguistic theory.