[PDF] Top 20 Example based Machine Translation Based on Syntactic Transfer with Statistical Models

... partial example of bottom- up generation when the target tree in Figure 4 is ...and translation) are obtained from child ...the translation probabil- ity is calculated, the source word sub-sequence ... See full document

... an example of a verb phrase with a temporal NP modifier, which literally trans- lates into “same day morning issue ...an example verb phrase with a QP modifier, literally translating into “many time ... See full document

... improve translation output– has been explored by many ...for translation from French to English, where context-free constituency reordering rules are acquired automatically using source and target parses ... See full document

... include syntactic information into phrase-based ...bilingual models (Niehues et ...of translation experiments we performed a thor- ough comparison between various syntactically- enriched BiLMs ... See full document

... a translation “phrase” is simply any contiguous word string that is consistent with a word alignment (a relation between source and target words), usually produced by a language-independent alignment pro- cedure ... See full document

... the translation model training process, particularly by increasing alignment ...For example, training meth- ods for word alignment such as the IBM or HMM models (Och and Ney, 2003) are affected by ... See full document

... likely translation provided by the ...full translation process must completely rely on the LM to select the best individual translations of the three words so that a correct French sentence will be ...our ... See full document

... Burch et al., 2005) measured the impact on transla- tion quality of the sample size in random sampling of source phrase examples in the training corpus to estimate a phrase’s translation probabilities. As Ta- ble ... See full document

... novel statistical analysis-transfer-generation model for machine transla- tion, to integrate the advantages of the transfer-generation scheme and the statistical ...of transfer ... See full document

... After that, we propose to integrate such tense models into SMT systems in a dynamic way. It is well known there are many errors in the current MT output (David et al., 2006). Unlike previously making trouble with ... See full document

... The models in this paper are also related to word sense disambiguation ...For example, (Chan et ...in translation quality in a hierar- chical phrase-based translation ...phrasal ... See full document

... is based on linear position in the ...formulated models which incor- porate the intuition that syntactically close con- stituents tend to stay close across ... See full document

... three example epochs are shown in Table ...all models. We used Joshua (Li et al., 2009), a syntax-based decoder with a suffix array implementation, and rule induction via the standard Hiero grammar ... See full document

... boost translation quality further on any of the two test ...soft syntactic label set of composite SAMT-style la- bels comprises 8504 different labels that appear on the source-side of the parallel training ... See full document

... introducing syntactic information. Syntactic knowledge such as boun- dary of sub-trees, part-of-speech (POS) and depen- dency relation is incorporated into the SMT system to strengthen the ability to handle ... See full document

... Nowadays statistical machine translation shows its benefits and has received much ...phrase-based statistical machine translation was carefully ...better. ... See full document

... Machine translation (MT) has achieved huge advances in the past few years (Bahdanau et al., 2015; Gehring et al., 2017; Vaswani et al., 2017, 2018). However, the need for a large amount of manual parallel ... See full document

... use syntactic constraints, all of the nodes in the parse trees are ...For example, if we constrain the translation of “f1 f2 f3 f4” with node N2 illustrated in Figure 1, then word “e1” will never be ... See full document

... feature-structure-based rewrite grammars. GPL is a formalism that allows the direct expression of linguistic algorithms for parsing, transfer, and generation. Some ideas in GPL can be traced back to ... See full document

... A prototype system has been implemented to deal with a difficult translation problem for conventional Rule-Based Machine Translation RBMT, i.e., translating Japanese noun phrases of the [r] ... See full document