20.07.2013 Views

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

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

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

SHOW MORE
SHOW LESS

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 />

(4) More formally, the structure building rules can be formulated like this:<br />

• • structure building (partial) functi<strong>on</strong>: merge : (exp × exp) → exp<br />

Letting t[f] be the result <strong>of</strong> prefixing feature f to the sequence <strong>of</strong> features at the head <strong>of</strong> t, for all trees t1,t2<br />

all c ∈ Cat,<br />

⎧<br />

<<br />

⎪⎨ t1 t2 if t1 ∈ Lex<br />

mer ge(t1[=c], t2[c]) =<br />

><br />

⎪⎩<br />

• structure building (partial) functi<strong>on</strong>: move : exp → exp<br />

t2 t1 otherwise<br />

Letting t > be the maximal projecti<strong>on</strong> <strong>of</strong> t,<br />

for any tree t1[+f] which c<strong>on</strong>tains exactly <strong>on</strong>e node with first feature -f<br />

move(t1[+f]) =<br />

t > 2<br />

><br />

t1{t2[-f] > /ɛ}<br />

(5) In sum:<br />

Each lexical item is a (finite) sequence <strong>of</strong> features.<br />

Each structure building operati<strong>on</strong> “checks” and cancels a pair <strong>of</strong> features.<br />

Features in a sequence are canceled from left to right.<br />

Merge applies to a simple head and the first c<strong>on</strong>stituent it selects by attaching the selected c<strong>on</strong>stituent<br />

<strong>on</strong> the right, in complement positi<strong>on</strong>. If a head selects any other c<strong>on</strong>stituents, these are attached to the<br />

left in specifier positi<strong>on</strong>s.<br />

All movement is overt, phrasal, leftward. A maximal subtree moves to attach <strong>on</strong> the left as a specifier<br />

<strong>of</strong> the licensing phrase.<br />

One restricti<strong>on</strong> <strong>on</strong> movement here comes from the requirement that movement cannot apply when two<br />

outstanding -f requirements would compete for the same positi<strong>on</strong>. This is a str<strong>on</strong>g versi<strong>on</strong> <strong>of</strong> the<br />

“shortest move” c<strong>on</strong>diti<strong>on</strong> (Chomsky, 1995).<br />

We may want to add additi<strong>on</strong>al restricti<strong>on</strong>s <strong>on</strong> movement, such as the idea proposed by Koopman and<br />

Szabolcsi (2000a): that the moved tree must be a comp + or the specifier <strong>of</strong> a comp + .Wewillc<strong>on</strong>sider<br />

these issues later.<br />

These operati<strong>on</strong>s are asymmetric with respect to linear order! So they fit best with projects in “asymmetric<br />

syntax:” Kayne (1994), Kayne (1999), Koopman and Szabolcsi (2000a), Sportiche (1999), Mahajan<br />

(2000), and many others. It is not difficult to extend these grammars to allow head movement, adjuncti<strong>on</strong><br />

and certain other things, but we will stick to these simple grammars for the moment.<br />

170

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!