Descriptive Approach to Language - Theoretic Complexity
Descriptive Approach to Language - Theoretic Complexity
Structural similarity within and among languages
Theoretical Computer Science - Algebraic methods in language processing
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
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
Journal of Computer and System Sciences
Reference-Set constraints as linear tree transductions via controlled optimality systems
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Top-down recognizers for MCFGs and MGs
CMCL '11 Proceedings of the 2nd Workshop on Cognitive Modeling and Computational Linguistics
Movement-generalized minimalist grammars
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Importing montagovian dynamics into minimalism
LACL'12 Proceedings of the 7th 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
| Hi-index | 0.00 |
Recently, the question has been raised whether the derivation tree languages of Minimalist grammars (MGs; [14, 16]) are closed under intersection with regular tree languages [4, 5]. Using a variation of a proof technique devised by Thatcher [17], I show that even though closure under intersection does not obtain, it holds for every MG and regular tree language that their intersection is identical to the derivation tree language of some MG modulo category labels. It immediately follows that the same closure property holds with respect to union, relative complement, and certain kinds of linear transductions. Moreover, enriching MGs with the ability to put regular constraints on the shape of their derivation trees does not increase the formalism's weak generative capacity. This makes it straightforward to implement numerous linguistically motivated constraints on the Move operation.