Models of Adjunction in Minimalist Grammars

  • Thomas Graf
Conference paper

DOI: 10.1007/978-3-662-44121-3_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8612)
Cite this paper as:
Graf T. (2014) Models of Adjunction in Minimalist Grammars. In: Morrill G., Muskens R., Osswald R., Richter F. (eds) Formal Grammar. FG 2014. Lecture Notes in Computer Science, vol 8612. Springer, Berlin, Heidelberg

Abstract

Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational level. Weak generative capacity is not affected, and while subregular complexity varies betweeen the three proposals, it does not exceed the complexity imposed by Move. The closure of Minimalist derivation tree languages under intersection with regular tree languages, however, is lost.

Keywords

Minimalist grammars adjunction derivation trees subregular tree languages closure properties 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Thomas Graf
    • 1
  1. 1.Department of LinguisticsStony Brook UniversityUSA

Personalised recommendations