@inproceedings{garcia-varea-casacuberta-2001-search,
title = "Search algorithms for statistical machine translation based on dynamic programming and pruning techniques",
author = "Garc{\'\i}a-Varea, Ismael and
Casacuberta, Francisco",
editor = "Maegaard, Bente",
booktitle = "Proceedings of Machine Translation Summit VIII",
month = sep # " 18-22",
year = "2001",
address = "Santiago de Compostela, Spain",
url = "https://aclanthology.org/2001.mtsummit-papers.22",
abstract = "The increasing interest in the statistical approach to Machine Translation is due to the development of effective algorithms for training the probabilistic models proposed so far. However, one of the open problems with statistical machine translation is the design of efficient algorithms for translating a given input string. For some interesting models, only (good) approximate solutions can be found. Recently, a dynamic programming-like algorithm for the IBM-Model 2 has been proposed which is based on an iterative process of refinement solutions. A new dynamic programming-like algorithm is proposed here to deal with more complex IBM models (models 3 to 5). The computational cost of the algorithm is reduced by using an alignment-based pruning technique. Experimental results with the so-called {``}Tourist Task{''} are also presented.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="garcia-varea-casacuberta-2001-search">
<titleInfo>
<title>Search algorithms for statistical machine translation based on dynamic programming and pruning techniques</title>
</titleInfo>
<name type="personal">
<namePart type="given">Ismael</namePart>
<namePart type="family">García-Varea</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Francisco</namePart>
<namePart type="family">Casacuberta</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2001-sep 18-22</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of Machine Translation Summit VIII</title>
</titleInfo>
<name type="personal">
<namePart type="given">Bente</namePart>
<namePart type="family">Maegaard</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<place>
<placeTerm type="text">Santiago de Compostela, Spain</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>The increasing interest in the statistical approach to Machine Translation is due to the development of effective algorithms for training the probabilistic models proposed so far. However, one of the open problems with statistical machine translation is the design of efficient algorithms for translating a given input string. For some interesting models, only (good) approximate solutions can be found. Recently, a dynamic programming-like algorithm for the IBM-Model 2 has been proposed which is based on an iterative process of refinement solutions. A new dynamic programming-like algorithm is proposed here to deal with more complex IBM models (models 3 to 5). The computational cost of the algorithm is reduced by using an alignment-based pruning technique. Experimental results with the so-called “Tourist Task” are also presented.</abstract>
<identifier type="citekey">garcia-varea-casacuberta-2001-search</identifier>
<location>
<url>https://aclanthology.org/2001.mtsummit-papers.22</url>
</location>
<part>
<date>2001-sep 18-22</date>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Search algorithms for statistical machine translation based on dynamic programming and pruning techniques
%A García-Varea, Ismael
%A Casacuberta, Francisco
%Y Maegaard, Bente
%S Proceedings of Machine Translation Summit VIII
%D 2001
%8 sep 18 22
%C Santiago de Compostela, Spain
%F garcia-varea-casacuberta-2001-search
%X The increasing interest in the statistical approach to Machine Translation is due to the development of effective algorithms for training the probabilistic models proposed so far. However, one of the open problems with statistical machine translation is the design of efficient algorithms for translating a given input string. For some interesting models, only (good) approximate solutions can be found. Recently, a dynamic programming-like algorithm for the IBM-Model 2 has been proposed which is based on an iterative process of refinement solutions. A new dynamic programming-like algorithm is proposed here to deal with more complex IBM models (models 3 to 5). The computational cost of the algorithm is reduced by using an alignment-based pruning technique. Experimental results with the so-called “Tourist Task” are also presented.
%U https://aclanthology.org/2001.mtsummit-papers.22
Markdown (Informal)
[Search algorithms for statistical machine translation based on dynamic programming and pruning techniques](https://aclanthology.org/2001.mtsummit-papers.22) (García-Varea & Casacuberta, MTSummit 2001)
ACL