Faster MT decoding through pervasive laziness

5Citations
Citations of this article
77Readers
Mendeley users who have this article in their library.

Abstract

Syntax-based MT systems have proven effective—the models are compelling and show good room for improvement. However, decoding involves a slow search. We present a new lazy-search method that obtains significant speedups over a strong baseline, with no loss in Bleu.

Cite

CITATION STYLE

APA

Pust, M., & Knight, K. (2009). Faster MT decoding through pervasive laziness. In NAACL-HLT 2009 - Human Language Technologies: 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Short Papers (pp. 141–144). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1620853.1620893

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free