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

Extra credit: Jurafsky and Martin (1999, p503) present the following four semantic representati<strong>on</strong>s for the<br />

sentence Ihaveacar:<br />

First order predicate calculus:<br />

∃x,y Having(x) ∧ Haver(Speaker,x)∧ HadT hing(y, x) ∧ Car(y)<br />

Frame-based representati<strong>on</strong>:<br />

Having<br />

Haver: Speaker<br />

HadThing: Car<br />

C<strong>on</strong>ceptual dependency diagram:<br />

Semantic network:<br />

Haver<br />

Speaker<br />

Car<br />

⇑poss-by<br />

Speaker<br />

Having<br />

Had−Thing<br />

They say (p502)“…there are a number <strong>of</strong> significant differences am<strong>on</strong>g these four approaches to representati<strong>on</strong>…”<br />

but then later they say <strong>of</strong> the latter three representati<strong>on</strong>s (p539) “It is now widely accepted<br />

that meanings represented in these approaches can be translated into equivalent statements in [first order<br />

predicate calculus] with relative ease.”<br />

C<strong>on</strong>trasting with all <strong>of</strong> these representati<strong>on</strong>s, our representati<strong>on</strong> <strong>of</strong> “I have -s a car” is just its derivati<strong>on</strong>:<br />

CP<br />

C’<br />

C TP<br />

DP(1)<br />

D’<br />

[I]<br />

D<br />

T<br />

t<br />

V<br />

[have]<br />

T’<br />

DP<br />

t(1)<br />

v<br />

v<br />

v<br />

vP<br />

T<br />

[-s]<br />

[a]<br />

v’<br />

D<br />

DP(0)<br />

D’<br />

VP<br />

NumP<br />

Num’<br />

Num NP<br />

N’<br />

N<br />

[car]<br />

V<br />

t<br />

V’<br />

DP<br />

t(0)<br />

[(ɛ,ɛ,[I,have,-s,a,car]):[C]]<br />

Car<br />

[ɛ::[=T,C]] [([I],ɛ,[have,-s,a,car]):[T]]<br />

[(ɛ,ɛ,[have,-s,a,car]):[+(k),T],(ɛ,[I],ɛ):[-(k)]]<br />

[[-s]::[v==>,+(k),T]] [(ɛ,[have],[a,car]):[v],(ɛ,[I],ɛ):[-(k)]]<br />

[(ɛ,[have],[a,car]):[=D,v]]<br />

[ɛ::[=>V,=D,v]] [([a,car],[have],ɛ):[V]]<br />

256<br />

[(ɛ,[have],ɛ):[+(k),V],(ɛ,[a],[car]):[-(k)]]<br />

[[I]::[D,-(k)]]<br />

[[have]::[=D,+(k),V]] [(ɛ,[a],[car]):[D,-(k)]]<br />

[[a]::[=Num,D,-(k)]] [(ɛ,ɛ,[car]):[Num]]<br />

[ɛ::[=N,Num]] [[car]::[N]]

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

Saved successfully!

Ooh no, something went wrong!