alignment model 0.00290454
agreement model 0.002354989
word alignment 0.0023437600000000003
ibm model 0.00229911
model score 0.002295172
bidirectional model 0.0022354560000000002
markov model 0.002210745
decoding model 0.002201223
tional model 0.0021669230000000003
generative model 0.002159306
model accuracy 0.002122994
discriminative model 0.002121122
model combiner 0.002101906
model 0.00187118
alignment models 0.001850662
alignment problem 0.0018069380000000001
word alignments 0.001734179
directional word 0.001678146
common word 0.001624588
null word 0.0015984319999999999
single word 0.0015967429999999999
word aligners 0.001574017
word align 0.00155036
bilingual alignment 0.0015496960000000001
accurate word 0.001546722
hmm alignment 0.001461735
new algorithm 0.0014540760000000001
relaxation algorithm 0.0014438130000000002
alignment pair 0.001406866
alignment problems 0.0014015050000000002
directional alignment 0.001401106
bidirectional alignment 0.001397636
example alignment 0.0013963200000000002
alignment decoding 0.001363403
alignment pairs 0.0013555910000000002
bidirectional algorithm 0.001351067
alignment error 0.0013492950000000001
viterbi algorithm 0.0013425330000000001
optimal alignment 0.001342209
previous algorithm 0.001339085
tional alignment 0.001329103
alignment phrase 0.001325364
single alignment 0.0013197030000000002
last alignment 0.00131364
feasible alignment 0.001307856
alignment scores 0.001294648
greedy algorithm 0.001293532
alignment accuracy 0.001285174
reverse alignment 0.0012811060000000002
rectional alignment 0.0012751540000000001
comparable alignment 0.0012743630000000001
subgradient algorithm 0.001268933
decomposition algorithm 0.0012673
extraction algorithm 0.001264197
combiner alignment 0.0012640860000000002
strained alignment 0.001262607
agreement problem 0.001257387
hmm models 0.001245677
new problem 0.001240863
iterative algorithm 0.001216889
agreement constraints 0.001189205
directional models 0.001185048
bidirectional models 0.001181578
new constraints 0.001172681
original problem 0.001144947
first set 0.001119493
optimization problem 0.001114301
tional models 0.001113045
decoding problem 0.001103621
ment models 0.001092473
learning method 0.001087146
original constraints 0.001076765
first step 0.0010726590000000001
rectional models 0.001059096
possible hmm 0.00104425
salesman problem 0.00104096
original constraint 0.0010348
alignment 0.00103336
combinatorial problem 0.001029711
additional constraints 0.001025044
linear function 0.0010136709999999998
posterior probability 0.001013498
problem argmax 0.001007764
timization problem 0.001006044
forward constraints 0.0010019739999999999
same relaxation 9.96631E-4
algorithm 9.86791E-4
objective function 9.83454E-4
additional constraint 9.83079E-4
adjacency constraints 9.78002E-4
ward constraints 9.59486E-4
training time 9.48386E-4
incremental constraints 9.44985E-4
active constraints 9.38203E-4
back constraints 9.359339999999999E-4
new relaxation 9.243070000000001E-4
previous work 9.173270000000001E-4
sentence pair 9.10511E-4
possible penalty 9.050589999999999E-4
incremental constraint 9.0302E-4
