Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
A study of tree adjoining grammars
A study of tree adjoining grammars
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Parsing some constrained grammar formalisms
Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Some computational complexity results for synchronous context-free grammars
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Mildly non-projective dependency structures
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Parsing mildly non-projective dependency structures
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Efficient parsing of well-nested linear context-free rewriting systems
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Optimal rank reduction for linear context-free rewriting systems with fan-out two
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Dependency structures derived from minimalist grammars
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Grammar factorization by tree decomposition
Computational Linguistics
Dependency parsing schemata and mildly non-projective dependency parsing
Computational Linguistics
A polynomial time extension of parallel multiple context-free grammar
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
A finite state intersection approach to propositional satisfiability
Theoretical Computer Science
Mildly non-projective dependency grammar
Computational Linguistics
| Hi-index | 0.00 |
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition problem for linear context-free rewriting languages is studied at length here, presenting evidence that, even in some restricted cases, it cannot be solved efficiently. This entails the existence of a gap between, for example, tree adjoining languages and the subclass of linear context-free rewriting languages that generalizes the former class; such a gap is attributed to "crossing configurations". A few other interesting consequences of the main result are discussed, that concern the recognition problem for linear context-free rewriting languages.