Combining Formal and Distributional Models of Temporal and - - PowerPoint PPT Presentation

combining formal and distributional models of temporal
SMART_READER_LITE
LIVE PREVIEW

Combining Formal and Distributional Models of Temporal and - - PowerPoint PPT Presentation

Combining Formal and Distributional Models of Temporal and Intensional Semantics Mike Lewis and Mark Steedman Inference with Temporal Senantics Mike is visiting Baltimore Mike has arrived in Baltimore Mike will leave Baltimore Mike


slide-1
SLIDE 1

Combining Formal and Distributional Models of Temporal and Intensional Semantics

Mike Lewis and Mark Steedman

slide-2
SLIDE 2

Inference with Temporal Senantics

Mike is visiting Baltimore ⇒ Mike has arrived in Baltimore ⇒ Mike will leave Baltimore ⇏ Mike has left Baltimore

slide-3
SLIDE 3

Inference with Temporal Senantics

Mike is visiting Baltimore ⇒ Mike has arrived in Baltimore ⇒ Mike will leave Baltimore ⇏ Mike has left Baltimore Temporal information can be expressed by both function words and content words

slide-4
SLIDE 4

Proposal

  • Hand built lexicon for function words
  • Symbolic content word interpretations from

distributional semantics

  • CCG for compositional semantics
slide-5
SLIDE 5

1 2 3

leave exit depart visit arrive in reach

Combining Distributional and Logical Semantics

slide-6
SLIDE 6

visit ⊢ λxλyλe . rel1(x,y,e) arrive in ⊢ λxλyλe . rel2(x,y,e) reach ⊢ λxλyλe . rel2(x,y,e) leave ⊢ λxλyλe . rel3(x,y,e) 1 2 3

leave exit depart visit arrive in reach

Combining Distributional and Logical Semantics

slide-7
SLIDE 7

Mike NP mike reached (S\NP)/NP λyλxλe . rel2(x,y,e) Baltimore NP baltimore S λe . rel2(mike, baltimore, e) S\NP λxλe . rel2(x, baltimore)

Combining Distributional and Logical Semantics

slide-8
SLIDE 8

Mike arrived in Baltimore

rel2(mike, baltimore, e)

Mike reached Baltimore

rel2(mike, baltimore, e)

Combining Distributional and Logical Semantics

slide-9
SLIDE 9

Mike NP mike reach (S\NP)/NP λyλxλe . rel2(x,y,e) Baltimore NP baltimore S\NP λxλe . ¬rel2(x, baltimore, e) S λe . ¬rel2(mike, baltimore, e) didn’t (S\NP)/(S\NP) λpλxλe. ¬p(x,e) S\NP λxλe . rel2(x, baltimore)

Combining Distributional and Logical Semantics

slide-10
SLIDE 10

Mike didn’t arrive in Baltimore

¬rel2(mike, baltimore)

Mike didn’t reach Baltimore

¬rel2(mike, baltimore)

Combining Distributional and Logical Semantics

slide-11
SLIDE 11

Simple clustering is not enough

  • Models words as either synonyms or

unrelated

  • Many lexical semantic relations: temporal,

causal, hypernyms, etc.

Combining Distributional and Logical Semantics

slide-12
SLIDE 12

Temporal Semantics

1 2 3

leave exit depart visit arrive in reach

slide-13
SLIDE 13

Temporal Semantics

Learn graph structures capturing relations between events Similar to Scaria et al. (2013)

terminated by i n i t i a t e d b y

1 2 3

leave exit depart visit arrive in reach

slide-14
SLIDE 14

Temporal Semantics

arrive in ⊢ λxλyλe . rel2(x,y,e) reach ⊢ λxλyλe . rel2(x,y,e) leave ⊢ λxλyλe . rel3(x,y,e)

terminated by i n i t i a t e d b y

1 2 3

leave exit depart visit arrive in reach

slide-15
SLIDE 15

Temporal Semantics

visit ⊢ λxλyλe . rel1(x,y,e) ∧ ∃e’[rel2(x,y,e’) ∧ before(e,e’)] ∃e’’[rel3(x,y,e’’) ∧ after(e,e’’)]

terminated by i n i t i a t e d b y

1 2 3

leave exit depart visit arrive in reach

slide-16
SLIDE 16

Temporal Semantics

Hand-build lexical entries for auxiliary verbs, using same temporal relations: has ⊢ λpλxλe . before(r, e) ∧ p(x, e) will ⊢ λpλxλe . after(r, e) ∧ p(x, e) is ⊢ λpλxλe . during(r, e) ∧ p(x, e) used ⊢ λpλxλe . before(r, e) ∧ p(x, e) ∧ ¬∃e’[during(r, e) ∧ p(x, e’)]

slide-17
SLIDE 17

Temporal Semantics

Mike NP mike leave (S\NP)/NP λyλxλe . rel3(x,y,e) Baltimore NP baltimore S\NP λxλe . rel3(x, baltimore, e) ∧ after(r,e) S λe . rel3(mike, baltimore, e) ∧ after(r,e) will (S\NP)/(S\NP) λpλxλe. p(x,e) ∧ after(r,e) S\NP λxλe . rel3(x, baltimore)

slide-18
SLIDE 18

Temporal Semantics

Mike is visiting Baltimore

∃e[rel1(mike, baltimore, e) ∧ during(r,e)] ∧ ∃e’[rel2(mike, baltimore, e’) ∧ before(e,e’)] ∧ ∧ ∃e’’[rel3(mike, baltimore, e) ∧ after(e’’,e)]

slide-19
SLIDE 19

Temporal Semantics

Mike is visiting Baltimore Mike will leave Baltimore

∃e[rel3(mike, baltimore, e) ∧ after(r,e)] ∃e[rel1(mike, baltimore, e) ∧ during(r,e)] ∧ ∃e’[rel2(mike, baltimore, e’) ∧ before(e,e’)] ∧ ∧ ∃e’’[rel3(mike, baltimore, e) ∧ after(e’’,e)]

slide-20
SLIDE 20

Intensional Semantics

Mike set out for Baltimore ⇒ Mike tried to reach Baltimore ⇒ Mike headed to Baltimore ⇏ Mike reached Baltimore

slide-21
SLIDE 21

Intensional Semantics

Mike failed to reach Baltimore ⇒ Mike tried to reach Baltimore ⇒ Mike headed to Baltimore ⇒ Mike didn’t reach Baltimore

slide-22
SLIDE 22

Temporal Semantics

1

2 3

i n i t i a t e d b y terminated by leave exit depart visit arrive in reach

slide-23
SLIDE 23

Intensional Semantics

4

g

  • a

l

set out for head to

terminated by i n i t i a t e d b y

1 2 3

leave exit depart visit arrive in reach

slide-24
SLIDE 24

Intensional Semantics

set out for ⊢ λxλyλe . rel4(x,y,e) ∧ ⋄∃e’[rel2(x,y,e’) ∧ goal(e,e’)] 4

g

  • a

l

set out for head to

terminated by i n i t i a t e d b y

1 2 3

leave exit depart visit arrive in reach

slide-25
SLIDE 25

Intensional Semantics

try ⊢ λpλxλe. ∃e’[goal(e, e’) ∧ ⋄ p(x, e’)]

slide-26
SLIDE 26

Intensional Semantics

try ⊢ λpλxλe. ∃e’[goal(e, e’) ∧ ⋄ p(x, e’)] fail ⊢ λpλxλe. ∃e’[goal(e, e’) ∧ ⋄ p(x,e’)] ∧ ¬∃e’’[goal(e, e’’) ∧ p(x, e’’)]

slide-27
SLIDE 27

Intensional Semantics

Mike set out for Baltimore Mike tried to reach Baltimore

⋄∃e’[rel2(mike, baltimore, e’) ∧ goal(e,e’)] ∃e[rel4(x,y,e) ∧ ⋄∃e’[rel2(mike, baltimore,e’) ∧ goal(e,e’)]

slide-28
SLIDE 28

Evaluation

slide-29
SLIDE 29

Conclusions

  • Many inferences rely on complex interaction
  • f formal and lexical semantics
  • Recent work gives us the tools to

incorporate more linguistics into computational semantics