[PDF] Top 20 Non Projective Parsing for Statistical Machine Translation

... try h es gibt ⇒ there is i a correct alignment would be h(1, 1), (2, 2)i , specifying that there is aligned to es, and is is aligned to gibt (note that in many, but not all, cases a i = b i , i.e., a target language word ... See full document

... Modern statistical machine translation (SMT) systems usually use a linear com- bination of features to model the quality of each translation ...a non- linear modeling for the quality of ... See full document

... Let us now see how different constraints affect running time, as measured by the number of ac- tive pairs in relation to sentence length. A plot of this relationship for a subset of the conditions can be found in Figure ... See full document

... mental non-projective parser has the best reported score for Danish and outperforms at least one of the other two systems for four languages out of five, although most of the differences are probably too ... See full document

... dependency parsing) drops the results because of the sparseness effect over the dataset, which is consistent with the automatic evaluation BLEU ...online translation service provided by ...reference ... See full document

... In order to compose this segment from the original German, the reordering automaton described in our framework must perform a complex sequence of moves on the parse tree: • Starting from ”sollten”, de- scend to ”dienen”, ... See full document

... This paper employs the post-ordering framework for Japanese-English translation based on the dis- cussions given in Section 2, and improves upon the reordering method. Our method uses syntactic struc- tures, which ... See full document

... spired by the probabilistic forest-to-string gener- ation algorithm (Lu and Ng, 2011) and the work of Wong and Mooney (2006; 2007a; 2007b) and Wong (2007) that learn for semantic parsing with statistical ... See full document

... Yaser Al-Onaizan and Kishore Papineni. 2006. Dis- tortion models for statistical machine translation. In Proceedings of the 21st International Conference on Computational Linguistics and the 44th ... See full document

... Dependency parsing involves finding the structure of a sentence as expressed by a set of directed links (called dependencies) between individual ...as machine translation (Ding and Palmer 2005; Shen, ... See full document

... tical machine translation techniques. More specif- ically, a statistical word alignment model (Brown et ...a parsing framework called the synchronous CFG (Aho and Ullman, 1972), which forms ... See full document

... word-to-word translation model and a lexical- ized monolingual grammar are sufficient to drive a ...word-to-word translation model has allowed only one word align- ...word-to-word translation model ... See full document

... 2: Parsing accuracy (UAS and LAS, in- cluding punctuation) of Covington non-projective parser with static (s-Covington) and dynamic (d- Covington) oracles on CoNLL-XI (first block) and CoNLL-X ... See full document

... So as to build shallow syntactic, we use a method described in (Tsuruoka et al., 2009). Their approach introduced the method to parse an English sentence by using chunking (balance accuracy with speed time). Their method ... See full document

... both translation and evaluation. At translation time, domain adaptation techniques increase the likelihood of correct translations on average, but they do not provide the MT system with any inform- ation to ... See full document

... a projective (or nested) tree representation, in which all edges can be drawn in the plane with none ...a non-projective representations are preferred, as in the sentence in Figure ...languages, ... See full document

... tsVB also uses a piece of standard MT ma- chinery, specifically tree transducers, which have been profitably employed for syntax-based ma- chine translation (Maletti, 2010). In that work, however, the usual MT ... See full document

... most non-projective dependency structures appearing in practice are “close” to being projective, since they contain only a small proportion of non- projective ...tween projective ... See full document

... in Figure 5, where black dots represent training sentences (parsed with the oracle) and white dots represent test sentences (parsed with a classifier). For Arabic there is a very clear linear relationship in both cases ... See full document

... arbitrary non- projectivity, except under strong independence as- sumptions (McDonald and Satta, ...unrestricted non-projectivity are limited to edge-factored mod- els (McDonald et ... See full document