Sciweavers

Share
NAACL
2007

Are Very Large N-Best Lists Useful for SMT?

9 years 1 months ago
Are Very Large N-Best Lists Useful for SMT?
This paper describes an efficient method to extract large n-best lists from a word graph produced by a statistical machine translation system. The extraction is based on the k shortest paths algorithm which is efficient even for very large k. We show that, although we can generate large amounts of distinct translation hypotheses, these numerous candidates are not able to significantly improve overall system performance. We conclude that large n-best lists would benefit from better discriminating models.
Sasa Hasan, Richard Zens, Hermann Ney
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2007
Where NAACL
Authors Sasa Hasan, Richard Zens, Hermann Ney
Comments (0)
books