time function 0.001710503
other rules 0.0016380729999999999
translation models 0.001619314
synchronous rule 0.001584987
grammar rules 0.001571241
permutation tree 0.001518031
input rule 0.001507798
general algorithm 0.001488896
synchronous rules 0.00147809
translation relation 0.0014519339999999998
single rule 0.001431797
rule size 0.0013875720000000001
several rules 0.0013690439999999998
translation schemata 0.0013405989999999998
mergesort algorithm 0.001338615
time complexity 0.00131258
scfg rules 0.001307052
original rule 0.0013002930000000001
factorization algorithm 0.001299676
rule cor 0.0012914620000000002
ming algorithm 0.001286878
linear time 0.00128644
algorithm checks 0.001285925
ization algorithm 0.001285925
tion tree 0.0012770379999999999
new grammar 0.001250643
binary rules 0.001245865
output tree 0.001218887
next figure 0.001206018
mutation tree 0.00118455
chronous rules 0.001182888
quadratic time 0.001182609
time complexities 0.001168734
tion problem 0.0011216289999999999
input permutation 0.001106883
open problem 0.001105582
first horizontal 0.00108571
translation 0.00108294
function merge 0.001073589
same boundaries 0.0010697480000000001
string pairs 0.001069188
such strings 0.001063854
function karize 0.001062031
function reduce 0.001059496
function scan 0.001053412
internal node 0.00104537
same length 0.00104082
general case 0.001031974
algorithm 0.00102962
target permutation 0.001027868
same type 0.001025299
other alternatives 0.0010144260000000001
permutation trees 0.001007762
equivalent grammar 0.001003061
new reduction 0.001002049
previous work 9.99881E-4
synchronous pair 9.97297E-4
example permutation 9.961710000000001E-4
synchronous strings 9.85103E-4
possible length 9.83838E-4
same analysis 9.73794E-4
previous iteration 9.717040000000001E-4
right boundary 9.70327E-4
previous reduction 9.70088E-4
previous results 9.488370000000001E-4
such factorization 9.452290000000001E-4
grammar nonter 9.44664E-4
input scfg 9.44617E-4
above idea 9.39308E-4
permutation matrix 9.34611E-4
new items 9.30001E-4
entire permutation 9.26479E-4
previous value 9.187520000000001E-4
parsing strategy 9.17393E-4
correct permutation 9.12324E-4
equivalent set 9.10004E-4
further reduction 9.0787E-4
subsequence permutation 9.04529E-4
original permutation 8.993779999999999E-4
next iteration 8.89719E-4
next reduction 8.88103E-4
new subtree 8.85671E-4
rules 8.81668E-4
new subsequence 8.77949E-4
left boundary 8.774970000000001E-4
possible arity 8.76277E-4
possible configurations 8.739329999999999E-4
synchronous cfg 8.72244E-4
single step 8.702860000000001E-4
phrase alignments 8.64849E-4
current boundaries 8.587530000000001E-4
entire input 8.58062E-4
computational complexity 8.554120000000001E-4
reduction test 8.522499999999999E-4
top boundary 8.51411E-4
synchronous cfgs 8.50242E-4
optimal parsing 8.427509999999999E-4
starting permutation 8.41781E-4
internal nodes 8.39417E-4
right boundaries 8.38959E-4
