20.07.2013 Views

Notes on computational linguistics.pdf - UCLA Department of ...

Notes on computational linguistics.pdf - UCLA Department of ...

Notes on computational linguistics.pdf - UCLA Department of ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Stabler - Lx 185/209 2003<br />

dP<br />

t 3<br />

v<br />

makes<br />

accP 4<br />

vP 2<br />

dP<br />

t 1<br />

accP<br />

dP 1<br />

tortillas<br />

accP<br />

benP 7<br />

maria makes tortillas for me <strong>on</strong> tuesday: c<br />

accP<br />

acc vP<br />

t 2<br />

P<br />

for<br />

PP 6<br />

ɛ:: =t c maria makes tortillas for me <strong>on</strong> tuesday: t<br />

makes tortillas for me <strong>on</strong> tuesday: +k t, maria: -k<br />

ɛ: =p +ben tem, makes tortillas for me: -ben, maria: -k<br />

dP<br />

t 5<br />

dP 3<br />

maria<br />

pP<br />

cP<br />

c tP<br />

dP 5<br />

me<br />

benP<br />

pP<br />

t’<br />

t temP<br />

pP<br />

p PP<br />

t 6<br />

benP<br />

ben accP<br />

ɛ:: =tem +k t makes tortillas for me <strong>on</strong> tuesday: tem, maria: -k<br />

<strong>on</strong> tuesday: +ben tem, makes tortillas for me: -ben, maria: -k<br />

ɛ:: =ben =p +ben tem makes tortillas for me: ben -ben, maria: -k<br />

ɛ: =p +acc ben -ben, makes tortillas: -acc, maria: -k<br />

for me: +acc ben -ben, makes tortillas: -acc, maria: -k<br />

ɛ:: =acc =p +acc ben -ben makes tortillas: acc -acc, maria: -k<br />

makes tortillas: =d acc -acc<br />

tortillas: +v =d acc -acc, makes: -v<br />

ɛ: +k +v =d acc -acc, makes: -v, tortillas: -k<br />

ɛ:: =v +k +v =d acc -acc makes: v -v, tortillas: -k<br />

maria:: d -k<br />

makes:: =d v -v tortillas:: d -k<br />

t 4<br />

for me: p<br />

me: +p p, for: -p<br />

ɛ: +k+pp,for:-p,me:-k<br />

P<br />

<strong>on</strong><br />

PP 9<br />

dP<br />

t 8<br />

ɛ:: =P +k +p p for: P -p, me: -k<br />

pP<br />

dP 8<br />

tuesday<br />

for:: =d P -p me:: d -k<br />

temP<br />

pP<br />

pP<br />

p PP<br />

t 9<br />

temP<br />

<strong>on</strong> tuesday: p<br />

tuesday: +p p, <strong>on</strong>: -p<br />

ɛ: +k +p p, <strong>on</strong>: -p, tuesday: -k<br />

tem benP<br />

ɛ:: =P +k +p p <strong>on</strong>: P -p, tuesday: -k<br />

t 7<br />

<strong>on</strong>:: =d P -p tuesday:: d -k<br />

d. PPs in a “cascade”<br />

Yet another idea is to reject the idea that the complement <strong>of</strong> a prepositi<strong>on</strong> is generally its object, in<br />

favor <strong>of</strong> the view that the complement is another PP with the object in its specifier (Pesetsky, 1995). We<br />

could also capture this idea, but we leave it as an exercise.<br />

196

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!