tree algorithm 0.0018493569999999998
formal algorithm 0.0017560879999999998
model problem 0.0017555130000000002
algorithm sibling 0.001735845
subgradient algorithm 0.001723992
decomposition algorithm 0.00172185
language model 0.001691325
algorithm run 0.001683635
fractional algorithm 0.001682359
tagging model 0.0016408400000000002
models example 0.001599426
parsing model 0.0015791020000000002
alignment models 0.0015110289999999999
sibling model 0.0014774950000000001
model structure 0.001419773
full model 0.001419108
hmm models 0.0013986509999999999
trained model 0.001394017
model difficulty 0.0013900030000000001
generative model 0.00138916
other methods 0.0013890270000000001
algorithm 0.00138606
mrf model 0.001383562
approximate models 0.001379302
sibling models 0.001375865
variational models 0.001334215
complex models 0.0013137259999999999
separate models 0.001306124
dual problem 0.00130053
dual optimization 0.001245802
decoding problem 0.001212085
constraints example 0.0012067480000000001
optimization problem 0.001200878
translation problem 0.0011655060000000002
guarantees method 0.001162916
bigram constraints 0.001154923
decoding methods 0.001147192
english word 0.00113304
dual value 0.001130526
optimal solution 0.0011303250000000002
model 0.00112771
head word 0.0011263100000000002
word alignments 0.0011198900000000001
word types 0.001116439
alignment problem 0.001112752
simple solution 0.001111061
translation example 0.001111049
word tags 0.001102834
parsing problem 0.001079195
word type 0.001077359
dual solutions 0.001070224
french word 0.00106616
parent word 0.0010631150000000001
subgradient method 0.0010625180000000001
tag sequence 0.001062063
exact solution 0.0010616970000000001
alignment example 0.001058295
exact decoding 0.001051206
dual lagrangian 0.001036409
models 0.00102608
translation alignment 0.001022652
single bigram 0.0010194380000000001
dual subgradient 0.0010106590000000001
dual decomposition 0.001008517
optimal value 9.93351E-4
search space 9.74612E-4
tree dynamic 9.71072E-4
original problem 9.66996E-4
dynamic programming 9.66691E-4
valid tag 9.663370000000001E-4
solution weights 9.6488E-4
same tag 9.591230000000001E-4
pos tag 9.54079E-4
tag labels 9.518790000000001E-4
combinatorial constraints 9.50956E-4
approximate solution 9.479950000000001E-4
constraints notation 9.45607E-4
function 9.41013E-4
constraints strategy 9.3885E-4
possible assignments 9.37879E-4
approximate decoding 9.37504E-4
dual relationship 9.350280000000001E-4
dual change 9.3443E-4
optimal solutions 9.33049E-4
linear programming 9.29377E-4
beam search 9.24156E-4
similar algorithms 9.21277E-4
soft constraints 9.140420000000001E-4
tagging assumption 9.11853E-4
similar assumption 9.09172E-4
tag sequences 9.075320000000001E-4
parse example 9.069729999999999E-4
syntactic translation 9.06764E-4
bigram constraint 9.063650000000001E-4
search theorem 9.05312E-4
dependency parsing 9.04579E-4
decoding notation 8.964870000000001E-4
same time 8.954760000000001E-4
agreement example 8.92241E-4
fractional solution 8.91072E-4
