Eliminating Sidewards Movement
Gregory M. Kobele Humboldt-Universität zu Berlin
Eliminating Sidewards Movement Gregory M. Kobele - - PowerPoint PPT Presentation
Eliminating Sidewards Movement Gregory M. Kobele Humboldt-Universitt zu Berlin The Main Idea What are the structures and operations underlying natural language syntax? A case study: Nunes (1995) sidewards movement analysis of
Gregory M. Kobele Humboldt-Universität zu Berlin
parasitic gaps is unnecessarily so.
pg):
each other:
analysis of ATB extraction to PGs
this idea using the mechanism of sidewards movement...
between trees (Citko, 2005; van Riemsdijk, 2006; ...)
[Which book]1 did John [[read [which book]1] [after Bill stole [which book]1]]
[Which book]1 did John [[read [which book]1] [after Bill stole [which book]1]]
is different from being identical to that thing)
can phonologically delete copies
chain with another un-deleted copy
chain with another un-deleted copy
`numerations’
chain with another un-deleted copy
commands the next,
John [[read [this book]1] [after Bill stole [this book]1]]
another,
ends up in a position c-commanding all previous positions
[Which book]1 did John [[read [which book]1] [after Bill stole [which book]1]]
movement chains’ are filtered
as neither c-commands the
movement conspire to permit
chains formed by ATB movement:
VP VP read which book PP after S Bill VP stole which book
S’ did S John VP VP read which book PP after S Bill VP stole which book
S’ which book did S John VP VP read which book PP after S Bill VP stole which book
complex spell-out filters (could be referred to as a `look-ahead’ problem)
allows for a straightforward implementation of forking chains; i.e. of ATB-style extraction
categories; an atomic operation
percolation mechanism in one form or another (Manzini & Roussou, 2000; Neeleman & van de Koot, 2002; Sternefeld, 2006; Kobele, 2007/08/09a/09b)
2009b):
which a copy is present, but not in which a trace is present
expression has not yet been inserted into the structure
satisfies the percolated trace dependency
and provides a direct description of the desired structures
moves from numerations (multi-sets of trees), to lexical sub-arrays (a recursive data structure; LSA := Multiset of Tree | Multiset of LSA)
identity check required by ATB movement
`moving pieces’ to be a trace!
bar movement (not necessary, but compatible),
parasitic gap containing PP
island with a trace outside the island
VP VPNP read tNP PP after S’ which book SNP Bill VPNP stole tNP
S’ did S John VP VPNP read tNP PP after S’ which book SNP Bill VPNP stole tNP
it is doing
same dependencies described indirectly by the sidewards movement theory
sets (of sets ...) thereof, are the basic objects of syntactic theory