Notes on computational linguistics.pdf - UCLA Department of ...
Notes on computational linguistics.pdf - UCLA Department of ...
Notes on computational linguistics.pdf - UCLA Department of ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Stabler - Lx 185/209 2003<br />
10.6.4 Coordinati<strong>on</strong><br />
Coordinati<strong>on</strong> structures are comm<strong>on</strong> across languages, and pose some interesting problems for our grammar.<br />
Notice that we could parse:<br />
Titus praise -s the c<strong>of</strong>fee and pie<br />
Titus laugh -s or Lavinia laugh -s<br />
Titus be -s happy and proud<br />
by adding lexical items like these to the grammar gh4.pl:<br />
But this approach will not work for<br />
and::=N =N N and::=C =C C and::=A =A A<br />
or::=N =N N or::=C =C C or::=A =A A<br />
Titus praise -s Lavinia and Tamara.<br />
The reas<strong>on</strong> is that each name needs to have its case checked, but in this sentence there are three names (Titus,<br />
Lavinia, Tamara) and <strong>on</strong>ly two case checkers (-s, praise). We need a way to coordinate Lavinia and Tamara that<br />
leaves us with just <strong>on</strong>e case element to check. Similar problems face coordinate structures like<br />
Titus and Lavinia will -s laugh<br />
Titus praise -s and criticize -s Lavinia<br />
Who -s Titus praise and criticize<br />
Titus can and will -s laugh<br />
Some and every king will -s laugh<br />
For this and other reas<strong>on</strong>s, it is comm<strong>on</strong>ly thought that coordinati<strong>on</strong> requires some kind <strong>of</strong> special mechanism<br />
in the grammar, unlike anything we have introduced so far (Citko, 2001; Moltmann, 1992; Munn, 1992).<br />
One simple idea is that the grammar includes a special mechanism that is analogous to the adjuncti<strong>on</strong> mechanism<br />
above, which for any coordinator x :: coord and any phrases s · α and t · α, attaching the first argument<br />
<strong>on</strong> the right as complement and later arguments as specifiers. More precisely, we use the following ternary<br />
rule:<br />
sh :: coord ts,th,tc · γ,α1,...,αk us,uh,uc · γ,α1,...,αk<br />
coord1<br />
tsthtc,sh,usuhuc : γ,α1,...,αk<br />
Allowing γ to be any sequence <strong>of</strong> features (with the requirement that the coordinated items s and t have this<br />
same sequence <strong>of</strong> features) will have the result that the two case requirements <strong>of</strong> the names in Lavinia and<br />
Tamara will be combined into <strong>on</strong>e. The requirement that the moving c<strong>on</strong>stituents α1,...αk match exactly will<br />
give us a versi<strong>on</strong> <strong>of</strong> the “across-the-board” c<strong>on</strong>straint <strong>on</strong> movements.<br />
XXX MORE COMING<br />
229