Example 0 1 2 3 4 das Haus ist klein NULL 1 3 4 2 Start with a foreign sentence and a target length. Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL the 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL the 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL the house 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL the house 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL the house is 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL the house is 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL the house is small 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL the 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL the 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL house the 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL house the 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL house the is 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL house the is 1 3 4 2 Thursday, January 24, 13
Example 0 1 2 3 4 das Haus ist klein NULL house the is small 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment a ⇤ = arg a 2 [0 , 1 ,...,n ] m p ( a | e , f ) max p ( e , a | f ) = arg max a 0 p ( e , a 0 | f ) P a 2 [0 , 1 ,...,n ] m = arg a 2 [0 , 1 ,...,n ] m p ( e , a | f ) max 1 n a ∗ i = arg max 1 + np ( e i | f a i ) a i =0 n = arg max a i =0 p ( e i | f a i ) Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Finding the Viterbi Alignment 0 1 2 3 4 das Haus ist klein NULL the home is little 1 3 4 2 Thursday, January 24, 13
Learning Lexical Translation Models • How do we learn the parameters p ( e | f ) • “Chicken and egg” problem • If we had the alignments, we could estimate the parameters (MLE) • If we had parameters, we could find the most likely alignments Thursday, January 24, 13
EM Algorithm • pick some random (or uniform) parameters • Repeat until you get bored (~ 5 iterations for lexical translation models) • using your current parameters, compute “expected” alignments for every target word token in the training data (on board) p ( a i | e , f ) • keep track of the expected number of times f translates into e throughout the whole corpus • keep track of the expected number of times that f is used as the source of any translation • use these expected counts as if they were “real” counts in the standard MLE equation Thursday, January 24, 13
EM for Model 1 Thursday, January 24, 13
EM for Model 1 Thursday, January 24, 13
EM for Model 1 Thursday, January 24, 13
EM for Model 1 Thursday, January 24, 13
EM for Model 1 Thursday, January 24, 13
Convergence Thursday, January 24, 13
Evaluation • Since we have a probabilistic model, we can evaluate perplexity . 1 ( e , f ) ∈ D | e | log Q ( e , f ) ∈ D p ( e | f ) − P PPL = 2 Iter ∞ Iter 1 Iter 2 Iter 3 Iter 4 ... -log likelihood - 7.66 7.21 6.84 ... -6 perplexity - 2.42 2.30 2.21 ... 2 Thursday, January 24, 13
Alignment Error Rate Thursday, January 24, 13
Alignment Error Rate Possible links P Thursday, January 24, 13
Alignment Error Rate Possible links P Thursday, January 24, 13
Alignment Error Rate Possible links Sure links S P Thursday, January 24, 13
Alignment Error Rate Possible links Sure links S P Thursday, January 24, 13
Alignment Error Rate Possible links Sure links S P Precision( A, P ) = | P ∩ A | | A | Thursday, January 24, 13
Alignment Error Rate Possible links Sure links S P Precision( A, P ) = | P ∩ A | Recall( A, S ) = | S ∩ A | | A | | S | Thursday, January 24, 13
Recommend
More recommend