D08-1076 BLEU score . A weakness of the Downhill Simplex algorithm is , however , its decreasing
W06-3108 Equation 2 are optimized using the Downhill Simplex algorithm . The feature weights of the
D10-1059 optimize the N-best lists using the Downhill Simplex Algorithm ( Press , 2007 ) . But the Downhill
W11-2119 was shown to be unstable with downhill simplex algorithm . Instead , an N-best list based
J07-1003 the development corpus using the Downhill Simplex algorithm . This combination using the
N10-1129 parameters , we run MERT with the Downhill Simplex algorithm on the MT04 dataset . For all
N04-1033 to ( Och , 2003 ) . We use the Downhill Simplex algorithm from ( Press et al. , 2002 )
J07-1003 the development corpus using the Downhill Simplex algorithm ( Press et al. 2002 ) . With
W10-1711 optimized similar to MERT using the Downhill Simplex algorithm . As the objective function for
J07-1003 BLEU . This is done using the Downhill Simplex algorithm ( Press et al. 2002 ) . The resulting
J07-1003 set is achieved . Again , the Downhill Simplex algorithm is used for optimization . •
W07-0705 optimization algorithm like the downhill simplex algorithm ( Press et al. , 2002 ) . The
D08-1076 optimized on N-best lists using the Downhill Simplex algorithm ( Press et al. , 2007 , p. 503
W06-3110 the development set using the Downhill Simplex algorithm ( Press et al. , 2002 ) . As
D10-1059 Algorithm ( Press , 2007 ) . But the Downhill Simplex Algorithm loses its robustness as the dimension
W12-6219 of using Powell 's method , the Downhill Simplex algorithm ( Press et al. , 2002 ) can be
W06-3108 2002 evaluation set using the Downhill Simplex algorithm ( Press et al. , 2002 ) . Note
W12-3104 the second one is the use of the downhill simplex algorithm to tune the weights for the components
W08-0406 parameters . This was done using the Downhill Simplex algorithm . In total , 1,137,088 sentences
N04-1033 . In the experi - ments , the Downhill Simplex algorithm converged after about 200 iterations
hide detail