Experiments ( Section 5 ) show that forestbased extraction improves BLEU score by over 1 point on a state-of-the-art tree-to-string system ( Liu et al. , 2006 ; Mi et al. , 2008 ) , which is also 0.5 points better than ( and twice as fast as ) extracting on 30-best parses .
forestbased translation
Haitao Mi Liang Huang Qun Liu
We instead propose a novel approach that extracts rules from packed forests ( Section 3 ) , which compactly encodes many more alternatives than kbest lists . Experiments ( Section 5 ) show that forestbased extraction improves BLEU score by over 1 point on a state-of-the-art tree-to-string system ( Liu et al. , 2006 ; Mi et al. , 2008 ) , which is also 0.5 points better than ( and twice as fast as ) extracting on 30-best parses . When combined with our previous orthogonal work on forest-based decoding ( Mi et al. , 2008 ) , the forest-forest approach achieves a 2.5 BLEU points improvement over the baseline , and even outperforms the hierarchical system of Hiero , one of the best-performing systems to date .
Experiments ( Section 5 ) show that forestbased extraction improves BLEU score by over 1 point on a state-of-the-art tree-to-string system ( Liu et al. , 2006 ; @@CITATION ) , which is also 0.5 points better than ( and twice as fast as ) extracting on 30-best parses .