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

Stabler - Lx 185/209 2003
that::=T Ce ɛ::=T Ce
ɛ::=T +wh Cwh ɛ::=>T +wh Cwh
know::=Ce V know::=Cwh V know::=D +k V know::V
doubt::=Ce V doubt::=Cwh V doubt::V
think::=Ce V think::V
wonder::=Cwh V wonder::V
With these lexical entries we obtain derivations like this (showing a conventional depiction on the left and the
actual derivation tree on the right):
T
t
C
C
CP
C’
DP(1)
D’
D
Titus
TP
T
t
T’
DP
t(1)
V
know
v
vP
v
v
T
-s
v’
C
that
V
t
VP
V’
CP
C’
DP(0)
D’
D
Lavinia
TP
T
t
T’
DP
t(0)
V
laugh
v
vP
v
v
v’
T
-s
VP
V’
V
t
([],[],Titus know -s that Lavinia laugh -s):C
[]::=>T C (Titus,[],know -s that Lavinia laugh -s):T
([],[],know -s that Lavinia laugh -s):+k T,([],Titus,[]):-k
-s::v==> +k T ([],know,that Lavinia laugh -s):v,([],Titus,[]):-k
([],know,that Lavinia laugh -s):=D v
Semantically, the picture corresponds to the derivation as desired:
CP selecting
agent
[]::=>V =D v ([],know,that Lavinia laugh -s):V
theme
We can also add nouns that select clausal complements:
With these lexical entries we get trees like this:
Titus::D -k
know::=C V ([],that,Lavinia laugh -s):C
agent
Titus know −s that Lavinia laugh −s
claim::=C N proposition::=C N
210
that::=T C (Lavinia,[],laugh -s):T
([],[],laugh -s):+k T,([],Lavinia,[]):-k
-s::v==> +k T ([],laugh,[]):v,([],Lavinia,[]):-k
([],laugh,[]):=D v
[]::=>V =D v laugh::V
Lavinia::D -k