This paper proposes a nonparametric Bayesian method for inducing Part-of-Speech (POS) tags in dependency trees to improve the performance of statistical machine translation (SMT). In particular, we extend the monolingual infinite tree model (Finkel et al., 2007) to a bilin-gual scenario: each hidden state (POS tag) of a source-side dependency tree emits a source word together with its aligned tar-get word, either jointly (joint model), or independently (independent model). Eval-uations of Japanese-to-English translation on the NTCIR-9 data show that our in-duced Japanese POS tags for dependency trees improve the performance of a forest-to-string SMT system. Our independent model gains over 1 point in BLEU by re-solving the sparseness proble...
If languages does not vary in arbitrary ways [2], we can expect data in any language to prove helpfu...
We describe our experiments with training algorithms for tree-to-tree synchronous tree-substitution ...
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for p...
We present a translation model based on dependency trees. The model adopts a tree to string approach...
This thesis addresses the use of Probabilistic Synchronous Dependency Insertion Grammars (PSDIG) for...
In the formally syntax-based MT, a hierar-chical tree generated by synchronous CFG rules associates ...
In this thesis, we take a statistical tree-to-tree approach to solving the problem of machine transl...
2011-10-27Machine Translation (MT) is the task of translating a document from a source language (e.g...
Increasingly, researchers developing statistical machine translation systems have moved to incorpora...
In this thesis, we take a statistical tree-to-tree approach to solving the problem of machine transl...
We describe a novel approach for syntaxbased statistical MT, which builds on a variant of tree adjoi...
The article describes a method that enhances translation performance of language pairs with a less u...
We describe a novel approach for syntax-based statistical MT, which builds on a variant of tree adjo...
This paper describes a novel model using dependency structures on the source side for syntax-based s...
Tree based translation models are a com-pelling means of integrating linguistic in-formation into ma...
If languages does not vary in arbitrary ways [2], we can expect data in any language to prove helpfu...
We describe our experiments with training algorithms for tree-to-tree synchronous tree-substitution ...
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for p...
We present a translation model based on dependency trees. The model adopts a tree to string approach...
This thesis addresses the use of Probabilistic Synchronous Dependency Insertion Grammars (PSDIG) for...
In the formally syntax-based MT, a hierar-chical tree generated by synchronous CFG rules associates ...
In this thesis, we take a statistical tree-to-tree approach to solving the problem of machine transl...
2011-10-27Machine Translation (MT) is the task of translating a document from a source language (e.g...
Increasingly, researchers developing statistical machine translation systems have moved to incorpora...
In this thesis, we take a statistical tree-to-tree approach to solving the problem of machine transl...
We describe a novel approach for syntaxbased statistical MT, which builds on a variant of tree adjoi...
The article describes a method that enhances translation performance of language pairs with a less u...
We describe a novel approach for syntax-based statistical MT, which builds on a variant of tree adjo...
This paper describes a novel model using dependency structures on the source side for syntax-based s...
Tree based translation models are a com-pelling means of integrating linguistic in-formation into ma...
If languages does not vary in arbitrary ways [2], we can expect data in any language to prove helpfu...
We describe our experiments with training algorithms for tree-to-tree synchronous tree-substitution ...
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for p...