@inproceedings{knight-al-onaizan-1998-translation,
title = "Translation with finite-state devices",
author = "Knight, Kevin and
Al-Onaizan, Yaser",
editor = "Farwell, David and
Gerber, Laurie and
Hovy, Eduard",
booktitle = "Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers",
month = oct # " 28-31",
year = "1998",
address = "Langhorne, PA, USA",
publisher = "Springer",
url = "https://link.springer.com/chapter/10.1007/3-540-49478-2_38",
pages = "421--437",
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.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="knight-al-onaizan-1998-translation">
<titleInfo>
<title>Translation with finite-state devices</title>
</titleInfo>
<name type="personal">
<namePart type="given">Kevin</namePart>
<namePart type="family">Knight</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Yaser</namePart>
<namePart type="family">Al-Onaizan</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>1998-oct 28-31</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers</title>
</titleInfo>
<name type="personal">
<namePart type="given">David</namePart>
<namePart type="family">Farwell</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Laurie</namePart>
<namePart type="family">Gerber</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Eduard</namePart>
<namePart type="family">Hovy</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Springer</publisher>
<place>
<placeTerm type="text">Langhorne, PA, USA</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<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.</abstract>
<identifier type="citekey">knight-al-onaizan-1998-translation</identifier>
<location>
<url>https://link.springer.com/chapter/10.1007/3-540-49478-2_38</url>
</location>
<part>
<date>1998-oct 28-31</date>
<extent unit="page">
<start>421</start>
<end>437</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Translation with finite-state devices
%A Knight, Kevin
%A Al-Onaizan, Yaser
%Y Farwell, David
%Y Gerber, Laurie
%Y Hovy, Eduard
%S Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers
%D 1998
%8 oct 28 31
%I Springer
%C Langhorne, PA, USA
%F knight-al-onaizan-1998-translation
%X 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.
%U https://link.springer.com/chapter/10.1007/3-540-49478-2_38
%P 421-437
Markdown (Informal)
[Translation with finite-state devices](https://link.springer.com/chapter/10.1007/3-540-49478-2_38) (Knight & Al-Onaizan, AMTA 1998)
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.