Disentangling notions of specifier impenetrability: late adjunction, islands, and expressive power

DOI10.1007/978-3-642-23211-4_8zbMATH Open1347.91224OpenAlexW119688861MaRDI QIDQ3172834FDOQ3172834

Gregory M. Kobele, Jens Michaelis

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23211-4_8

Recommendations

• Models of adjunction in minimalist grammars
• Late Merge as Lowering Movement in Minimalist Grammars
• Logical Aspects of Computational Linguistics
• Locality and the complexity of minimalist derivation tree languages
• Closure properties of minimalist derivation tree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Linguistics (91F20)

Cites Work

• On multiple context-free grammars
• Title not available (Why is that?)
• Derivational minimalism
• Logical aspects of computational linguistics. 4th international conference, LACL 2001, Le Croisic, France, June 27--29, 2001. Proceedings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Pumping Lemma for Well-Nested Multiple Context-Free Languages
• Formalizing mirror theory
• Title not available (Why is that?)
• Observations on Strict Derivational Minimalism
• Well-Nestedness Properly Subsumes Strict Derivational Minimalism
• Minimalist Grammars in the Light of Logic
• Logical Aspects of Computational Linguistics

Cited In (1)

• Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard

This page was built for publication: Disentangling notions of specifier impenetrability: late adjunction, islands, and expressive power

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172834)