Late Merge as Lowering Movement in Minimalist Grammars

  • Thomas Graf
Conference paper

DOI: 10.1007/978-3-662-43742-1_9

Volume 8535 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Graf T. (2014) Late Merge as Lowering Movement in Minimalist Grammars. In: Asher N., Soloviev S. (eds) Logical Aspects of Computational Linguistics. LACL 2014. Lecture Notes in Computer Science, vol 8535. Springer, Berlin, Heidelberg

Abstract

Minimalist grammars can be specified in terms of their derivation tree languages and a mapping from derivations to derived trees, each of which is definable in monadic second-order logic (MSO). It has been shown that the linguistically motivated operation Late Merge can push either component past the threshold of MSO-definability. However, Late Merge as used in the syntactic literature can be elegantly recast in terms of Lowering movement within the framework of Movement-generalized Minimalist grammars. As the latter are MSO-definable, the linguistically relevant fragment of Late Merge is too.

Keywords

Minimalist grammars countercyclic operations late merge lowering movement monadic second-order logic 

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 UniversityU.S.A