Chinese Academy of Sciences

This paper proposes a well-formed depen-dency to string translation model with BTG grammar. By enabling the usage of well-formed sub-structures and allowing flexible reordering of them, our approach is effective to relieve the problems of parsing error and flatness in dependency structure. To utilize the well-formed dependency rules during decod-ing, we adapt the tree traversal decoding algo-rithm into a bottom-up CKY algorithm. And a lexicalized reordering model is used to en-courage the proper combination of two neigh-bouring blocks. Experiment results demon-strate that our approach can effectively im-prove the performance by more than 2 BLEU score over the baseline.