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

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

CP<br />

C’<br />

C TP<br />

DP(1)<br />

D’<br />

D<br />

[Titus]<br />

T<br />

t<br />

V<br />

T’<br />

DP<br />

t(1)<br />

[break]<br />

v<br />

v<br />

v<br />

vP<br />

T<br />

[-s]<br />

D<br />

v’<br />

[the]<br />

DP(0)<br />

D’<br />

VP<br />

NumP t<br />

Num’<br />

Num NP<br />

N’<br />

N<br />

[car]<br />

V<br />

V’<br />

DP<br />

t(0)<br />

CP<br />

C’<br />

C TP<br />

D<br />

[the]<br />

DP(0)<br />

D’<br />

NumP<br />

Num’<br />

Num NP<br />

N’<br />

N<br />

[car]<br />

V<br />

[break]<br />

Notice that the car is the object <strong>of</strong> break in both trees. What minimal modificati<strong>on</strong>s to gh4.pl allow these<br />

trees to be generated? (You should just need the lexical entries for these two forms <strong>of</strong> break, plus <strong>on</strong>e other<br />

thing.)<br />

Notice that with UTAH, we have all the advantages <strong>of</strong> the four representati<strong>on</strong>s Jurafsky and Martin show,<br />

but without any <strong>of</strong> the work <strong>of</strong> computing some new graphical or logical representati<strong>on</strong>s!<br />

258<br />

v<br />

v<br />

v<br />

T<br />

t<br />

T’<br />

T<br />

[-s]<br />

vP<br />

v’<br />

V<br />

t<br />

VP<br />

V’<br />

DP<br />

t(0)

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

Saved successfully!

Ooh no, something went wrong!