Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network

Gregor Leusch, Evgeny Matusov, Hermann Ney


Anthology ID:
D08-1088
Volume:
Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing
Month:
October
Year:
2008
Address:
Honolulu, Hawaii
Editors:
Mirella Lapata, Hwee Tou Ng
Venue:
EMNLP
SIG:
SIGDAT
Publisher:
Association for Computational Linguistics
Note:
Pages:
839–847
Language:
URL:
https://aclanthology.org/D08-1088
DOI:
Bibkey:
Cite (ACL):
Gregor Leusch, Evgeny Matusov, and Hermann Ney. 2008. Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network. In Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing, pages 839–847, Honolulu, Hawaii. Association for Computational Linguistics.
Cite (Informal):
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network (Leusch et al., EMNLP 2008)
Copy Citation:
PDF:
https://aclanthology.org/D08-1088.pdf