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 />
9.2.2 Some CKY-like derivati<strong>on</strong>s<br />
(26) The grammar we formulated for the CKY parsing strategy is more succinct than the tree-based formulati<strong>on</strong>s,<br />
and most explicitly reveals the insight <strong>of</strong> Pollard (1984) and Michaelis (1998) that trees play the<br />
role <strong>of</strong> dividing the input string into a (finite!) number <strong>of</strong> related parts.<br />
Furthermore, since the latter formulati<strong>on</strong> <strong>of</strong> the grammar derives tuples <strong>of</strong> categorized strings, it becomes<br />
feasible to present derivati<strong>on</strong>s trees again, since the structures at the derived nodes are tuples<br />
<strong>of</strong> strings rather than trees.<br />
In fact, the latter representati<strong>on</strong> is succinct enough thatitisfeasibletodisplaymanycompletederivati<strong>on</strong>s,<br />
every step in fully explicit form.<br />
With a little practice, it is not difficult to translate back and forth betweeen these explicit derivati<strong>on</strong> trees<br />
and the corresp<strong>on</strong>ding X-bar derivati<strong>on</strong>s that are more familiar from mainstream linguistic theory. We<br />
briefly survey some examples.<br />
(27) SOVI: Naive Tamil. We first c<strong>on</strong>sider some more very simple examples inspired by Mahajan (2000). The<br />
order Subject-Object-Verb-Inflecti<strong>on</strong> is defined by the following grammar:<br />
lavinia::d titus::d<br />
praise::vt criticize::vt<br />
laugh::v cry::v<br />
ɛ::=i c -s::=pred +v i<br />
ɛ::=vt =d =d pred -v ɛ::=v =d pred -v<br />
Notice that the -s in the string comp<strong>on</strong>ent <strong>of</strong> an expressi<strong>on</strong> signals that this is an affix, while the -v in<br />
the feature sequence <strong>of</strong> an expressi<strong>on</strong> signals that this item must move to a +v licensing positi<strong>on</strong>.<br />
With this lexic<strong>on</strong>, we have the following derivati<strong>on</strong> <strong>of</strong> the string titus lavinia praise -s ∈ Sc(NT ):<br />
titus lavinia praise -s: c<br />
ɛ:: =i c titus lavinia praise -s: i<br />
-s: +v i, titus lavinia praise: -v<br />
-s:: =pred +v i titus lavinia praise: pred -v<br />
lavinia praise: =d pred -v<br />
praise:=d=dpred-v<br />
ɛ::=vt=d=dpred-v praise:: vt<br />
lavinia:: d<br />
titus:: d<br />
dP<br />
titus<br />
predP1<br />
dP<br />
lavinia<br />
cP<br />
c iP<br />
predP<br />
pred’<br />
pred vtP<br />
i<br />
-s<br />
praise<br />
These c<strong>on</strong>venti<strong>on</strong>al structures show some aspects <strong>of</strong> the history <strong>of</strong> the derivati<strong>on</strong>s, something which<br />
can be useful for linguists even though it is not necessary for the calculati<strong>on</strong> <strong>of</strong> derived expressi<strong>on</strong>s.<br />
(28) VISO: Naive Zapotec<br />
An VSO language like Zapotec can be obtained by letting the verb select its object and then its subject,<br />
and then moving the just the lowest part <strong>of</strong> the SOV complex move to the “specifier” <strong>of</strong> I(nflecti<strong>on</strong>). The<br />
following 10 lexical items provide a naive grammar <strong>of</strong> this kind:<br />
lavinia::d titus::d<br />
praise::vt -v laugh::v -v<br />
ɛ::=i c -s::=pred +v i<br />
ɛ::=vt =d =d pred ɛ::=v =d pred<br />
iP<br />
predP<br />
With this lexic<strong>on</strong>, we have the following derivati<strong>on</strong> <strong>of</strong> the string praise -s titus lavinia ∈ Sc(NT ):<br />
188<br />
t1