On multiple context-free grammars
Theoretical Computer Science
The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
Derivational Minimalism Is Mildly Context-Sensitive
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
A Characterization of Minimalist Languages
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Parsing minimalist languages
Probabilistic top-down parsing and language modeling
Computational Linguistics
Natural Language Engineering
Efficient probabilistic top-down and left-corner parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Parsing linear context-free rewriting systems
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Complexity metrics in an incremental right-corner parser
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Parsing Beyond Context-Free Grammars
Parsing Beyond Context-Free Grammars
Closure properties of minimalist derivation tree languages
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Minimalist tree languages are closed under intersection with recognizable tree languages
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Locality and the complexity of minimalist derivation tree languages
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Geometric Representations for Minimalist Grammars
Journal of Logic, Language and Information
| Hi-index | 0.02 |
This paper defines a normal form for MCFGs that includes strongly equivalent representations of many MG variants, and presents an incremental priority-queue-based TD recognizer for these MCFGs. After introducing MGs with overt phrasal movement, head movement and simple adjunction are added without change in the recognizer. The MG representation can be used directly, so that even rather sophisticated analyses of properly non-CF languages can be defined very succinctly. As with the similar stack-based CF-methods, finite memory suffices for the recognition of infinite languages, and a fully connected left context for probabilistic analysis is available at every point.