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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Stabler - Lx 185/209 2003<br />

T<br />

t<br />

C<br />

C<br />

CP<br />

C’<br />

DP(0)<br />

D<br />

the<br />

D’<br />

NP<br />

N’<br />

N<br />

student<br />

TP<br />

T<br />

t<br />

DP<br />

D’<br />

D<br />

T’<br />

V<br />

try<br />

vP<br />

v<br />

v<br />

v<br />

T<br />

-s<br />

v’<br />

V<br />

t<br />

T<br />

to<br />

VP<br />

V’<br />

TP<br />

T’<br />

DP<br />

t(0)<br />

V<br />

laugh<br />

vP<br />

v<br />

v’<br />

v<br />

VP<br />

V’<br />

V<br />

t<br />

([],[],the student try -s to laugh):C<br />

[]::=>T C (the student,[],try -s to laugh):T<br />

([],[],try -s to laugh):+k T,([],the,student):-k<br />

-s::v==> +k T ([],try,to laugh):v,([],the,student):-k<br />

([],try,to laugh):=D v<br />

[]::D<br />

[]::=>V =D v ([],try,to laugh):V,([],the,student):-k<br />

try::=T V ([],to,laugh):T,([],the,student):-k<br />

to::=v T ([],laugh,[]):v,([],the,student):-k<br />

([],laugh,[]):=D v<br />

[]::=>V =D v laugh::V<br />

([],the,student):D -k<br />

the::=N D -k student::N<br />

This sec<strong>on</strong>d derivati<strong>on</strong> is kind <strong>of</strong> wierd – it does not corresp<strong>on</strong>d to the semantic relati<strong>on</strong>s we wanted. How can<br />

we rule it out?<br />

One idea is that this empty pr<strong>on</strong>oun (sometimes called PRO) actually requires some kind <strong>of</strong> feature checking<br />

relati<strong>on</strong> with the infinitive tense. Sometimes the relevant feature is called “null case” (Chomsky and Lasnik,<br />

1993; Watanabe, 1993; Martin, 1996). (In fact, the proper account <strong>of</strong> c<strong>on</strong>trol c<strong>on</strong>structi<strong>on</strong>s is still c<strong>on</strong>troversial<br />

– cf., for example, Hornstein, 1999.)<br />

A simple versi<strong>on</strong> <strong>of</strong> this proposal is to use a new feature k0 for “null case,” in lexical items like these:<br />

ɛ:: D -k0<br />

to::=v +k0 T to::=Have +k0 T to::=Be +k0 T<br />

With these we derive just <strong>on</strong>e analysis for the student try -s to laugh:<br />

T<br />

t<br />

C<br />

C<br />

CP<br />

C’<br />

DP(1)<br />

D<br />

the<br />

D’<br />

NP<br />

N’<br />

N<br />

student<br />

TP<br />

T<br />

t<br />

T’<br />

DP<br />

t(1)<br />

V<br />

try<br />

v<br />

v<br />

vP<br />

v<br />

T<br />

-s<br />

v’<br />

V<br />

t<br />

VP<br />

V’<br />

DP(0)<br />

D’<br />

D<br />

TP<br />

T<br />

to<br />

T’<br />

DP<br />

t(0)<br />

V<br />

laugh<br />

vP<br />

v<br />

v’<br />

v<br />

VP<br />

V’<br />

V<br />

t<br />

([],[],the student try -s to laugh):C<br />

[]::=>T C (the student,[],try -s to laugh):T<br />

([],[],try -s to laugh):+k T,([],the,student):-k<br />

-s::v==> +k T ([],try,to laugh):v,([],the,student):-k<br />

([],try,to laugh):=D v<br />

[]::=>V =D v ([],try,to laugh):V<br />

try::=T V ([],to,laugh):T<br />

([],to,laugh):+k0 T,([],[],[]):-k0<br />

to::=v +k0 T ([],laugh,[]):v,([],[],[]):-k0<br />

([],laugh,[]):=D v<br />

[]::=>V =D v laugh::V<br />

Notice how this corresp<strong>on</strong>ds to the semantic relati<strong>on</strong>s diagrammed <strong>on</strong> the previous page.<br />

219<br />

([],the,student):D -k<br />

the::=N D -k student::N<br />

[]::D -k0

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

Saved successfully!

Ooh no, something went wrong!