The normal method for representing anaphoric dependencies in Unification Based grammar tbrmalisms is that of re-entrance. In this paper, we address the problems that this represen...
This paper presents a general platform, namely synchronous tree sequence substitution grammar (STSSG), for the grammar comparison study in Translational Equivalence Modeling (TEM)...
Min Zhang, Hongfei Jiang, Haizhou Li, AiTi Aw, She...
This paper presents the first empirical results to our knowledge on learning synchronous grammars that generate logical forms. Using statistical machine translation techniques, a...
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
We present a machine translation framework that can incorporate arbitrary features of both input and output sentences. The core of the approach is a novel decoder based on lattice...