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

Stabler - Lx 185/209 2003
D
which
which pie,have -s,the king been eat -ing: C
DP(0)
ɛ,have -s,the king been eat -ing: +wh C, which pie: -wh
D’
NumP
Num’
Num NP
N’
N
pie
CP
Have
have
ɛ, ɛ, ɛ:: =>T +wh C the king,have -s,been eat -ing: T, which pie: -wh
ɛ,have -s,been eat -ing: +k T, the king: -k, which pie: -wh
T
T
-s
C
C
C’
DP(1)
D
the
D’
TP
NumP
Num’
Num NP
N’
N
king
T
t
T’
Have
t
Been
been
HaveP
Have’
ɛ,-s,ɛ:: =>Have +k T ɛ,have,been eat -ing: Have, the king: -k, which pie: -wh
CP
C’
C TP
DP(1)
D
the
D’
NumP t
Num’
Num NP
N’
N
king
T
T’
DP
t(1)
V
eat
v
v
vP
v
T
-s
BeenP
Been’
DP
t(1)
V
eat
vingP
ving
ving
-ing
ving’
DP(0)
ɛ,have,ɛ:: =Been Have ɛ,been,eat -ing: Been, the king: -k, which pie: -wh
v’
DP(0)
D
the
D’
VP
NumP t
Num’
Num NP
N’
N
pie
V
V’
DP
t(0)
ɛ,been,ɛ:: =ving Been ɛ,eat -ing,ɛ: ving, the king: -k, which pie: -wh
ɛ,eat -ing,ɛ: =D ving, which pie: -wh
t(0)
ɛ,-ing,ɛ:: =>V =D ving ɛ,eat,ɛ: V,whichpie:-wh
([],[],the king eat -s the pie):C
[]::=T C (the king,[],eat -s the pie):T
([],[],eat -s the pie):+k T,([],the,king):-k
VP
V
t
V’
ɛ,eat,ɛ: +k V, which pie: -k -wh
DP
t(0)
ɛ,eat,ɛ:: =D +k V ɛ,which,pie: D -k -wh
-s::v==> +k T ([],eat,the pie):v,([],the,king):-k
([],eat,the pie):=D v
[]::=>V =D v (the pie,eat,[]):V
([],eat,[]):+k V,([],the,pie):-k
eat::=D +k V ([],the,pie):D -k
ɛ,which,ɛ:: =N D -k -wh ɛ,pie,ɛ:: N
the::=Num D -k ([],[],pie):Num
The behavior of this grammar is English-like on a range of constructions:
(8) will -s the king laugh
(9) the king be -s laugh -ing
(10) which king have -s eat -en the pie
(11) the king will -s have been eat -ing the pie
We also derive
204
[]::=N Num pie::N
([],the,king):D -k
the::=Num D -k ([],[],king):Num
ɛ,the,king: D -k
ɛ,the,ɛ:: =N D -k ɛ,king,ɛ:: N
[]::=N Num king::N