On multiple context-free grammars
Theoretical Computer Science
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Derivational Minimalism Is Mildly Context-Sensitive
LACL '98 Selected papers from the Third 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
Efficient generation in primitive Optimality Theory
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Phonological derivation in optimality theory
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
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
A recognizer for minimalist languages
New developments in parsing technology
Top-down recognizers for MCFGs and MGs
CMCL '11 Proceedings of the 2nd Workshop on Cognitive Modeling and Computational Linguistics
Encoding phases using commutativity and non-commutativity in a logical framework
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Well-nestedness properly subsumes strict derivational minimalism
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
| Hi-index | 0.00 |
Previous studies have provided logical representations and efficient recognition algorithms for a simple kind of "minimalist grammars." This paper extends these grammars with head movement ("incorporation") and affix hopping. The grammars are presented as lexicons together with CKY-like reduction rules, so an efficient CKY-like recognition method is immediately given, and logical perspectives are briefly considered.