Recent research has shown clear improvement in translation quality by exploiting linguistic syntax for either the source or target language. However, when using syntax for both languages (“tree-to-tree ” translation), there is evidence that syntactic divergence can hamper the extraction of useful rules (Ding and Palmer 2005). Smith and Eisner (2006) introduced quasi-synchronous grammar, a formalism that treats non-isomorphic structure softly using features rather than hard constraints. While a natural fit for translation modeling, its flexibility has proved challenging for building real-world systems. In this article, we present a tree-to-tree machine translation system inspired by quasi-synchronous grammar. The core of our approach is a ne...
This paper presents a practical approach to statis-tical machine translation (SMT) based on syntacti...
This paper proposes a soft dependency matching model for hierarchical phrase-based (HPB) machine tra...
We show that phrase structures in Penn Treebank style parses are not optimal for syntaxbased machine...
Recent research has shown clear improvement in translation quality by exploiting linguistic syntax f...
We present a quasi-synchronous dependency grammar (Smith and Eisner, 2006) for ma-chine translation ...
2011-10-27Machine Translation (MT) is the task of translating a document from a source language (e.g...
Though phrase-based SMT has achieved high translation quality, it still lacks of generaliza-tion abi...
Syntax-based machine translation (MT) is an attractive approach for introducing addi-tional linguist...
We present a translation model based on dependency trees. The model adopts a tree to string approach...
For several languages only potentially non-projective dependency parses are readily available. Proje...
AbstractSynchronous context-free grammars (SCFGs) can be learned from parallel texts that are annota...
Many syntactic models in machine translation are channels that transform one tree into another, or...
We present a novel, structured language model- Supertagged Dependency Language Model to model the sy...
This thesis addresses the use of Probabilistic Synchronous Dependency Insertion Grammars (PSDIG) for...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
This paper presents a practical approach to statis-tical machine translation (SMT) based on syntacti...
This paper proposes a soft dependency matching model for hierarchical phrase-based (HPB) machine tra...
We show that phrase structures in Penn Treebank style parses are not optimal for syntaxbased machine...
Recent research has shown clear improvement in translation quality by exploiting linguistic syntax f...
We present a quasi-synchronous dependency grammar (Smith and Eisner, 2006) for ma-chine translation ...
2011-10-27Machine Translation (MT) is the task of translating a document from a source language (e.g...
Though phrase-based SMT has achieved high translation quality, it still lacks of generaliza-tion abi...
Syntax-based machine translation (MT) is an attractive approach for introducing addi-tional linguist...
We present a translation model based on dependency trees. The model adopts a tree to string approach...
For several languages only potentially non-projective dependency parses are readily available. Proje...
AbstractSynchronous context-free grammars (SCFGs) can be learned from parallel texts that are annota...
Many syntactic models in machine translation are channels that transform one tree into another, or...
We present a novel, structured language model- Supertagged Dependency Language Model to model the sy...
This thesis addresses the use of Probabilistic Synchronous Dependency Insertion Grammars (PSDIG) for...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
This paper presents a practical approach to statis-tical machine translation (SMT) based on syntacti...
This paper proposes a soft dependency matching model for hierarchical phrase-based (HPB) machine tra...
We show that phrase structures in Penn Treebank style parses are not optimal for syntaxbased machine...