279
Weighted Tree Automata and Transducers for Syntactic Natural Language Processing Jonathan May Thesis Defense April 20, 2010 1 Monday, April 19, 2010

Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

  • Upload
    others

  • View
    13

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted Tree Automata and Transducersfor Syntactic Natural Language Processing

Jonathan MayThesis DefenseApril 20, 2010

1

Monday, April 19, 2010

Page 2: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

How do we view natural language?

As a string?

2

Monday, April 19, 2010

Page 3: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

i

How do we view natural language?

3

Monday, April 19, 2010

Page 4: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

i

How do we view natural language?

contextwindow

4

Monday, April 19, 2010

Page 5: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

i gave

How do we view natural language?

contextwindow

5

Monday, April 19, 2010

Page 6: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

my

How do we view natural language?

contextwindow

i gave

6

Monday, April 19, 2010

Page 7: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

son

How do we view natural language?

contextwindow

myi gave

7

Monday, April 19, 2010

Page 8: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

son ?

How do we view natural language?

contextwindow

myi gave

8

Monday, April 19, 2010

Page 9: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

a

How do we view natural language?

9

son ?contextwindow

myi gave

Monday, April 19, 2010

Page 10: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

a baseball bat

How do we view natural language?

10

son ?contextwindow

myi gave

Monday, April 19, 2010

Page 11: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

a baseball bat

is

How do we view natural language?

11

son ?contextwindow

myi gave

Monday, April 19, 2010

Page 12: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

a baseball bat

is three years old

How do we view natural language?

12

son ?contextwindow

myi gave

Monday, April 19, 2010

Page 13: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

As a string?

Language is more hierarchical than this!

How do we view natural language?

a baseball bat

is three years old

13

son ?contextwindow

myi gave

Monday, April 19, 2010

Page 14: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Or as a tree?

S

How do we view natural language?

14

Monday, April 19, 2010

Page 15: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Or as a tree?

SNP VP

How do we view natural language?

15

Monday, April 19, 2010

Page 16: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Or as a tree?

SNP VP

i

How do we view natural language?

16

Monday, April 19, 2010

Page 17: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Or as a tree?

SNP VP

gave NP NPi

How do we view natural language?

17

Monday, April 19, 2010

Page 18: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Or as a tree?

SNP VP

gave NP NPmy son

i

How do we view natural language?

18

Monday, April 19, 2010

Page 19: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Or as a tree?

SNP VP

gave NP NPmy son a bat

i

How do we view natural language?

19

Monday, April 19, 2010

Page 20: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Or as a tree?

SNP VP

gave NP NPmy son a bat

Trees provide syntactic context!

i

How do we view natural language?

20

Monday, April 19, 2010

Page 21: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

21

Monday, April 19, 2010

Page 22: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

21

Monday, April 19, 2010

Page 23: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

21

Monday, April 19, 2010

Page 24: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

21

Monday, April 19, 2010

Page 25: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

21

Monday, April 19, 2010

Page 26: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

21

Monday, April 19, 2010

Page 27: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

tree

21

Monday, April 19, 2010

Page 28: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

great formalisms

tree

21

Monday, April 19, 2010

Page 29: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

powerful expressiveness

great formalisms

tree

21

Monday, April 19, 2010

Page 30: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

few algorithms

no toolkits

slow progress

powerful expressiveness

great formalisms

tree

21

Monday, April 19, 2010

Page 31: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

few algorithms

no toolkits

slow progress

powerful expressiveness

great formalisms

tree

21

Monday, April 19, 2010

Page 32: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

String World vs Tree World

few algorithms

no toolkits

slow progress

powerful expressiveness

great formalisms

tree

21

Monday, April 19, 2010

Page 33: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

Contributions

few algorithms

no toolkits

slow progress

tree

great formalisms

powerful expressiveness

22

Monday, April 19, 2010

Page 34: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

Contributions

few algorithms

no toolkits

slow progress

tree

great formalisms

powerful expressiveness

new algorithms!

new toolkit!

rapid progress!

22

Monday, April 19, 2010

Page 35: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

Contributions

few algorithms

no toolkits

slow progress

tree

great formalisms

powerful expressiveness

new algorithms!

new toolkit!

rapid progress!

22

Monday, April 19, 2010

Page 36: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

string

great formalisms

useful algorithms

toolkits

rapid progress

limited expressiveness

Contributions

few algorithms

no toolkits

slow progress

tree

great formalisms

powerful expressiveness

new algorithms!

new toolkit!

rapid progress!

22

Monday, April 19, 2010

Page 37: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted finite-state string machines

green/.2

the/.3

red/.2

blue/.8

!/.8

hairy/.1

elf/.9dwarf/.2

the:la/.7

the:el/.3

blue:!/.8

elf:duende/.8man:hombre/1

!:azúl/.3!:triste/.2

elf:duende/.8man:hombre/1

Acceptor

Transducer

23

Monday, April 19, 2010

Page 38: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted finite-state string machines

the blue dwarf/.048green hairy elf/.0144

the red hairy hairy elf/.000432...green/.2

the/.3

red/.2

blue/.8

!/.8

hairy/.1

elf/.9dwarf/.2

the:la/.7

the:el/.3

blue:!/.8

elf:duende/.8man:hombre/1

!:azúl/.3!:triste/.2

elf:duende/.8man:hombre/1

Acceptor

Transducer

23

Monday, April 19, 2010

Page 39: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted finite-state string machines

the blue dwarf/.048green hairy elf/.0144

the red hairy hairy elf/.000432...green/.2

the/.3

red/.2

blue/.8

!/.8

hairy/.1

elf/.9dwarf/.2

the:la/.7

the:el/.3

blue:!/.8

elf:duende/.8man:hombre/1

!:azúl/.3!:triste/.2

elf:duende/.8man:hombre/1

the blue elf : el duende azúl/.0576the blue man : el duende triste/.048

...

Acceptor

Transducer

23

Monday, April 19, 2010

Page 40: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Using WFSTs for NLP

Given a string and a transducer, calculate the highest weighted transformation of the

string by the transducer

24

Monday, April 19, 2010

Page 41: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Using WFSTs for NLP

the blue dwarf

Given a string and a transducer, calculate the highest weighted transformation of the

string by the transducer

24

Monday, April 19, 2010

Page 42: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Using WFSTs for NLP

Machine Translation

the blue dwarf

Given a string and a transducer, calculate the highest weighted transformation of the

string by the transducer

24

Monday, April 19, 2010

Page 43: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Using WFSTs for NLP

Machine Translation

the blue dwarf

Given a string and a transducer, calculate the highest weighted transformation of the

string by the transducer

el enano azúl / .3el enano triste / .1el duende azúl / .05el azúl duende / .01

...

24

Monday, April 19, 2010

Page 44: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

MT as weighted transducers

Imagine an English sentence

Re-order the words

Translate into Spanish

thethe/.7

start

green/.7

green

green/.04a

a/.2green/.6

ball

horse

horse/.75

ball/.2

ball.3

horse/.4

ball/.05

green/.03

horse/.02

the/.01

the green ball = .098

a green green horse = .0036

horse green the

25

Monday, April 19, 2010

Page 45: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

MT as weighted transducers

Imagine an English sentence

Re-order the words

Translate into Spanish

thethe/.7

start

green/.7

green

green/.04a

a/.2green/.6

ball

horse

horse/.75

ball/.2

ball.3

horse/.4

ball/.05

green/.03

horse/.02

the/.01

the green ball = .098

a green green horse = .0036

horse green the

thethe/.7

start

green/.7

green

green/.04a

a/.2green/.6

ball

horse

horse/.75

ball/.2

ball.3

horse/.4

ball/.05

green/.03

horse/.02

the/.01

25

Monday, April 19, 2010

Page 46: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

MT as weighted transducers

Imagine an English sentence

Re-order the words

Translate into Spanish

start

the

green

ball

the:the/0.9ball:ball/0.8

green:green/0.3

the: !/0.1

ball: !/0.2

ball: ball green/1green: green green/1

the: the green/1

ball: ball the/1green: green the/1

the: the the/1

ball: ball ball/1green: green ball/1

the: the ball/1

green: !/0.7

the green ball

the green ball

the ball green

green the ball

.216

.63

.03

26

Monday, April 19, 2010

Page 47: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

MT as weighted transducers

Imagine an English sentence

Re-order the words

Translate into Spanish

ball:pelota/.8

ball:bola/.2

horse:caballo/.9

horse:bayo/.1

green:verde/.7

green:campo/.3

the:el/.35

the:la/.35

the:los/.15

the:las/.15 the ball green

la pelota verde

el bola campo

.196

.021

27

Monday, April 19, 2010

Page 48: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

MT as weighted transducers

English Reorder Translate

Generative story: we corrupt good English into (possibly bad) Spanish

28

Monday, April 19, 2010

Page 49: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Decoding story: given some good Spanish, determine the best good English that could produce it

MT as weighted transducers

la pelota verde

English Reorder Translate

29

Monday, April 19, 2010

Page 50: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

• WFST toolkits do this calculation for us:

• AT&T FSM1 / Google OpenFst2

• USC/ISI Carmel3

• Generic operations for manipulation, combination, inference, training

Secret weapons

WFST toolkit operations

k-best

em training

determinization

composition

pipeline inference

on-the-fly inference

301: Mohri, Pereira, Riley, ’98 2: Allauzen et al., ’07 3: Graehl, ’97

Monday, April 19, 2010

Page 51: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Machine Translation

(Kumar & Byrne ’03)

Widely applicable!

the blue elf

el enano azúl / .3el enano triste / .1el duende azúl / .05

...

31

Monday, April 19, 2010

Page 52: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Machine Translation

(Kumar & Byrne ’03)

Widely applicable!

the blue elf

el enano azúl / .3el enano triste / .1el duende azúl / .05

...

“i love killing people” / .2“eggs, milk, flour, tin foil” / .002

...

Decipherment(Ravi & Knight ’09)

31

Monday, April 19, 2010

Page 53: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Machine Translation

(Kumar & Byrne ’03)

Widely applicable!

the blue elf

el enano azúl / .3el enano triste / .1el duende azúl / .05

...

“this is the bbc” / .5“this is the bee I see” / .1“the sister beyoncé” / .1

...

“i love killing people” / .2“eggs, milk, flour, tin foil” / .002

...

Decipherment(Ravi & Knight ’09)

Speech Recognition(Pereira et al. ’94)

31

Monday, April 19, 2010

Page 54: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Machine Translation

(Kumar & Byrne ’03)

Widely applicable!

the blue elf

el enano azúl / .3el enano triste / .1el duende azúl / .05

...

“this is the bbc” / .5“this is the bee I see” / .1“the sister beyoncé” / .1

...

“there was a computer from applethat wore a red rose in its lapel” / .1

...

“i love killing people” / .2“eggs, milk, flour, tin foil” / .002

...

Decipherment(Ravi & Knight ’09)

Speech Recognition(Pereira et al. ’94)

Poetry Generation

(Greene & Knight ’10)

31

Monday, April 19, 2010

Page 55: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

NLP work using WFSTs

Translation(Kumar & Byrne ’03)

Decipherment(Ravi & Knight ’09)

Speech Recognition

(Pereira et al. ’94)

Poetry Generation

(Greene & Knight ’10)

OCR(Kolak et al. ’03)

Morphology (Karttunen et al. ’92)

POS Tagging (Church ’88)

Spelling Correction

(Boyd ’09)

Transliteration (Knight & Graehl ’98)

Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08)

32

Monday, April 19, 2010

Page 56: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

NP VP

S

33

Monday, April 19, 2010

Page 57: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

NPVP

S

33

Monday, April 19, 2010

Page 58: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

NPVP

S

(1st-person-singular) 33

Monday, April 19, 2010

Page 59: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

NPVP

S

(1st-person-singular)

(1st-person-singular)33

Monday, April 19, 2010

Page 60: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

But that’s what we want!

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

33

Monday, April 19, 2010

Page 61: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

But that’s what we want!

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

Parsing(Collins ’97)

33

Monday, April 19, 2010

Page 62: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

But that’s what we want!

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

Parsing(Collins ’97)

Question Answering(Echihabi & Marcu ’03)

33

Monday, April 19, 2010

Page 63: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

But that’s what we want!

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

Parsing(Collins ’97)

Question Answering(Echihabi & Marcu ’03)

Language Modeling(Charniak ’01)

33

Monday, April 19, 2010

Page 64: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

But that’s what we want!

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

Parsing(Collins ’97)

Question Answering(Echihabi & Marcu ’03)

Summarization(Knight & Marcu ’03)

Language Modeling(Charniak ’01)

33

Monday, April 19, 2010

Page 65: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

But that’s what we want!

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

Parsing(Collins ’97)

Question Answering(Echihabi & Marcu ’03)

Summarization(Knight & Marcu ’03)

Language Modeling(Charniak ’01)

Machine Translation(Yamada & Knight ’01)

(Galley et al. ’04)(Mi et al. ’08)

(Zhang et al. ’08)33

Monday, April 19, 2010

Page 66: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

But that’s what we want!

Limitations of strings• Can’t do arbitrary long-distance reordering

• Can’t maintain arbitrary long-distance dependencies

• Can’t naturally integrate syntax information

Parsing(Collins ’97)

Question Answering(Echihabi & Marcu ’03)

Summarization(Knight & Marcu ’03)

Language Modeling(Charniak ’01)

Machine Translation(Yamada & Knight ’01)

(Galley et al. ’04)(Mi et al. ’08)

(Zhang et al. ’08)

Lots of work with tree models, but

NO tree toolkit!

33

Monday, April 19, 2010

Page 67: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted finite-state tree machines

np.2

2.3

1 the.8

0

1 23

jj

2 2

2 blue.4

2 red.2

3 elf.9

65

npnp.3

4

the.5

5

7

el

elf1

6duende

blue.4

7azúl

blue.2

7triste

Grammar

Transducer

34

Monday, April 19, 2010

Page 68: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted finite-state tree machines

np.2

2.3

1 the.8

0

1 23

jj

2 2

2 blue.4

2 red.2

3 elf.9

65

npnp.3

4

the.5

5

7

el

elf1

6duende

blue.4

7azúl

blue.2

7triste

np

the blue elfnp

the jj elf

red red

/ .0576

/ .0017...

Grammar

Transducer

34

Monday, April 19, 2010

Page 69: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted finite-state tree machines

np.2

2.3

1 the.8

0

1 23

jj

2 2

2 blue.4

2 red.2

3 elf.9

65

npnp.3

4

the.5

5

7

el

elf1

6duende

blue.4

7azúl

blue.2

7triste

np

the blue elfnp

the jj elf

red red

/ .0576

/ .0017...

np

the blue elf

np

el duende triste: / .03

...

Grammar

Transducer

34

Monday, April 19, 2010

Page 70: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted regular tree grammars

0

1 2 3

NP.2

red

JJ.3

.22

2

2 2

1 the.8

2 blue.4

3 elf.9

0

1 2 3

NP

0

.2

(Berstel & Reutenauer, 1982)

1

Tree Weight

35

the.81

blue2.4

elf3.9

Monday, April 19, 2010

Page 71: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted regular tree grammars

00

1 2 3

NP.2

(Berstel & Reutenauer, 1982)

1

Tree Weight

0

1 2 3

NP.2

red

JJ.3

.22

2

2 2

1 the.8

2 blue.4

3 elf.9

36

the.81

blue2.4

elf3.9

Monday, April 19, 2010

Page 72: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted regular tree grammars

1 2 3

NP

0

1 2 3

NP.2

red

JJ.3

.22

2

2 2

1 the.8

2 blue.4

3 elf.9

.2

the

(Berstel & Reutenauer, 1982)

Tree Weight

37

.81

blue2.4

elf3.9

Monday, April 19, 2010

Page 73: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted regular tree grammars

1

the

.2

(Berstel & Reutenauer, 1982)

Tree Weight

0

1 2 3

NP.2

red

JJ.3

.22

2

2 2

1 the.8

2 blue.4

3 elf.9

38

2 3

NP

.81

blue2.4

elf3.9

Monday, April 19, 2010

Page 74: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted regular tree grammars

0

1 2 3

NP.2

red

JJ.3

.22

2

2 2

1 the.8

2 blue.4

3 elf.9

the.16blue2

.4

(Berstel & Reutenauer, 1982)

Tree Weight

39

2 3

NP

elf3.9

Monday, April 19, 2010

Page 75: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted regular tree grammars

2.4

the

blue

.16

(Berstel & Reutenauer, 1982)

Tree Weight

0

1 2 3

NP.2

red

JJ.3

.22

2

2 2

1 the.8

2 blue.4

3 elf.9

40

2 3

NP

elf3.9

Monday, April 19, 2010

Page 76: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted regular tree grammars

0

1 2 3

NP.2

red

JJ.3

.22

2

2 2

1 the.8

2 blue.4

3 elf.9

the blue.064

elf3.9

(Berstel & Reutenauer, 1982)

Tree Weight

41

3

NP

Monday, April 19, 2010

Page 77: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted regular tree grammars

3.9

the blue.064

elf

(Berstel & Reutenauer, 1982)

Tree Weight

0

1 2 3

NP.2

red

JJ.3

.22

2

2 2

1 the.8

2 blue.4

3 elf.9

42

3

NP

Monday, April 19, 2010

Page 78: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted regular tree grammars

the blue elf.0576

(Berstel & Reutenauer, 1982)

Tree Weight

0

1 2 3

NP.2

red

JJ.3

.22

2

2 2

1 the.8

2 blue.4

3 elf.9

43

NP

Monday, April 19, 2010

Page 79: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

the blue elf

NP

(Kuich, 1998)

4 NP .3

5 6 7

14

Tree Weight

44

NP

5 the .5 el

duende1elf

6

azúl.4blue7

Monday, April 19, 2010

Page 80: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

NPNP

(Kuich, 1998)

.3

5 6 7

1the blue elf

Tree Weight

44

45

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

NP NP

5 the .5 el

duende1elf

6

azúl.4blue7

Monday, April 19, 2010

Page 81: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

765

(Kuich, 1998)

.3

1

theblue elf

Tree Weight

46

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

NPNP44 NP NP

5 the .5 el

duende1elf

6

azúl.4blue7

Monday, April 19, 2010

Page 82: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

(Kuich, 1998)

.3

blueelf

Tree Weight

765

1

the

47

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

NPNP44 NP NP

5 the .5 el

duende1elf

6

azúl.4blue7

Monday, April 19, 2010

Page 83: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

(Kuich, 1998)

.3

elf

Tree Weight

blue765

1

the

48

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

NPNP44 NP NP

5 the .5 el

duende1elf

6

azúl.4blue7

Monday, April 19, 2010

Page 84: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

(Kuich, 1998)

.3the blueelf

5 the .5 elTree Weight

49

5 6 7

NPduende1

elf6

azúl.4blue7

Monday, April 19, 2010

Page 85: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

5 the .5

(Kuich, 1998)

.3the blueelf

el

Tree Weight

50

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

5 6 7

NPduende1

elf6

azúl.4blue7

Monday, April 19, 2010

Page 86: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

(Kuich, 1998)

.15blueelfel

duende1elf

6

Tree Weight

51

6 7

NP

azúl.4blue7

Monday, April 19, 2010

Page 87: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

(Kuich, 1998)

.15blueelfel

duende

Tree Weight

52

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

6 7

1elf

6

NP

azúl.4blue7

Monday, April 19, 2010

Page 88: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

(Kuich, 1998)

.15blue

7el duende

azúl.4blue7

Tree Weight

53

NP

Monday, April 19, 2010

Page 89: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

(Kuich, 1998)

.15blue

7el duende

azúl

Tree Weight

54

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

NP

.4blue7

Monday, April 19, 2010

Page 90: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree transducers

(Kuich, 1998)

.06el duende azúl

Tree Weight

55

4 NP .3

5 6 7

NP

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

NP

Monday, April 19, 2010

Page 91: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Weighted tree-string transducers

NP

the blue elf

(Kuich, 1998)

14

Tree Weight

56

4 NP .35 6 7

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

Monday, April 19, 2010

Page 92: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

.06

(Kuich, 1998)

el duende azúl

String Weight

57

4 NP .35 6 7

5 the .5 el

1 duendeelf6

.2 tristeblue7

.4 azúlblue7

Weighted tree-string transducers

Monday, April 19, 2010

Page 93: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

MT as weighted tree transducers

Imagine an English sentence

Re-order the words

Translate into Spanish

start

npsing

vp

sing

S1 .2

dt nn

NP

jj

npsing

NP.7

npsing

dt nn

.1NPnp

sing

dt nnjj jj

DT.8

thedt

DT.2

adt

JJ.7

greenjj JJ.1

bluejj

JJ.2

largejj NN.7

dognn

58

Monday, April 19, 2010

Page 94: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

MT as weighted tree transducers

Imagine an English sentence

Re-order the words

Translate into Spanish

start

npsing

vp

sing

S1 .2

dt nn

NP

jj

npsing

NP.7

npsing

dt nn

.1NPnp

sing

dt nnjj jj

DT.8

thedt

DT.2

adt

JJ.7

greenjj JJ.1

bluejj

JJ.2

largejj NN.7

dognn

S

NP ...

DT NNJJ

a blue dog

58

Monday, April 19, 2010

Page 95: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Imagine an English sentence

Re-order the words

Translate into Spanish

s.7S

np vp

S

.3s S

npvp

S

.3 NP

nnjjjjdt

NPnp

.2np NP

nndt

NP

jj jj

.1np NP

nn

NP

jj jj

59

MT as weighted tree transducers

Monday, April 19, 2010

Page 96: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Imagine an English sentence

Re-order the words

Translate into Spanish

s.7S

np vp

S

.3s S

npvp

S

.3 NP

nnjjjjdt

NPnp

.2np NP

nndt

NP

jj jj

.1np NP

nn

NP

jj jj

S

NP ...

DT JJ JJ NN

59

MT as weighted tree transducers

Monday, April 19, 2010

Page 97: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Imagine an English sentence

Re-order the words

Translate into Spanish

s.7S

np vp

S

.3s S

npvp

S

.3 NP

nnjjjjdt

NPnp

.2np NP

nndt

NP

jj jj

.1np NP

nn

NP

jj jj

S

NP ...

DT JJ JJNN

59

MT as weighted tree transducers

Monday, April 19, 2010

Page 98: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Imagine an English sentence

Re-order the words

Translate into Spanish

s.7S

np vp

S

.3s S

npvp

S

.3 NP

nnjjjjdt

NPnp

.2np NP

nndt

NP

jj jj

.1np NP

nn

NP

jj jj

S

NP ...

JJ JJNN

59

MT as weighted tree transducers

Monday, April 19, 2010

Page 99: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Imagine an English sentence

Re-order the words

Translate into Spanish

s.7S

np vp

S

.3s S

npvp

S

.3 NP

nnjjjjdt

NPnp

.2np NP

nndt

NP

jj jj

.1np NP

nn

NP

jj jj

S

NP...

JJ JJNN

59

MT as weighted tree transducers

Monday, April 19, 2010

Page 100: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Imagine an English sentence

Re-order the words

Translate into Spanish

1sing fem

NP NP

sing fem

sing fem

1sing fem DT

theDTla

.015sing fem NN

ballDT

pelota

60

MT as weighted tree transducers

Monday, April 19, 2010

Page 101: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Syntax-Based Machine

Translation

Great, so now we can solve harder problems!

NP

the elfJJ

blue and red and yellow

/ .3NP

el enano JJ

azul y rojo y amarillo

61

Monday, April 19, 2010

Page 102: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Syntax-Based Machine

Translation

Great, so now we can solve harder problems!

the dog ran home Parsing

S

NP VP

the dog ran home

...

/ .5

NP

the elfJJ

blue and red and yellow

/ .3NP

el enano JJ

azul y rojo y amarillo

61

Monday, April 19, 2010

Page 103: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Syntax-Based Machine

Translation

Great, so now we can solve harder problems!

the dog ran home Parsing

Summarization

S

NP VP

the dog ran home

...

/ .5

NP

the elfJJ

blue and red and yellow

/ .3NP

el enano JJ

azul y rojo y amarillo

61

Monday, April 19, 2010

Page 104: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Syntax-Based Machine

Translation

Great, so now we can solve harder problems!

Not so fast!

the dog ran home Parsing

Summarization

S

NP VP

the dog ran home

...

/ .5

NP

the elfJJ

blue and red and yellow

/ .3NP

el enano JJ

azul y rojo y amarillo

61

Monday, April 19, 2010

Page 105: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Operation String Tree

k-best yes alg1

em training yes alg2

determinization yes no

composition yes proof of concept3

pipeline inference yes proof of concept4

on-the-fly inference yes no

String world has many more available operations than tree world!

1: Huang & Chiang, 20052: Graehl & Knight, 2004

3: Maletti, 20064: Fülöp, Maletti, Vogler, 201062

Monday, April 19, 2010

Page 106: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Operation String Tree

k-best yes alg

em training yes alg

determinization yes alg

composition yes proof of concept3

pipeline inference yes proof of concept4

on-the-fly inference yes no

Algorithmic contribution I: weighted determinization

63

Algorithmic I

Monday, April 19, 2010

Page 107: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Operation String Tree

k-best yes alg

em training yes alg

determinization yes alg

composition yes PoC

pipeline inference yes PoC

on-the-fly inference yes no

Algorithmic contribution II: efficient inference

alg

alg

alg

64

Algorithmic I

Algorithmic II

Monday, April 19, 2010

Page 108: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Operation String Tree

k-best yes yes

em training yes yes

determinization yes yes

composition yes yes

pipeline inference yes yes

on-the-fly inference yes yes

Practical contribution I: weighted tree transducer toolkit

65

Algorithmic I

Algorithmic II

Practical I

Monday, April 19, 2010

Page 109: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical contribution II: syntactic re-alignment

Operation String Tree

k-best yes yes

em training yes yes

determinization yes yes

composition yes yes

pipeline inference yes yes

on-the-fly inference yes yes

66

Algorithmic I

Algorithmic II

Practical I

Practical II

Monday, April 19, 2010

Page 110: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

Determinization of weighted tree automata

(May & Knight, HLT-NAACL ’06)

Elevated Mohri algorithm (’97) to tree automataDemonstrated empirical gains in parsing and MT

D

A B

D

A C

D

A B

= .054

= .012

= .036D

A C

D

A B

= .066

= .036

(Büchse, May, Vogler, FSMNLP ’09)

67

Monday, April 19, 2010

Page 111: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r B.2

s B.6

BEFO

RE

AFT

ER

68

Monday, April 19, 2010

Page 112: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r B.2

s B.6

BEFO

RE

AFT

ER Non-deterministic rules(treating grammar as bottom-up acceptor)

69

Monday, April 19, 2010

Page 113: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r B.2

s B.6

Merge terminal rules with same right sides

BEFO

RE

AFT

ER

70

Monday, April 19, 2010

Page 114: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

r/.25s/.75 B

.8

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75

q A.3

s C.4

BEFO

RE

AFT

ER

Merge terminal rules with same right sides

71

Monday, April 19, 2010

Page 115: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

r/.25s/.75 B

.8

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75

q A.3

s C.4

sum of weightsportion attributed to

each state

BEFO

RE

AFT

ER

72

Monday, April 19, 2010

Page 116: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

r/.25s/.75 B

.8

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75q A

.3s C

.4

BEFO

RE

AFT

ER

Process the other terminal rules

73

Monday, April 19, 2010

Page 117: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

r/.25s/.75 B

.8

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75q A

.3s C

.4

BEFO

RE

AFT

ER

Process the other terminal rules

74

Monday, April 19, 2010

Page 118: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

r/.25s/.75 B

.8

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75A

.3C

.4s/1q/1

BEFO

RE

AFT

ER

Process the other terminal rules

75

Monday, April 19, 2010

Page 119: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

t

q r

D.2

t

q s

D.3

s/1r/.25s/.75r/.25s/.75q/1q/1q/1

BEFO

RE

AFT

ER

Process the other terminal rules

76

Monday, April 19, 2010

Page 120: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

t

q r

D.2

t

q s

D.3

s/1r/.25s/.75

r/.25s/.75

q/1q/1

q/1

BEFO

RE

AFT

ER

Choose rules from the input rtg and new state sequences

that match

77

Monday, April 19, 2010

Page 121: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

t

q r

D.2

t

q s

D.3

s/1r/.25s/.75q/1q/1

r/.25s/.75q/1

BEFO

RE

AFT

ER

Choose rules from the input rtg and new state sequences

that match

78

Monday, April 19, 2010

Page 122: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

D.05

t

q s

D.3

s/1r/.25s/.75q/1q/1

r/.25s/.75q/1

t/1

BEFO

RE

AFT

ER

Form new rules from these components

79

Monday, April 19, 2010

Page 123: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

D.05

t

q s

D.3

s/1r/.25s/.75q/1q/1

r/.25s/.75q/1

t/1

BEFO

RE

AFT

ER

rule weight of .2 times residual of .25

80

Monday, April 19, 2010

Page 124: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

D.05

t

q s

D.3

s/1

r/.25s/.75

q/1

q/1

r/.25s/.75q/1

t/1

BEFO

RE

AFT

ER

81

Monday, April 19, 2010

Page 125: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

t

q s

D.3

s/1q/1

r/.25s/.75q/1

D.05

r/.25s/.75q/1

t/1

BEFO

RE

AFT

ER

82

Monday, April 19, 2010

Page 126: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

D.225

s/1q/1

r/.25s/.75q/1

D.05

r/.25s/.75q/1

t/1 t/1

BEFO

RE

AFT

ER

rule weight of .3 times

residual of .75

83

Monday, April 19, 2010

Page 127: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

D.225

s/1q/1

r/.25s/.75q/1

D.05

r/.25s/.75q/1

t/1t/1

BEFO

RE

AFT

ER

These rules are identical except for their weight, so we’ll sum

them

84

Monday, April 19, 2010

Page 128: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

D

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

.275

r/.25s/.75q/1

t/1 D

s/1q/1

t

q s

D.3

BEFO

RE

AFT

ER

These rules are identical except for their weight, so we’ll sum

them

85

Monday, April 19, 2010

Page 129: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

D

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

.275

r/.25s/.75q/1

t/1 D

s/1q/1

t

q s

D.3

BEFO

RE

AFT

ER

86

Monday, April 19, 2010

Page 130: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

D

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

.275

r/.25s/.75q/1

t/1 D

s/1q/1

t

q s

D.3

BEFO

RE

AFT

ER

87

Monday, April 19, 2010

Page 131: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

D

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

.275

r/.25s/.75q/1

t/1 D

s/1q/1

D.3

t/1

BEFO

RE

AFT

ER

88

Monday, April 19, 2010

Page 132: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

D

t

q r

D.2

t

q s

D.3

q A.3

r B.2

s B.6

s C.4

r/.25s/.75 B

.8r/.25s/.75 C

.4s/1A

.3q/1

.275

r/.25s/.75q/1

t/1 D

s/1q/1

D.3

t/1

BEFO

RE

AFT

ER

D

A B

D

A C

D

A B

= .054

= .012

= .036

D

A C

D

A B

= .066

= .036

89

Monday, April 19, 2010

Page 133: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

Empirical experiments

Determinization removes duplicates and

re-ranks n-best lists

Syntax MT System

枪手 被 警方 击毙 .

S

NP VP

police killed NP

the gunman

= 0.4

S

VP

killed PP

by police

= 0.45NP

the gunmanwas

...

Determinization

Method BLEU

Undeterminized 21.87Top-500 “crunching” 23.33

Determinized 24.17

Machine translation (Galley et al. ’04, ’06)

90

Monday, April 19, 2010

Page 134: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

Empirical experiments

Determinization removes duplicates and

re-ranks n-best lists

Method Precision Recall FUndeterminized 80.23 80.18 80.20

Top-500 “crunching” 80.48 80.29 80.39Determinized 81.09 79.72 80.40

...

S

VP SBAR

see

NP VP

duck

= 0.1

her

S

VP NP

see her duck

= 0.8

see her duck DOP Parser

Determinization

DOP parsing (Bod ’92)

91

Monday, April 19, 2010

Page 135: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Efficient inference through cascades of

weighted tree transducers

• First presentation of algorithms for inference through weighted extended tree transducer cascades

• On-the-fly approach significantly outperforms “classic” approach

(May, Knight, Vogler, Submitted)

92

Algorithmic Contribution II: Efficient Inference

Monday, April 19, 2010

Page 136: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through string transducers

Given a string and a transducer, calculate the highest weighted transformation of the

string by the transducer

93

Monday, April 19, 2010

Page 137: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through string transducers

the blue dwarf

Given a string and a transducer, calculate the highest weighted transformation of the

string by the transducer

93

Monday, April 19, 2010

Page 138: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through string transducers

Machine Translation

the blue dwarf

Given a string and a transducer, calculate the highest weighted transformation of the

string by the transducer

93

Monday, April 19, 2010

Page 139: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through string transducers

Machine Translation

the blue dwarf

Given a string and a transducer, calculate the highest weighted transformation of the

string by the transducer

el enano azúl / .3el enano triste / .1el duende azúl / .05el azúl duende / .01

...

93

Monday, April 19, 2010

Page 140: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through string cascades

Given a string and a cascade, calculate the highest weighted transformation of the

string by the cascade

94(Pereira & Riley, 1997)

Monday, April 19, 2010

Page 141: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through string cascades

Given a string and a cascade, calculate the highest weighted transformation of the

string by the cascade

A B

94(Pereira & Riley, 1997)

Monday, April 19, 2010

Page 142: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through string cascades

Given a string and a cascade, calculate the highest weighted transformation of the

string by the cascade

A B +

94(Pereira & Riley, 1997)

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

Monday, April 19, 2010

Page 143: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through string cascades

Given a string and a cascade, calculate the highest weighted transformation of the

string by the cascade

A B + +

94(Pereira & Riley, 1997)

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

Monday, April 19, 2010

Page 144: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through string cascades

Given a string and a cascade, calculate the highest weighted transformation of the

string by the cascade

A B1-BEST( ) = ?+ +

94(Pereira & Riley, 1997)

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

Monday, April 19, 2010

Page 145: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

1-BEST( ) = ?

Pipeline approach

Embed the string

+d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

+ f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

A B

Algorithmic Contribution II

95(Pereira & Riley, 1997)

Monday, April 19, 2010

Page 146: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

1-BEST( ) = ?

Pipeline approach

Embed the string

+d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

+ f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

a b c

A:A/1 B:B/1

Algorithmic Contribution II

96(Pereira & Riley, 1997)

Monday, April 19, 2010

Page 147: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

1-BEST( ) = ?

Pipeline approach

+d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

+ f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

a b c

A:A/1 B:B/1

Compose the cascade

Algorithmic Contribution II

(Pereira & Riley, 1997)97

Monday, April 19, 2010

Page 148: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

1-BEST( ) = ?

Pipeline approach

+ f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

Compose the cascade

B:A/.7

ad

A:A/.9

B:A/.8

B:B/.2

B:B/.3

A:B/.1

bd

be

cd

ce

(Pereira & Riley, 1997)98

Monday, April 19, 2010

Page 149: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

1-BEST( ) = ?

Pipeline approach

Compose the cascade

B:C/.42A:C/.54B:D/.28

B:D/.32B:C/.48

B:C/.14B:D/.06

B:C/.21B:D/.09

A:C/.07A:D/.03

A:D/.36

adf

bdf

bef

cdf

cef

(Pereira & Riley, 1997)99

Monday, April 19, 2010

Page 150: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

1-BEST( ) = ?

Pipeline approach

C/.42C/.54D/.28

D/.32C/.48

C/.14D/.06

C/.21D/.09

C/.07D/.03

D/.36

adf

bdf

bef

cdf

cef

Project the range

100(Pereira & Riley, 1997)

Monday, April 19, 2010

Page 151: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

1-BEST( ) = ?

Pipeline approach

C/.42C/.54D/.28

D/.32C/.48

C/.14D/.06

C/.21D/.09

C/.07D/.03

D/.36

adf

bdf

bef

cdf

cef

Find the 1-best path of the result

(Dijkstra, 1959)101

Monday, April 19, 2010

Page 152: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

1-BEST( ) = ?

Pipeline approach

C/.42C/.54D/.28

D/.32C/.48

C/.14D/.06

C/.21D/.09

C/.07D/.03

D/.36

adf

bdf

bef

cdf

cef

Find the 1-best path of the result

(Dijkstra, 1959)102

Monday, April 19, 2010

Page 153: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

1-BEST( ) = ?

Pipeline approach

C/.42C/.54D/.28

D/.32C/.48

C/.14D/.06

C/.21D/.09

C/.07D/.03

D/.36

adf

bdf

bef

cdf

cef

Find the 1-best path of the result

(Dijkstra, 1959)103

Monday, April 19, 2010

Page 154: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Problems with pipeline

C/.42C/.54D/.28

D/.32C/.48

C/.14D/.06

C/.21D/.09

C/.07D/.03

D/.36

adf

bdf

bef

cdf

cef

104

• Extra work done to create unused arcs

• Building done without input of all cascade members

Algorithmic Contribution II: Efficient Inference

Monday, April 19, 2010

Page 155: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

On-the-fly approach

1-BEST(

(Mohri, Pereira, Riley, 1999)105

a b c

A:A/1 B:B/1

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

adf ) = ?

Algorithmic Contribution II: Efficient Inference

• Build arcs in result graph as needed

• All members of cascade “vote” simultaneously

• Less total construction cost

Monday, April 19, 2010

Page 156: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

On-the-fly approach

(Mohri, Pereira, Riley, 1999)106

a b c

A:A/1 B:B/1

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

C/.07

adf

bdf

1-BEST( ) = ?

Algorithmic Contribution II: Efficient Inference

• Build arcs in result graph as needed

• All members of cascade “vote” simultaneously

• Less total construction cost

Monday, April 19, 2010

Page 157: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

On-the-fly approach

(Mohri, Pereira, Riley, 1999)107

a b c

A:A/1 B:B/1

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

C/.07D/.03

adf

bdf

1-BEST( ) = ?

Algorithmic Contribution II: Efficient Inference

• Build arcs in result graph as needed

• All members of cascade “vote” simultaneously

• Less total construction cost

Monday, April 19, 2010

Page 158: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

On-the-fly approach

(Mohri, Pereira, Riley, 1999)108

a b c

A:A/1 B:B/1

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

C/.54

C/.07D/.03

adf

bdf

bef

1-BEST( ) = ?

Algorithmic Contribution II: Efficient Inference

• Build arcs in result graph as needed

• All members of cascade “vote” simultaneously

• Less total construction cost

Monday, April 19, 2010

Page 159: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

On-the-fly approach

(Mohri, Pereira, Riley, 1999)109

a b c

A:A/1 B:B/1

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

C/.54

C/.07D/.03

D/.36

adf

bdf

bef

1-BEST( ) = ?

Algorithmic Contribution II: Efficient Inference

• Build arcs in result graph as needed

• All members of cascade “vote” simultaneously

• Less total construction cost

Monday, April 19, 2010

Page 160: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

On-the-fly approach

(Mohri, Pereira, Riley, 1999)110

a b c

A:A/1 B:B/1

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

C/.54

C/.07D/.03

D/.36

adf

bdf

bef

1-BEST( ) = ?

Algorithmic Contribution II: Efficient Inference

• Build arcs in result graph as needed

• All members of cascade “vote” simultaneously

• Less total construction cost

Monday, April 19, 2010

Page 161: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

On-the-fly approach

(Mohri, Pereira, Riley, 1999)111

a b c

A:A/1 B:B/1

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

C/.42C/.54

C/.07D/.03

D/.36

adf

bdf

bef cef

1-BEST( ) = ?

Algorithmic Contribution II: Efficient Inference

• Build arcs in result graph as needed

• All members of cascade “vote” simultaneously

• Less total construction cost

Monday, April 19, 2010

Page 162: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

On-the-fly approach

(Mohri, Pereira, Riley, 1999)112

a b c

A:A/1 B:B/1

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

C/.42C/.54

D/.28

C/.21D/.09

C/.07D/.03

D/.36

adf

bdf

bef

cdf

1-BEST( ) = ?cef

Algorithmic Contribution II: Efficient Inference

• Build arcs in result graph as needed

• All members of cascade “vote” simultaneously

• Less total construction cost

Monday, April 19, 2010

Page 163: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

On-the-fly approach

(Mohri, Pereira, Riley, 1999)113

a b c

A:A/1 B:B/1

d e

B:A/.8

A:A/.9A:B/.1

B:B/.3

A:B/.4B:B/.2 B:A/.7

A:A/.6

f

A:C/.6

B:C/.7

A:D/.4

B:D/.3

C/.42C/.54

D/.28

C/.21D/.09

C/.07D/.03

D/.36

adf

bdf

bef

1-BEST( ) = ?cdf

cef

Algorithmic Contribution II: Efficient Inference

• Build arcs in result graph as needed

• All members of cascade “vote” simultaneously

• Less total construction cost

Monday, April 19, 2010

Page 164: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Inference through tree cascades?

• In general, tree transducers are not closed under composition

• However, some classes are closed, and by adding additional steps to the process, we can conduct inference

• We provide pipeline and on-the-fly algorithms for applicable classes of weighted tree transducers

114

Algorithmic Contribution II: Efficient Inference

Monday, April 19, 2010

Page 165: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through tree cascades

Given a tree and a cascade, calculate the highest weighted transformation of the tree

by the cascade

115

Monday, April 19, 2010

Page 166: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through tree cascades

Given a tree and a cascade, calculate the highest weighted transformation of the tree

by the cascade

115

S

U U

Monday, April 19, 2010

Page 167: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through tree cascades

Given a tree and a cascade, calculate the highest weighted transformation of the tree

by the cascade

+

115

.3Sd

d

Te

.7Sd

f

He

.2Ud V

.8Ue V

.6Uf W

S

U U

Monday, April 19, 2010

Page 168: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through tree cascades

Given a tree and a cascade, calculate the highest weighted transformation of the tree

by the cascade

+ +

115

.3Sd

d

Te

.7Sd

f

He

.2Ud V

.8Ue V

.6Uf W

S

U U

.4Tg

g

Yg

.9Vg Z

Monday, April 19, 2010

Page 169: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Inference through tree cascades

Given a tree and a cascade, calculate the highest weighted transformation of the tree

by the cascade

1-BEST( ) = ?+ +

115

.3Sd

d

Te

.7Sd

f

He

.2Ud V

.8Ue V

.6Uf W

S

U U

.4Tg

g

Yg

.9Vg Z

Monday, April 19, 2010

Page 170: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Pipeline approach

1-BEST( ) = ?.4Tg

g

Y

g

.9Vg Z

S

U U

.3Sd Td e

.7S Hd

f e

.2U Vd

.8U Ve

.6U Wf

++

116

Monday, April 19, 2010

Page 171: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Pipeline approach

Embed the tree

1Sa

b

Sc

1Ub U

1Uc U

.4Tg

g

Y

g

.9Vg Z

.3Sd Td e

.7S Hd

f e

.2U Vd

.8U Ve

.6U Wf

1-BEST( ) = ?++

117

Monday, April 19, 2010

Page 172: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Pipeline approach

.4Tg

g

Y

g

.9Vg Z

.3Sad Tbd ce

.7S Had

cf be

.2U Vbd

.8U Vbe

.6U Wcf

.8U Vce

1-BEST( ) = ?+

Compose adjacent transducers

118

Monday, April 19, 2010

Page 173: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Pipeline approach

1-BEST( ) = ?.4Tg

g

Y

g

.9Vg Z+

.3ad T

bd ce

.7 Had

cf be

.2 Vbd

.8 Vbe

.6 Wcf

.8 Vce

Project the range

New step!

119

Monday, April 19, 2010

Page 174: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Pipeline approach

1-BEST( ) = ?.4Tg

g

Y

g

.9Vg Z+

.3Tad Tbd ce

.7H Had

cf be

.2V Vbd

.8V Vbe

.6W Wcf

.8U Vce

Embed the grammarNew step!

120

Monday, April 19, 2010

Page 175: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Pipeline approach

1-BEST( ) = ?.4Tg

g

Y

g

.9Vg Z+

.3Tad Tbd ce

.7H Had

cf be

.2V Vbd

.8V Vbe

.6W Wcf

.8U Vce

Embed the grammar

Identity transducer has more composition cases

121

Monday, April 19, 2010

Page 176: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Pipeline approach

.12Tadg

ceg

Ybdg

.18Vbdg Z

.72Vceg Z

Compose adjacent transducers

1-BEST( ) = ?

122

Monday, April 19, 2010

Page 177: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Pipeline approach

.12adg

ceg

Y

bdg

.18bdg Z

.72ceg Z

Project the range

1-BEST( ) = ?

123

Monday, April 19, 2010

Page 178: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

Pipeline approach

Find 1-best path of the result

Y

Z Z.016

124(Knuth ’77)

Monday, April 19, 2010

Page 179: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

On-the-fly approach

1-BEST( ) = ?

125

1Sa

b

Sc

1Ub U

1Uc U

.3Sd Td e

.7S Hd

f e

.2U Vd

.8U Ve

.6U Wf

.4Tg

g

Y

g

.9Vg Z

adg

Monday, April 19, 2010

Page 180: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

On-the-fly approach

1-BEST( ) = ?

126

1Sa

b

Sc

1Ub U

1Uc U

.3Sd Td e

.7S Hd

f e

.2U Vd

.8U Ve

.6U Wf

.4Tg

g

Y

g

.9Vg Z

.12

ceg

Y

bdg

adg

Monday, April 19, 2010

Page 181: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

On-the-fly approach

1-BEST( ) = ?

127

1Sa

b

Sc

1Ub U

1Uc U

.3Sd Td e

.7S Hd

f e

.2U Vd

.8U Ve

.6U Wf

.4Tg

g

Y

g

.9Vg Z

.12

ceg

Y

bdg

adg

.18bdg Z

Monday, April 19, 2010

Page 182: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

On-the-fly approach

1-BEST( ) = ?

128

1Sa

b

Sc

1Ub U

1Uc U

.3Sd Td e

.7S Hd

f e

.2U Vd

.8U Ve

.6U Wf

.4Tg

g

Y

g

.9Vg Z

.12

ceg

Y

bdg

adg

.18bdg Z

.72ceg Z

Monday, April 19, 2010

Page 183: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

On-the-fly approach

1-BEST( ) = ?

129

1Sa

b

Sc

1Ub U

1Uc U

.3Sd Td e

.7S Hd

f e

.2U Vd

.8U Ve

.6U Wf

.4Tg

g

Y

g

.9Vg Z

.12

ceg

Y

bdg

adg

.18bdg Z

.72ceg Z

never paired together

Monday, April 19, 2010

Page 184: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

On-the-fly vs. pipelineRe-order English

wordsInsert function

wordsTranslate to

JapaneseLanguage model

• We recovered 1-best English tree through this cascade

• We calculated time to complete for several language models and both pipeline and on-the-fly methods

• On-the-fly was much faster and in some cases the only method that worked in the memory allotted

(Yamada & Knight, 2001)130

Algorithmic Contribution II: Efficient Inference

Monday, April 19, 2010

Page 185: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution II: Efficient Inference

On-the-fly vs. pipelinelanguage model method time/sentence

weakpipeline 28s

weakon-the-fly 17s

strong & largepipeline >60s*

strong & largeon-the-fly 24s

strong & smallpipeline 2.5s

strong & smallon-the-fly .06s

* Ran out of memory before completing131

Monday, April 19, 2010

Page 186: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Extension for tree-string transducers

Re-order English words

Insert function words

Translate to Japanese

tree-tree tree-tree tree-string

ヘビ が 大嫌い だ

VB

PRP VB NN

i hate snakes

132

Algorithmic Contribution II: Efficient Inference

What if the cascade ends in a tree-stringtransducer, and we want to pass a string

through the cascade?

Monday, April 19, 2010

Page 187: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Extension for tree-string transducers

Re-order English words

Insert function words

Translate to Japanese

tree-tree tree-tree tree-string

ヘビ が 大嫌い だ

VB

PRP VB NN

i hate snakes

cfg parsing

132

Algorithmic Contribution II: Efficient Inference

What if the cascade ends in a tree-stringtransducer, and we want to pass a string

through the cascade?

Monday, April 19, 2010

Page 188: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Extension for tree-string transducers

Re-order English words

Insert function words

Translate to Japanese

tree-tree tree-tree tree-string

ヘビ が 大嫌い だ

VB

PRP VB NN

i hate snakes

on-the-fly or pipeline

cfg parsing

132

Algorithmic Contribution II: Efficient Inference

What if the cascade ends in a tree-stringtransducer, and we want to pass a string

through the cascade?

Monday, April 19, 2010

Page 189: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

A weighted tree automata and transducer toolkit

• Operations for inference, manipulation, and training of tree transducers and automata

• Very easy to experiment quickly, without coding

• http://www.isi.edu/licensed-sw/tiburon

(May & Knight, CIAA ’06)

133

Monday, April 19, 2010

Page 190: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Tiburon example 1: syntax MT cascade

ヘビ が 大嫌い だTOPVB

PRP VB NNi hate snakes

Simplified English trees to Japanese strings

rotate insert translate j-stringe-tree

(Yamada & Knight, 2001) 134

Monday, April 19, 2010

Page 191: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

rotate j-stringe-tree

1) Rotate children

(Yamada & Knight, 2001)

0.9VB VB

prp

vb

vb vb

135

insert translate

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 192: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

insert j-stringe-tree

2) Insert function words

(Yamada & Knight, 2001)

0.3PRPvb PRP

prp INS

136

rotate translate

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 193: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

translate j-stringe-tree

3) Translate leaves

(Yamada & Knight, 2001)

hate 大嫌い.25

vb

137

rotate insert

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 194: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

• Task: Decode candidate sentence, get top 5 answers

• Algorithms used: inference through cascade, k-best, determinization

彼ら は 偽善 が 大嫌い だCandidate:

Correct answer:TOP(VB(NN("hypocrisy") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them")))))

138

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 195: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Let’s try it!

% tiburon -k 5 -m tropical -e euc-jp rot ins trans ej.1.f

139

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 196: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Let’s try it!

% tiburon -k 5 -m tropical -e euc-jp rot ins trans ej.1.f% tiburon

program

139

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 197: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Let’s try it!

% tiburon -k 5 -m tropical -e euc-jp rot ins trans ej.1.f-k 5

5 best

139

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 198: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Let’s try it!

% tiburon -k 5 -m tropical -e euc-jp rot ins trans ej.1.f-m tropical

semiring

139

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 199: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Let’s try it!

% tiburon -k 5 -m tropical -e euc-jp rot ins trans ej.1.f-e euc-jp

character set

139

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 200: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Let’s try it!

% tiburon -k 5 -m tropical -e euc-jp rot ins trans ej.1.frot ins trans

cascade

139

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 201: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Let’s try it!

% tiburon -k 5 -m tropical -e euc-jp rot ins trans ej.1.fej.1.f

input

139

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 202: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -k 5 -m tropical -e euc-jp rot ins trans ej.1.fTOP(VB(PRP("him") VB("abominate") IN(IN("above") NN(JJ("abhorrent") NN("fanatic"))))) # 18.368TOP(VB(PRP("them") VB("abominate") IN(IN("above") NN(JJ("abhorrent") NN("fanatic"))))) # 18.368TOP(VB(PRP("him") VB("abominate") IN(IN("above") NN(JJ("abhorrent") NN("hypocrisy"))))) # 18.368TOP(VB(PRP("them") VB("abominate") IN(IN("above") NN(JJ("abhorrent") NN("hypocrisy"))))) # 18.368TOP(VB(PRP("him") VB("abominate") IN(IN("above") NN(JJ("abhorrent") NN("clouds"))))) # 18.368

First try is not so good!

140

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 203: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Add in a simple PCFG-based language model

IN

IN NN

141

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 204: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Add in a simple PCFG-based language model

IN

IN NN IN0.375

in

nnin

141

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 205: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -k 5 -m tropical -e euc-jp pcfg-lm rot ins trans ej.1.fTOP(VB(PRP("i") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("i"))))) # 33.024TOP(VB(PRP("i") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("i"))))) # 33.718TOP(VB(PRP("him") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("i"))))) # 33.718TOP(VB(PRP("i") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("him"))))) # 33.718TOP(VB(PRP("them") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("i"))))) # 33.718

Add in a simple PCFG-based language model

IN

IN NN IN0.375

in

nnin

141

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 206: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Try a grandparent language model

IN

IN NN

VB

142

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 207: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Try a grandparent language model

IN

IN NN

VBIN

0.667vbin

inin

innn

142

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 208: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -k 5 -m tropical -e euc-jp gp-lm rot ins trans ej.1.fTOP(VB(PRP("i") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 26.603TOP(VB(PRP("i") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 27.297TOP(VB(NN("hypocrisy") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.033TOP(VB(PRP("i") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.071TOP(VB(NN("hypocrisy") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.726

Try a grandparent language model

IN

IN NN

VBIN

0.667vbin

inin

innn

142

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 209: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -k 5 -m tropical -e euc-jp gp-lm rot ins trans ej.1.fTOP(VB(PRP("i") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 26.603TOP(VB(PRP("i") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 27.297TOP(VB(NN("hypocrisy") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.033TOP(VB(PRP("i") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.071TOP(VB(NN("hypocrisy") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.726

Correct sentence is 5th

Try a grandparent language model

IN

IN NN

VBIN

0.667vbin

inin

innn

142

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 210: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -k 5 -m tropical -e euc-jp gp-lm rot ins trans ej.1.fTOP(VB(PRP("i") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 26.603TOP(VB(PRP("i") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 27.297TOP(VB(NN("hypocrisy") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.033TOP(VB(PRP("i") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.071TOP(VB(NN("hypocrisy") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.726

Correct sentence is 5th

Try a grandparent language model

IN

IN NN

VB

Duplicates

IN0.667

vbin

inin

innn

142

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 211: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

• Combine duplicate derivations in entire search space using weighted determinization

143

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 212: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

• Combine duplicate derivations in entire search space using weighted determinization

% tiburon -d 5 -k 5 -m tropical -e euc-jp gp-lm rot ins trans ej.1.fTOP(VB(PRP("i") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 26.329TOP(VB(PRP("i") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 27.023TOP(VB(NN("hypocrisy") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 27.759TOP(VB(NN("hypocrisy") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.452TOP(VB(NN(DT("a") NN("clouds")) VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 31.250

143

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 213: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

• Combine duplicate derivations in entire search space using weighted determinization

% tiburon -d 5 -k 5 -m tropical -e euc-jp gp-lm rot ins trans ej.1.fTOP(VB(PRP("i") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 26.329TOP(VB(PRP("i") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 27.023TOP(VB(NN("hypocrisy") VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 27.759TOP(VB(NN("hypocrisy") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 28.452TOP(VB(NN(DT("a") NN("clouds")) VB("abominate") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 31.250

Now we’re 4th

143

Tiburon example 1: syntax MT cascade

Monday, April 19, 2010

Page 214: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Tiburon example 2:training a syntax LM

• The LMs we used before had no hidden states

• Let’s introduce hidden states and learn weights with EM

VB

NN VB

(Petrov & Klein, ’07) 144

Monday, April 19, 2010

Page 215: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Tiburon example 2:training a syntax LM

• The LMs we used before had no hidden states

• Let’s introduce hidden states and learn weights with EM

VB

NN VB

(Petrov & Klein, ’07)

vb VB

nn vb

144

Monday, April 19, 2010

Page 216: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

Tiburon example 2:training a syntax LM

• The LMs we used before had no hidden states

• Let’s introduce hidden states and learn weights with EM

VB

NN VB

etc.(Petrov & Klein, ’07)

vb VB

nn vb

vb-0 VB

nn-0 vb-0

vb-0 VB

nn-1 vb-0

vb-0 VB

nn-1 vb-1

vb-1 VB

nn-0 vb-0144

Monday, April 19, 2010

Page 217: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -t 50 --randomize trees > 4split-lmrtg.4split

145

Tiburon example 2:training a syntax LM

Monday, April 19, 2010

Page 218: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -t 50 --randomize trees > 4split-lm-t 50

50 iterations

rtg.4split

145

Tiburon example 2:training a syntax LM

Monday, April 19, 2010

Page 219: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -t 50 --randomize trees > 4split-lm--randomize

random initial weights avoids

saddles

rtg.4split

145

Tiburon example 2:training a syntax LM

Monday, April 19, 2010

Page 220: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -t 50 --randomize trees > 4split-lm

training data

rtg.4splittrees

145

Tiburon example 2:training a syntax LM

Monday, April 19, 2010

Page 221: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -t 50 --randomize trees > 4split-lm

4-way split

rtg.4splitrtg.4split

145

Tiburon example 2:training a syntax LM

Monday, April 19, 2010

Page 222: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -t 50 --randomize trees rtg.4split > 4split-lmCross entropy with normalized initial weights is 1.868; corpus prob is e^-269.025Cross entropy after 1 iterations is 1.190; corpus prob is e^-171.383Cross entropy after 2 iterations is 1.138; corpus prob is e^-163.866Cross entropy after 3 iterations is 1.036; corpus prob is e^-149.229...Cross entropy after 47 iterations is 0.581; corpus prob is e^-83.665Cross entropy after 48 iterations is 0.581; corpus prob is e^-83.665Cross entropy after 49 iterations is 0.581; corpus prob is e^-83.665

146

Tiburon example 2:training a syntax LM

Monday, April 19, 2010

Page 223: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -t 50 --randomize trees rtg.4split > 4split-lmCross entropy with normalized initial weights is 1.868; corpus prob is e^-269.025Cross entropy after 1 iterations is 1.190; corpus prob is e^-171.383Cross entropy after 2 iterations is 1.138; corpus prob is e^-163.866Cross entropy after 3 iterations is 1.036; corpus prob is e^-149.229...Cross entropy after 47 iterations is 0.581; corpus prob is e^-83.665Cross entropy after 48 iterations is 0.581; corpus prob is e^-83.665Cross entropy after 49 iterations is 0.581; corpus prob is e^-83.665

Compare with GP-PCFG% tiburon -t 3 --randomize trees rtg.gp.pcfg > lmCross entropy with normalized initial weights is 0.827; corpus prob is e^-119.022Cross entropy after 1 iterations is 0.732; corpus prob is e^-105.448Cross entropy after 2 iterations is 0.732; corpus prob is e^-105.448

146

Tiburon example 2:training a syntax LM

Monday, April 19, 2010

Page 224: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

We can subjectively see state specialization

147

prp0

PRPhis

.53

PRPher

.15prp0

PRPmy

.12prp0

prp2

PRPi

.57

PRPit

.35prp2

PRPyou

.06prp2

prp1

PRPhe

.68

PRPshe

.18prp1

PRPthey

.07prp1

prp3

PRPhim

.26

PRPme

.19prp3

PRPyou

.18prp3

Tiburon example 2:training a syntax LM

Monday, April 19, 2010

Page 225: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution I: Tiburon

% tiburon -k 5 -m tropical -e euc-jp 4split-lm rot ins trans ej.1.fTOP(VB(NN("hypocrisy") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 29.556TOP(VB(NN("fanatic") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 29.556TOP(VB(NN("clouds") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 29.556TOP(VB(NN("fanatic") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 29.717TOP(VB(NN("hypocrisy") VB("is") JJ(JJ("abhorrent") TO(TO("to") PRP("them"))))) # 29.717

Tied for first!

148

Tiburon example 2:training a syntax LM

Monday, April 19, 2010

Page 226: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

Using tree transducers to improve

machine translation

• We will now shift focus to improving state-of-the-art syntax MT results

• At core, we’re using the power of training tree transducers to achieve gains

(May & Knight, EMNLP ’07)

149

Monday, April 19, 2010

Page 227: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

taiwan ’s surplus in trade between the two shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

1) Obtain alignments

150

Extracting syntactic rules

Monday, April 19, 2010

Page 228: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

taiwan ’s surplus in trade between the two shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

1) Obtain alignments

150(Galley et al. ’04, ’06)

Extracting syntactic rules

Monday, April 19, 2010

Page 229: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

2) Add parse tree

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

(Galley et al. ’04, ’06)

Extracting syntactic rules

151

Monday, April 19, 2010

Page 230: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

151

Monday, April 19, 2010

Page 231: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

151

Monday, April 19, 2010

Page 232: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

151

Monday, April 19, 2010

Page 233: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

151

Monday, April 19, 2010

Page 234: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

151

Monday, April 19, 2010

Page 235: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

151

Monday, April 19, 2010

Page 236: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

151

Monday, April 19, 2010

Page 237: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

151

Monday, April 19, 2010

Page 238: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

151

Monday, April 19, 2010

Page 239: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

151

Monday, April 19, 2010

Page 240: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

PPPP

IN NPC

between NPB

DT

the

CD

two

NNS

shores

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

151

Monday, April 19, 2010

Page 241: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

PPPP

IN NPC

between NPB

DT

the

CD

two

NNS

shores

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

151

Monday, April 19, 2010

Page 242: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NPBNPB NN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

PPPP

IN NPC

between NPB

DT

the

CD

two

NNS

shores

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

151

Monday, April 19, 2010

Page 243: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NPBNPB NN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

PPPP

IN NPC

between NPB

DT

the

CD

two

NNS

shores

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

151

Monday, April 19, 2010

Page 244: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NPBNPB NN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

PPPP

IN NPC

between NPB

DT

the

CD

two

NNS

shores

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NPC NPCNPBPP

151

Monday, April 19, 2010

Page 245: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NPBNPB NN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

PPPP

IN NPC

between NPB

DT

the

CD

two

NNS

shores

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NPC NPCNPBPP

151

Monday, April 19, 2010

Page 246: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

PP PPIN NPC

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NPBNPB NN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

PPPP

IN NPC

between NPB

DT

the

CD

two

NNS

shores

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NPC NPCNPBPP

151

Monday, April 19, 2010

Page 247: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

PP PPIN NPC

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NPBNPB NN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

PPPP

IN NPC

between NPB

DT

the

CD

two

NNS

shores

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NPC NPCNPBPP

151

Monday, April 19, 2010

Page 248: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

PP PPIN NPC

NPCNPC

NPB

NPB PPNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

1

3) Extract rules

(Galley et al. ’04, ’06)

Extracting syntactic rules

NPBNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP POS

taiwan ‘s

NPB

NPBNPB NN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NN

surplusNN

NN

tradeNNNP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

IN

inIN

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

PPPP

IN NPC

between NPB

DT

the

CD

two

NNS

shores

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NPC NPCNPBPP

151

Monday, April 19, 2010

Page 249: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

Bad alignments make bad rules

One bad link makes a totally unusable syntax rule!

S-C

NP-C

NPB

NNP

guangxi

POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

GUANGXI OUTSIDE-WORLD OPENING-UP

R24: S-C

NP-C

NPB

x0:NNP POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

! x0 R25: NNP

guangxi

!

R26: S-C

x0:NP-C x1:VP

! x0 x1 R15: NP-C

x0:NPB

! x0 R11: NPB

x0:NNP POS

’s

! x0 R27: VP

VBG

opening

PRT

RP

up

x0:PP

! x0

R28: PP

TO

to

x0:NP-C

! x0 R15: NP-C

x0:NPB

! x0 R29: NPB

DT

the

JJ

outside

NN

world

! R25: NNP

guangxi

!

Figure 3: The impact of a bad alignment on rule extraction. Including the alignment link indicated by the

dotted line in the example leads to the rule set in the second row. The re-alignment procedure described in

Section 3.2 learns to prefer the rule set at bottom, which omits the bad link.

1. A fertility y for each word ei in e is chosen

with probability pfert(y|ei).2. A null word is inserted next to each

fertility-expanded word with probability

pnull.

3. Each token ei in the fertility-expanded

word and null string is translated into

some foreign word fi in f with probability

ptrans(fi|ei).4. The position of each foreign word

fi that was translated from ei is

changed by ! (which may be posi-

tive, negative, or zero) with probability

pdistortion(!|A(ei),B(fi)), where A and

B are functions over the source and targetvocabularies, respectively.

Brown et al. (1993) describes an EM algorithm

for estimating values for the four tables in the gener-

ative story. However, searching the space of all pos-

sible alignments is intractable for EM, so in practice

the procedure is bootstrapped by models with nar-

rower search space such as IBM Model 1 (Brown et

al., 1993) or Aachen HMM (Vogel et al., 1996).

1

S-C

NP-C

NPB

NNP

guangxi

POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

GUANGXI OUTSIDE-WORLD OPENING-UP

R24: S-C

NP-C

NPB

x0:NNP POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

! x0 R25: NNP

guangxi

!

R26: S-C

x0:NP-C x1:VP

! x0 x1 R15: NP-C

x0:NPB

! x0 R11: NPB

x0:NNP POS

’s

! x0 R27: VP

VBG

opening

PRT

RP

up

x0:PP

! x0

R28: PP

TO

to

x0:NP-C

! x0 R15: NP-C

x0:NPB

! x0 R29: NPB

DT

the

JJ

outside

NN

world

! R25: NNP

guangxi

!

Figure 1: English tree, foreign string, and EMD alignment of 2.5 Chinese core sentence 927

152

Monday, April 19, 2010

Page 250: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

Bad alignments make bad rules

One bad link makes a totally unusable syntax rule!

S-C

NP-C

NPB

NNP

guangxi

POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

GUANGXI OUTSIDE-WORLD OPENING-UP

R24: S-C

NP-C

NPB

x0:NNP POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

! x0 R25: NNP

guangxi

!

R26: S-C

x0:NP-C x1:VP

! x0 x1 R15: NP-C

x0:NPB

! x0 R11: NPB

x0:NNP POS

’s

! x0 R27: VP

VBG

opening

PRT

RP

up

x0:PP

! x0

R28: PP

TO

to

x0:NP-C

! x0 R15: NP-C

x0:NPB

! x0 R29: NPB

DT

the

JJ

outside

NN

world

! R25: NNP

guangxi

!

Figure 3: The impact of a bad alignment on rule extraction. Including the alignment link indicated by the

dotted line in the example leads to the rule set in the second row. The re-alignment procedure described in

Section 3.2 learns to prefer the rule set at bottom, which omits the bad link.

1. A fertility y for each word ei in e is chosen

with probability pfert(y|ei).2. A null word is inserted next to each

fertility-expanded word with probability

pnull.

3. Each token ei in the fertility-expanded

word and null string is translated into

some foreign word fi in f with probability

ptrans(fi|ei).4. The position of each foreign word

fi that was translated from ei is

changed by ! (which may be posi-

tive, negative, or zero) with probability

pdistortion(!|A(ei),B(fi)), where A and

B are functions over the source and targetvocabularies, respectively.

Brown et al. (1993) describes an EM algorithm

for estimating values for the four tables in the gener-

ative story. However, searching the space of all pos-

sible alignments is intractable for EM, so in practice

the procedure is bootstrapped by models with nar-

rower search space such as IBM Model 1 (Brown et

al., 1993) or Aachen HMM (Vogel et al., 1996).

1

S-C

NP-C

NPB

NNP

guangxi

POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

GUANGXI OUTSIDE-WORLD OPENING-UP

R24: S-C

NP-C

NPB

x0:NNP POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

! x0 R25: NNP

guangxi

!

R26: S-C

x0:NP-C x1:VP

! x0 x1 R15: NP-C

x0:NPB

! x0 R11: NPB

x0:NNP POS

’s

! x0 R27: VP

VBG

opening

PRT

RP

up

x0:PP

! x0

R28: PP

TO

to

x0:NP-C

! x0 R15: NP-C

x0:NPB

! x0 R29: NPB

DT

the

JJ

outside

NN

world

! R25: NNP

guangxi

!

Figure 1: English tree, foreign string, and EMD alignment of 2.5 Chinese core sentence 927

S-CNNP

S-C

NPB

POS

‘s

NPC VP

VBG

opening

PRT

RP

PP

up

TO NPC

to NPB

DT

the

JJ

outside

NN

world

S-C

NP-C

NPB

NNP

guangxi

POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

GUANGXI OUTSIDE-WORLD OPENING-UPR24: S-C

NP-C

NPB

x0:NNP POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

! x0 R25: NNP

guangxi

!

R26: S-C

x0:NP-C x1:VP

! x0 x1 R15: NP-C

x0:NPB

! x0 R11: NPB

x0:NNP POS

’s

! x0 R27: VP

VBG

opening

PRT

RP

up

x0:PP

! x0

R28: PP

TO

to

x0:NP-C

! x0 R15: NP-C

x0:NPB

! x0 R29: NPB

DT

the

JJ

outside

NN

world

! R25: NNP

guangxi

!

Figure 3: The impact of a bad alignment on rule extraction. Including the alignment link indicated by thedotted line in the example leads to the rule set in the second row. The re-alignment procedure described inSection 3.2 learns to prefer the rule set at bottom, which omits the bad link.

1. A fertility y for each word ei in e is chosenwith probability pfert(y|ei).

2. A null word is inserted next to eachfertility-expanded word with probabilitypnull.

3. Each token ei in the fertility-expandedword and null string is translated intosome foreign word fi in f with probabilityptrans(fi|ei).

4. The position of each foreign wordfi that was translated from ei ischanged by ! (which may be posi-tive, negative, or zero) with probability

pdistortion(!|A(ei),B(fi)), where A andB are functions over the source and targetvocabularies, respectively.

Brown et al. (1993) describes an EM algorithmfor estimating values for the four tables in the gener-ative story. However, searching the space of all pos-sible alignments is intractable for EM, so in practicethe procedure is bootstrapped by models with nar-rower search space such as IBM Model 1 (Brown etal., 1993) or Aachen HMM (Vogel et al., 1996).

152

Monday, April 19, 2010

Page 251: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

Where do the alignments come from?

sentence pairs

(e-string, f-string)

generative model

(IBM model 4)(Brown et al., ’93)

unsupervised learning

(GIZA++)(Och and Ney, ’03)

Viterbi alignments

Notice, nothing about syntax!

seed data

(word pairs)

153

Monday, April 19, 2010

Page 252: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

Let’s add syntax!

sentence pairs

(e-tree, f-string)

generative model

(syntax model)

unsupervised learning

Viterbi alignments

seed data

(tree-string syntax rules)

(Training Tree Transducers) (Graehl, Knight, May ’08)

154

Monday, April 19, 2010

Page 253: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

Let’s add syntax!

sentence pairs

(e-tree, f-string)

generative model

(syntax model)

unsupervised learning

Viterbi alignments

seed data

(tree-string syntax rules)

(Training Tree Transducers) (Graehl, Knight, May ’08)

tree-to-string transducer154

Monday, April 19, 2010

Page 254: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

Let’s add syntax!

sentence pairs

(e-tree, f-string)

generative model

(syntax model)

unsupervised learning

Viterbi alignments

seed data

(tree-string syntax rules)

(Training Tree Transducers) (Graehl, Knight, May ’08)

tree-to-string transducer

tiburon -t ...

154

Monday, April 19, 2010

Page 255: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

RULE SET

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP

taiwan

NNPR12:

NNPNPB

POS

‘s

NPBR11:

POSNPB

NPB

NNP

taiwan

R17:

POS

‘s

POSR18:NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NPB

NNP POS

taiwan ‘s

NPBR2:NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

How we learn

• For each training sentence, build derivation forest containing each possible tree of rules that satisfies the sentence pair

• EM iterations set highest probability to most useful rules

• Viterbi derivation has syntax-aware alignments and bad rules are not extracted

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules that

can explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignment

procedure, and the third is a viable, if poor quality, alternative that is not learned.

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules that

can explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignment

procedure, and the third is a viable, if poor quality, alternative that is not learned.

= ?

R2R11

R12

R17

R18 (Graehl, Knight, May, ’08)155

Monday, April 19, 2010

Page 256: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

Experiments

• Build a bootstrap alignment with GIZA

• Obtain new alignments with syntactic re-alignment

• Compare syntax MT system performance on rules extracted from each alignment

GIZA

Syntactic Re-Alignment

Syntax MT

Vs.

GIZA

Syntax MT

156

Monday, April 19, 2010

Page 257: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

Results

source language

original alignments type

MT system rules

(millions)

NIST 2003 BLEU Δ

Arabic

weakbaseline 2.3 47.3

+.6Arabic

weakre-alignment 2.5 47.9

+.6Arabic

strongbaseline 3.2 49.6

+.4Arabic

strongre-alignment 3.6 50.0

+.4

Chineseweak

baseline 19.1 37.8+.9

Chineseweak

re-alignment 26.0 38.7+.9

Chinesestrong

baseline 23.4 38.9+1.1

Chinesestrong

re-alignment 33.4 40.0+1.1

157

Monday, April 19, 2010

Page 258: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Conclusions and future work

• Algorithmic contributions

• Determinization of weighted tree automata

• Efficient inference through weighted tree transducer cascades

• Practical contributions

• Weighted tree automata and transducer toolkit

• Improvements in SMT using tree transducer EM

S-C

NP-C

NPB

NNP

guangxi

POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

GUANGXI OUTSIDE-WORLD OPENING-UP

R24: S-C

NP-C

NPB

x0:NNP POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

! x0 R25: NNP

guangxi

!

R26: S-C

x0:NP-C x1:VP

! x0 x1 R15: NP-C

x0:NPB

! x0 R11: NPB

x0:NNP POS

’s

! x0 R27: VP

VBG

opening

PRT

RP

up

x0:PP

! x0

R28: PP

TO

to

x0:NP-C

! x0 R15: NP-C

x0:NPB

! x0 R29: NPB

DT

the

JJ

outside

NN

world

! R25: NNP

guangxi

!

Figure 3: The impact of a bad alignment on rule extraction. Including the alignment link indicated by the

dotted line in the example leads to the rule set in the second row. The re-alignment procedure described in

Section 3.2 learns to prefer the rule set at bottom, which omits the bad link.

1. A fertility y for each word ei in e is chosen

with probability pfert(y|ei).2. A null word is inserted next to each

fertility-expanded word with probability

pnull.

3. Each token ei in the fertility-expanded

word and null string is translated into

some foreign word fi in f with probability

ptrans(fi|ei).4. The position of each foreign word

fi that was translated from ei is

changed by ! (which may be posi-

tive, negative, or zero) with probability

pdistortion(!|A(ei),B(fi)), where A and

B are functions over the source and targetvocabularies, respectively.

Brown et al. (1993) describes an EM algorithm

for estimating values for the four tables in the gener-

ative story. However, searching the space of all pos-

sible alignments is intractable for EM, so in practice

the procedure is bootstrapped by models with nar-

rower search space such as IBM Model 1 (Brown et

al., 1993) or Aachen HMM (Vogel et al., 1996).

1

S-C

NP-C

NPB

NNP

guangxi

POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

GUANGXI OUTSIDE-WORLD OPENING-UP

R24: S-C

NP-C

NPB

x0:NNP POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

! x0 R25: NNP

guangxi

!

R26: S-C

x0:NP-C x1:VP

! x0 x1 R15: NP-C

x0:NPB

! x0 R11: NPB

x0:NNP POS

’s

! x0 R27: VP

VBG

opening

PRT

RP

up

x0:PP

! x0

R28: PP

TO

to

x0:NP-C

! x0 R15: NP-C

x0:NPB

! x0 R29: NPB

DT

the

JJ

outside

NN

world

! R25: NNP

guangxi

!

Figure 1: English tree, foreign string, and EMD alignment of 2.5 Chinese core sentence 927

D

A B

D

A C

D

A B

= .054

= .012

= .036D

A C

D

A B

= .066

= .036

158

Monday, April 19, 2010

Page 259: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Future work

• More algorithms!

• approximate linear k-best

• on-the-fly tree-to-string inference

• More applications!

• financial systems

• gene sequencing

• More formalisms!

• unranked automata

• tree-adjoining grammars159

Monday, April 19, 2010

Page 260: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Conclusions• Tiburon makes it easy to use tree transducers

in NLP

• (known) Theses using Tiburon:

• Alexander Radzievskiy -- Masters on parsing with semantic role labels

• Joseph Tepperman -- PhD on pronunciation evaluation

• Victoria Fossum -- PhD on machine translation and parsing

• July 2010: ATANLP in Uppsala!

160

Monday, April 19, 2010

Page 261: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Thanks!Erika Barragan-Nunez, Rahul Bhagat, Marlynn Block, Matthias

Büchse, Gully Burns, Marco Carbone, David Chiang, Hal Daumé III, Steve DeNeefe, John DeNero, Jason Eisner, Victoria Fossum, Alex Fraser, Jonathan Graehl, Erica Greene, Carmen Heger, Ulf Hermjakob, Johanna Högberg, Dirk Hovy, Ed Hovy, Liang Huang,

David Kempe, Kevin Knight, Sven Koenig, Zornitsa Kozareva, Lorelei Laird, Kary Lau, Jerry Levine, Andreas Maletti, Daniel

Marcu, Mitch Marcus, Howard May, Irena May, Rutu Mehta, Alma Nava, Adam Pauls, Fernando Pereira, Ben Plantan, Oana

Postolache, Michael Pust, David Pynadath, Sujith Ravi, Deepak Ravichandran, Jason Riesa, Bill Rounds, Lee Rowland, Tom Russ, Shri Narayanan, Radu Soricut, Magnus Steinby, Shang-Hua Teng,

Cătălin Tîrnăucă, Ashish Vaswani, Jens Vöckler, Heiko Vogler, David Foster Wallace, Wei Wang, Ralph Weischedel, Kenji Yamada

161

Monday, April 19, 2010

Page 262: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Monday, April 19, 2010

Page 263: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Backup Slides

Monday, April 19, 2010

Page 264: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Algorithmic Contribution I: WTA Determinization

Non-deterministic and nonterminal?

t

q r

D.2

u

q r

D.3

r/.25s/.75q/1

+

.125

r/.25s/.75q/1

t/.4u/.6 D

=

Monday, April 19, 2010

Page 265: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

MT Details• Decoded 116 short Chinese sentences using the string-to-tree MT

model based on (Galley et al. 2004)

• No language model

• No reranking

• Counted number of trees in each forest before and after determinization

• 86.3% trees in forest are duplicates on average

• 1.4x1012 median per forest pre-determ

• 2.0x1011 median per forest post-determ

• Determinization changes top tree 77.6% of the time

• Crunching matches determinization 50.6% of the time

165

Monday, April 19, 2010

Page 266: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

xLNT not closed!

(Maletti, Graehl, Hopkins, Knight, ’09)

Cp

q

Cq

Dq D

An

p

Aq

Bp p

Bq

q

B

AB

B

B

BC

D BD

D

AB

B

C

D B

DD

CAt E

t t t

Bt

t

B

Dt D

EB

BD B

D

D

could be arbitrarily

long!

Monday, April 19, 2010

Page 267: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Closure Under Composition and Recognizability Preservation

closed forward recog

backward recog

wLNT wxLNT xT

wxLT

Monday, April 19, 2010

Page 268: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Where do the rules come from?

• Ideally we would add all possible rules

• To avoid overflow, we bootstrap with a previous (syntax-free) alignment model

• This follows a rich history in MT (Och & Ney ’00, Fraser & Marcu ‘06)

A

B C

D E

d e

c

f g h

=

103 possible rules

168

Monday, April 19, 2010

Page 269: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Practical Contribution II: Re-Alignment

Other approaches to this problem

• Cherry and Lin ‘06: Discriminatively train ITG-based alignment model influenced by dependency graph

• DeNero and Klein ‘07: HMM model modified to incorporate syntax penalty into distortion

• Fossum et al. ‘08: Identify troublesome links and remove them

169

Monday, April 19, 2010

Page 270: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Where do the rules come from?

(e-string, f-string)

IBMGIZA

bootstrap alignments

word pairs

170

Monday, April 19, 2010

Page 271: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Where do the rules come from?

(e-string, f-string)

IBMGIZA

bootstrap alignments

word pairs

rules

rule extraction (Galley et al. ‘04)

170

Monday, April 19, 2010

Page 272: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Where do the rules come from?

(e-string, f-string)

IBMGIZA

bootstrap alignments

word pairs

(e-tree, f-string)

syntaxTTT

final alignments

rules

rule extraction (Galley et al. ‘04)

170

Monday, April 19, 2010

Page 273: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

EM size bias

• EM attempts to learn derivations with highest probability.

• Shorter derivations have fewer chances to take a probability “hit” and are thus biased to be favored.

• This, then, tends to favor larger rules, generally the opposite of what we want.

R2R11

R12

R17

R18more useful

favored

RULE CORPUS

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP

taiwan

NNPR12:

NNPNPB

POS

‘s

NPBR11:

POSNPB

NPB

NNP

taiwan

R17:

POS

‘s

POSR18:NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NPB

NNP POS

taiwan ‘s

NPBR2:NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

171

Monday, April 19, 2010

Page 274: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Correcting size bias• When using a rule with n

non-leaf nodes, prepend n-1copies of a special size rule Sn

• Each competing derivation now has the same number of rules

• Size rules are built into the derivation forests and weights are learned by the same EM procedure

R2

R11

R12

R17

R18

S3

S3

S2 S2

RULE CORPUS

NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NNP

taiwan

NNPR12:

NNPNPB

POS

‘s

NPBR11:

POSNPB

NPB

NNP

taiwan

R17:

POS

‘s

POSR18:NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

NPB

NNP POS

taiwan ‘s

NPBR2:NP-C

NPB

NPB

NNP

taiwan

POS

’s

NN

surplus

PP

IN

in

NP-C

NPB

NN

trade

PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

TAIWAN IN TWO-SHORES TRADE MIDDLE SURPLUS

R1: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1 R10: NP-C

NPB

x0:NPB x1:NN

x2:PP

! x0 x2 x1

R2: NPB

NNP

taiwan

POS

’s

! R11: NPB

x0:NNP POS

’s

! x0 R17: NPB

NNP

taiwan

x0:POS

! x0

R12: NNP

taiwan

! R18: POS

’s

!

R3: PP

x0:IN x1:NP-C

! x0 x1 R13: PP

IN

in

x0:NP-C

! x0 R19: PP

IN

in

x0:NP-C

! x0

R4: IN

in

!

R5: NP-C

x0:NPB x1:PP

! x1 x0 R5: NP-C

x0:NPB x1:PP

! x1 x0 R20: NP-C

x0:NPB PP

x1:IN x2:NP-C

! x2 x0 x1

R6: PP

IN

between

NP-C

NPB

DT

the

CD

two

NNS

shores

! R14: PP

IN

between

x0:NP-C

! x0 R21: IN

between

!

R15: NP-C

x0:NPB

! x0 R15: NP-C

x0:NPB

! x0

R16: NPB

DT

the

CD

two

NNS

shores

! R22: NPB

x0:DT CD

two

x1:NNS

! x0 x1

R23: NNS

shores

! R24: DT

the

!

R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0 R7: NPB

x0:NN

! x0

R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

! R8: NN

trade

! R9: NN

surplus

!

Figure 2: A (English tree, Chinese string) pair and three different sets of multilevel tree-to-string rules thatcan explain it; the first set is obtained from bootstrap alignments, the second from this paper’s re-alignmentprocedure, and the third is a viable, if poor quality, alternative that is not learned.

172

Monday, April 19, 2010

Page 275: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Complexity Analysis

k-best (H&C) O(P+ Dmaxk log k) P = rtg rulesDmax = max deriv

determinization O(AkzL) A = alph sizek = max rank

z = max tree size L = lang size

rtg+xLNT O(RPl)R = trans rulesP = rtg rules

l = max trans lhs

xT+LNT O(RARBr)RA = xT rules

RB = LNT rulesr = max RA rhs

Monday, April 19, 2010

Page 276: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Dramatic use of size rules

S-C

NP-C

NPB

NNP

guangxi

POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

GUANGXI OUTSIDE-WORLD OPENING-UP

R24: S-C

NP-C

NPB

x0:NNP POS

’s

VP

VBG

opening

PRT

RP

up

PP

TO

to

NP-C

NPB

DT

the

JJ

outside

NN

world

! x0 R25: NNP

guangxi

!

R26: S-C

x0:NP-C x1:VP

! x0 x1 R15: NP-C

x0:NPB

! x0 R11: NPB

x0:NNP POS

’s

! x0 R27: VP

VBG

opening

PRT

RP

up

x0:PP

! x0

R28: PP

TO

to

x0:NP-C

! x0 R15: NP-C

x0:NPB

! x0 R29: NPB

DT

the

JJ

outside

NN

world

! R25: NNP

guangxi

!

Figure 3: The impact of a bad alignment on rule extraction. Including the alignment link indicated by the

dotted line in the example leads to the rule set in the second row. The re-alignment procedure described in

Section 3.2 learns to prefer the rule set at bottom, which omits the bad link.

1. A fertility y for each word ei in e is chosen

with probability pfert(y|ei).2. A null word is inserted next to each

fertility-expanded word with probability

pnull.

3. Each token ei in the fertility-expanded

word and null string is translated into

some foreign word fi in f with probability

ptrans(fi|ei).4. The position of each foreign word

fi that was translated from ei is

changed by ! (which may be posi-

tive, negative, or zero) with probability

pdistortion(!|A(ei),B(fi)), where A and

B are functions over the source and targetvocabularies, respectively.

Brown et al. (1993) describes an EM algorithm

for estimating values for the four tables in the gener-

ative story. However, searching the space of all pos-

sible alignments is intractable for EM, so in practice

the procedure is bootstrapped by models with nar-

rower search space such as IBM Model 1 (Brown et

al., 1993) or Aachen HMM (Vogel et al., 1996).

Rbad: S15

S15...

S15

} 14 times

Rbad

174

Monday, April 19, 2010

Page 277: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Approximate Algorithms

• linear-time approximate k-best

• polynomial time determinization that fails to recognize some trees in the input

• weighted domain projection with relative ordering, but not exact weights, preserved

• mildly incorrect fast composition

• on-the-fly tree-to-string backward application

175

Monday, April 19, 2010

Page 278: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Engineering

• Battle-test Tiburon implementations and bring it up to production level

• Make greater use of system on biological sequencing and financial systems analysis -- leads to more interesting algorithmic questions, different types of transducers

176

Monday, April 19, 2010

Page 279: Weighted Tree Automata and Transducers for Syntactic ...jonmay/pubs/defense.pdf · Also see summary: book chapter of Handbook of Weighted Automata (Knight & May ’08) 32 Monday,

Explore the limits of Tree Transducers

• Weighting scheme of Collins’ parsing model1 doesn’t fit well

• Very large tree transducers needed in syntax MT2

• Can these models be simplified and still retain their power? Or should different formalisms be used?

1: Collins, 1997 2: DeNeefe and Knight, 2009177

Monday, April 19, 2010