Notes on computational linguistics.pdf - UCLA Department of ...
Notes on computational linguistics.pdf - UCLA Department of ...
Notes on computational linguistics.pdf - UCLA Department of ...
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 />
10.3.6 C<strong>on</strong>trol verbs<br />
There is another pattern <strong>of</strong> semantic relati<strong>on</strong>s that is actually more comm<strong>on</strong> that the raising verb pattern:<br />
namely, when a main clause has a verb selecting the main subject, and the embedded clause has no pr<strong>on</strong>ounced<br />
subject, with the embedded subject understood to be the same as the main clause subject:<br />
Titus wants to eat<br />
Titus tries to eat<br />
One proposal for these c<strong>on</strong>structi<strong>on</strong>s is that the embedded subjects in these sentences is an empty (i.e. unpr<strong>on</strong>ounced)<br />
pr<strong>on</strong>oun which must be “c<strong>on</strong>trolled” by the subject in the sense <strong>of</strong> being coreferential. 47<br />
The idea is that we have a semantic pattern here like this:<br />
c<strong>on</strong>trol<br />
agent<br />
theme<br />
agent<br />
Titus try −s to PRO praise Lavinia<br />
theme<br />
coreferential, "c<strong>on</strong>trolled" pr<strong>on</strong>ominal element<br />
We almost succeed in getting a simple versi<strong>on</strong> <strong>of</strong> this proposal with just the following lexical items:<br />
try::=T V want::=T V want::=T +k V<br />
ɛ::D<br />
Notice that the features <strong>of</strong> try are rather like a c<strong>on</strong>trol verb’s features, except that it does not assign case to<br />
the embedded object. Since the embedded object cannot get case from the infinitival either, we need to use<br />
the empty determiner provided here because this lexical item does not need case.<br />
The problem with this simple proposal is that the empty D is allowed to appear in either <strong>of</strong> two positi<strong>on</strong>s.<br />
The first <strong>of</strong> the following trees is the <strong>on</strong>e we want, but the lexical items allow the sec<strong>on</strong>d <strong>on</strong>e too:<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 />
T’<br />
DP<br />
t(0)<br />
V<br />
try<br />
v<br />
vP<br />
v<br />
v<br />
T<br />
-s<br />
v’<br />
T<br />
to<br />
V<br />
t<br />
VP<br />
V’<br />
TP<br />
T’<br />
DP<br />
D’<br />
D<br />
vP<br />
V<br />
laugh<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 />
47 For historical reas<strong>on</strong>s, these verbs are sometimes also called “equi verbs.”<br />
218<br />
[]::=>V =D v ([],try,to laugh):V<br />
try::=T V ([],to,laugh):T<br />
to::=v T ([],laugh,[]):v<br />
([],laugh,[]):=D v<br />
[]::=>V =D v laugh::V<br />
([],the,student):D -k<br />
the::=N D -k student::N<br />
[]::D