Translation with finite-state devices

Kevin Knight, Yaser Al-Onaizan


Abstract
Statistical models have recently been applied to machine translation with interesting results. Algorithms for processing these models have not received wide circulation, however. By contrast, general finite-state transduction algorithms have been applied in a variety of tasks. This paper gives a finite-state reconstruction of statistical translation and demonstrates the use of standard tools to compute statistically likely translations. Ours is the first translation algorithm for “fertility/permutation” statistical models to be described in replicable detail.
Anthology ID:
1998.amta-papers.37
Volume:
Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers
Month:
October 28-31
Year:
1998
Address:
Langhorne, PA, USA
Editors:
David Farwell, Laurie Gerber, Eduard Hovy
Venue:
AMTA
SIG:
Publisher:
Springer
Note:
Pages:
421–437
Language:
URL:
https://link.springer.com/chapter/10.1007/3-540-49478-2_38
DOI:
Bibkey:
Cite (ACL):
Kevin Knight and Yaser Al-Onaizan. 1998. Translation with finite-state devices. In Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers, pages 421–437, Langhorne, PA, USA. Springer.
Cite (Informal):
Translation with finite-state devices (Knight & Al-Onaizan, AMTA 1998)
Copy Citation:
PDF:
https://link.springer.com/chapter/10.1007/3-540-49478-2_38