Phrase-Based Models
Philipp Koehn
16 February 2016
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Motivation
1
• Word-Based Models translate words as atomic units
• Phrase-Based Models translate phrases as atomic units
• Advantages:
– many-to-many translation can handle non-compositional phrases
– use of local context in translation
– the more data, the longer phrases can be learned
• ”Standard Model”, used by Google Translate and others
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Phrase-Based Model
2
• Foreign input is segmented in phrases
• Each phrase is translated into English
• Phrases are reordered
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Phrase Translation Table
3
• Main knowledge source: table with phrase translations and their probabilities
• Example: phrase translations for natuerlich
Translation
of course
naturally
of course ,
, of course ,
Philipp Koehn
Probability φ(ē|f¯)
0.5
0.3
0.15
0.05
Machine Translation: Phrase-Based Models
16 February 2016
Real Example
4
• Phrase translations for den Vorschlag learned from the Europarl corpus:
English
the proposal
’s proposal
a proposal
the idea
this proposal
proposal
of the proposal
the proposals
–
–
–
–
φ(ē|f¯)
0.6227
0.1068
0.0341
0.0250
0.0227
0.0205
0.0159
0.0159
English
the suggestions
the proposed
the motion
the idea of
the proposal ,
its proposal
it
...
φ(ē|f¯)
0.0114
0.0114
0.0091
0.0091
0.0068
0.0068
0.0068
...
lexical variation (proposal vs suggestions)
morphological variation (proposal vs proposals)
included function words (the, a, ...)
noise (it)
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Linguistic Phrases?
5
• Model is not limited to linguistic phrases
(noun phrases, verb phrases, prepositional phrases, ...)
• Example non-linguistic phrase pair
spass am → fun with the
• Prior noun often helps with translation of preposition
• Experiments show that limitation to linguistic phrases hurts quality
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
6
modeling
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Noisy Channel Model
7
• We would like to integrate a language model
• Bayes rule
p(f |e) p(e)
argmaxe p(e|f ) = argmaxe
p(f )
= argmaxe p(f |e) p(e)
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Noisy Channel Model
8
• Applying Bayes rule also called noisy channel model
–
–
–
–
we observe a distorted message R (here: a foreign string f)
we have a model on how the message is distorted (here: translation model)
we have a model on what messages are probably (here: language model)
we want to recover the original message S (here: an English string e)
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
More Detail
9
• Bayes rule
ebest = argmaxe p(e|f )
= argmaxe p(f |e) pLM (e)
– translation model p(e|f )
– language model pLM (e)
• Decomposition of the translation model
p(f¯1I |ēI1 ) =
I
Y
φ(f¯i|ēi) d(starti − endi−1 − 1)
i=1
– phrase translation probability φ
– reordering probability d
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Distance-Based Reordering
10
d=-3
d=0
d=1
d=2
foreign
1 2 3
4 5
6
7
English
phrase
1
2
3
4
translates
1–3
6
4–5
7
movement
start at beginning
skip over 4–5
move back over 4–6
skip over 6
distance
0
+2
-3
+1
Scoring function: d(x) = α|x| — exponential with distance
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
11
training
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Learning a Phrase Translation Table
12
• Task: learn the model from a parallel corpus
• Three stages:
– word alignment: using IBM models or other method
– extraction of phrase pairs
– scoring phrase pairs
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
bleibt
13
haus
im
er
dass
,
aus
davon
geht
michael
Word Alignment
michael
assumes
that
he
will
stay
in
the
house
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
14
bleibt
haus
im
er
dass
,
aus
davon
geht
michael
Extracting Phrase Pairs
michael
assumes
that
he
will
stay
in
the
house
extract phrase pair consistent with word alignment:
assumes that / geht davon aus , dass
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Consistent
ok
violated
one
alignment
point outside
15
ok
unaligned
word is fine
All words of the phrase pair have to align to each other.
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Consistent
16
Phrase pair (ē, f¯) consistent with an alignment A, if all words f1, ..., fn in f¯ that
have alignment points in A have these with words e1, ..., en in ē and vice versa:
(ē, f¯) consistent with A ⇔
∀ei ∈ ē : (ei, fj ) ∈ A → fj ∈ f¯
AND ∀fj ∈ f¯ : (ei , fj ) ∈ A → ei ∈ ē
AND
Philipp Koehn
∃ei ∈ ē, fj ∈ f¯ : (ei, fj ) ∈ A
Machine Translation: Phrase-Based Models
16 February 2016
17
bleibt
haus
im
er
dass
,
aus
davon
geht
michael
Phrase Pair Extraction
michael
assumes
that
he
will
stay
in
the
house
Smallest phrase pairs:
michael — michael
assumes — geht davon aus / geht davon aus ,
that — dass / , dass
he — er
will stay — bleibt
in the — im
house — haus
unaligned words (here: German comma) lead to multiple translations
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
18
bleibt
haus
im
er
dass
,
aus
davon
geht
michael
Larger Phrase Pairs
michael
assumes
that
he
will
stay
in
the
house
michael assumes — michael geht davon aus / michael geht davon aus ,
assumes that — geht davon aus , dass ; assumes that he — geht davon aus , dass er
that he — dass er / , dass er ; in the house — im haus
michael assumes that — michael geht davon aus , dass
michael assumes that he — michael geht davon aus , dass er
michael assumes that he will stay in the house — michael geht davon aus , dass er im haus bleibt
assumes that he will stay in the house — geht davon aus , dass er im haus bleibt
that he will stay in the house — dass er im haus bleibt ; dass er im haus bleibt ,
he will stay in the house — er im haus bleibt ; will stay in the house — im haus bleibt
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Scoring Phrase Translations
19
• Phrase pair extraction: collect all phrase pairs from the data
• Phrase pair scoring: assign probabilities to phrase translations
• Score by relative frequency:
count(ē, f¯)
¯
φ(f |ē) = P
¯
f¯i count(ē, fi )
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
EM Training of the Phrase Model
20
• We presented a heuristic set-up to build phrase translation table
(word alignment, phrase extraction, phrase scoring)
• Alternative: align phrase pairs directly with EM algorithm
– initialization: uniform model, all φ(ē, f¯) are the same
– expectation step:
∗ estimate likelihood of all possible phrase alignments for all sentence pairs
– maximization step:
∗ collect counts for phrase pairs (ē, f¯), weighted by alignment probability
∗ update phrase translation probabilties p(ē, f¯)
• However: method easily overfits
(learns very large phrase pairs, spanning entire sentences)
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Size of the Phrase Table
21
• Phrase translation table typically bigger than corpus
... even with limits on phrase lengths (e.g., max 7 words)
→ Too big to store in memory?
• Solution for training
– extract to disk, sort, construct for one source phrase at a time
• Solutions for decoding
– on-disk data structures with index for quick look-ups
– suffix arrays to create phrase pairs on demand
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
22
advanced modeling
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Weighted Model
23
• Described standard model consists of three sub-models
– phrase translation model φ(f¯|ē)
– reordering model d
– language model pLM (e)
ebest = argmaxe
I
Y
φ(f¯i|ēi) d(starti − endi−1 − 1)
i=1
|e|
Y
pLM (ei|e1...ei−1)
i=1
• Some sub-models may be more important than others
• Add weights λφ, λd, λLM
ebest = argmaxe
I
Y
φ(f¯i|ēi)λφ d(starti − endi−1 − 1)λd
i=1
Philipp Koehn
|e|
Y
pLM (ei|e1...ei−1)λLM
i=1
Machine Translation: Phrase-Based Models
16 February 2016
Log-Linear Model
24
• Such a weighted model is a log-linear model:
p(x) = exp
n
X
λihi(x)
i=1
• Our feature functions
–
–
–
–
–
number of feature function n = 3
random variable x = (e, f, start, end)
feature function h1 = log φ
feature function h2 = log d
feature function h3 = log pLM
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Weighted Model as Log-Linear Model
p(e, a|f ) = exp(λφ
I
X
25
log φ(f¯i|ēi)+
i=1
λd
I
X
log d(ai − bi−1 − 1)+
i=1
λLM
|e|
X
log pLM (ei|e1...ei−1))
i=1
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
More Feature Functions
26
• Bidirectional alignment probabilities: φ(ē|f¯) and φ(f¯|ē)
• Rare phrase pairs have unreliable phrase translation probability estimates
NULL
aus
davon
nicht
geht
→ lexical weighting with word translation probabilities
does
not
assume
lex(ē|f¯, a) =
length
Y (ē)
i=1
Philipp Koehn
X
1
w(ei|fj )
|{j|(i, j) ∈ a}|
∀(i,j)∈a
Machine Translation: Phrase-Based Models
16 February 2016
More Feature Functions
27
• Language model has a bias towards short translations
→ word count: wc(e) = log |e|ω
• We may prefer finer or coarser segmentation
→ phrase count pc(e) = log |I|ρ
• Multiple language models
• Multiple translation models
• Other knowledge sources
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
28
reordering
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Lexicalized Reordering
29
• Distance-based reordering model is weak
→ learn reordering preference for each phrase pair
• Three orientations types: (m) monotone, (s) swap, (d) discontinuous
orientation ∈ {m, s, d}
po(orientation|f¯, ē)
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Learning Lexicalized Reordering
?
30
?
• Collect orientation information during phrase pair extraction
– if word alignment point to the top left exists → monotone
– if a word alignment point to the top right exists→ swap
– if neither a word alignment point to top left nor to the top right exists
→ neither monotone nor swap → discontinuous
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Learning Lexicalized Reordering
31
• Estimation by relative frequency
¯
P P
po(orientation) =
f¯
ē count(orientation, ē, f )
P P P
o
f¯
¯
ē count(o, ē, f )
• Smoothing with unlexicalized orientation model p(orientation) to avoid zero
probabilities for unseen orientations
σ p(orientation) + count(orientation, ē, f¯)
¯
P
po(orientation|f , ē) =
σ + o count(o, ē, f¯)
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
32
operation sequence model
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
A Critique: Phrase Segmentation is Arbitrary33
• If multiple segmentations possible - why chose one over the other?
spass am
spiel vs. spass
am spiel
• When choose larger phrase pairs or multiple shorter phrase pairs?
spass am
spiel vs. spass
am
spiel vs. spass am spiel
• None of this has been properly addressed
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
34
A Critique: Strong Independence Assumptions
• Lexical context considered only within phrase pairs
spass am → fun with
• No context considered between phrase pairs
? spass am ? → ? fun with ?
• Some phrasal context considered in lexicalized reordering model
... but not based on the identity of neighboring phrases
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Segmentation? Minimal Phrase Pairs
natürlich
of course
hat
John
John
has
Spaß am
35
Spiel
fun with the
game
Spaß
Spiel
⇓
natürlich
of course
Philipp Koehn
hat
John
John
has
fun
am
with the
Machine Translation: Phrase-Based Models
game
16 February 2016
Independence?
Consider Sequence of Operations
o1
Generate(natürlich, of course)
o2
o3
o4
o5
o6
Insert Gap
Generate (John, John)
Jump Back (1)
Generate (hat, has)
Jump Forward
o7
Generate(natürlich, of course)
o8
o9
o10
Generate(am, with)
GenerateTargetOnly(the)
Generate(Spiel, game)
Philipp Koehn
36
natürlich ↓
of course
natürlich ↓
John
of course John
natürlich hat ↓ John
of course John has
natürlich hat John ↓
of course John has
natürlich hat John Spaß ↓
of course John has fun
natürlich hat John Spaß am ↓
of course John has fun with the
natürlich hat John Spaß am Spiel ↓
of course John has fun with the game
Machine Translation: Phrase-Based Models
16 February 2016
Operation Sequence Model
37
• Operations
–
–
–
–
–
–
generate (phrase translation)
generate target only
generate source only
insert gap
jump back
jump forward
• N-gram sequence model over operations, e.g., 5-gram model:
p(o1) p(o2|o1) p(o3|o1, o2) ... p(o10|o6, o7, o8, o9)
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
In Practice
38
• Operation Sequence Model used as additional feature function
• Significant improvements over phrase-based baseline
→ State-of-the-art systems include such a model
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016
Summary
39
• Phrase Model
• Training the model
–
–
–
–
word alignment
phrase pair extraction
phrase pair scoring
EM training of the phrase model
• Log linear model
– sub-models as feature functions
– lexical weighting
– word and phrase count features
• Lexicalized reordering model
• Operation sequence model
Philipp Koehn
Machine Translation: Phrase-Based Models
16 February 2016