#9825In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency insertion grammar.Synchronous dependency insertion grammars are a version of synchronous grammars defined on dependency trees.
lr,11-4-P05-1067,ak
inducing such a
<term>
grammar
</term>
from
<term>
parallel corpora
</term>
. Second , we describe the
<term>
graphical
#9851We first introduce our approach to inducing such a grammar fromparallel corpora.
lr,12-3-P05-1067,ak
synchronous grammars
</term>
defined on
<term>
dependency trees
</term>
. We first introduce our approach
#9837Synchronous dependency insertion grammars are a version of synchronous grammars defined ondependency trees.
#9788Experimental results show that our approach improves domain-specific word alignment in terms of both precision and recall, achieving a relative error rate reduction of 6.56% as compared with the state-of-the-art technologies.Syntax-based statistical machine translation ( MT ) aims at applying statistical models to structured data.
tech,20-5-P05-1067,ak
</term>
, which can also be viewed as a
<term>
stochastic tree-to-tree transducer
</term>
. We introduce a
<term>
polynomial
#9874Second, we describe the graphical model for the machine translation task, which can also be viewed as astochastic tree-to-tree transducer.
tech,3-6-P05-1067,ak
transducer
</term>
. We introduce a
<term>
polynomial time decoding algorithm
</term>
for the
<term>
model
</term>
. We evaluate
#9881We introduce apolynomial time decoding algorithm for the model.
tech,6-7-P05-1067,ak
</term>
. We evaluate the outputs of our
<term>
MT system
</term>
using the
<term>
NIST
</term>
and
<term>
#9895We evaluate the outputs of ourMT system using the NIST and Bleu automatic MT evaluation software.
tech,7-2-P05-1067,ak
</term>
. In this paper , we present a
<term>
syntax-based statistical machine translation system
</term>
based on a
<term>
probabilistic synchronous
#9811In this paper, we present asyntax-based statistical machine translation system based on a probabilistic synchronous dependency insertion grammar.