tatistical 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.
CITATION STYLE
Knight, K., & Al-Onaizan, Y. (1998). Translation with finite-state devices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1529, pp. 421–437). Springer Verlag. https://doi.org/10.1007/3-540-49478-2_38
Mendeley helps you to discover research relevant for your work.