[PDF] Top 20 Pre Reordering for Machine Translation Using Transition Based Walks on Dependency Parse Trees
Has 10000 "Pre Reordering for Machine Translation Using Transition Based Walks on Dependency Parse Trees" found on our website. Below are the top 20 most common "Pre Reordering for Machine Translation Using Transition Based Walks on Dependency Parse Trees".
Pre Reordering for Machine Translation Using Transition Based Walks on Dependency Parse Trees
... phrase-based translation system. Finally, the reordering system is applied to source side of the test corpus, which is then translated with the downstream phrase-based system and the resulting ... See full document
6
Weblio Pre reordering Statistical Machine Translation System
... However, using dependency tree naively does not work well in ...English-Japanese translation, noun phrases are usually in the identical order of ...merely based on dependency ... See full document
6
System Description: Dependency based Pre ordering for Japanese Chinese Machine Translation
... tical machine translation ...Syntax-based pre-ordering has demonstrated ef- fectiveness in previous ...first parse the sentences in the side of source language. Then pre-ordering ... See full document
5
Dependency Tree Abstraction for Long Distance Reordering in Statistical Machine Translation
... method pre-processes the parallel cor- pus based on SCFG with increased flexibility and trains a BTG model using the processed corpus, we compare our method to another BTG model trained only with the ... See full document
10
Dependency based Pre ordering for Chinese English Machine Translation
... our dependency systems outper- formed WR07 slightly but were not significant at p = ...for pre-ordering rule applications on the training set, compared with ...the dependency parse ... See full document
6
Using unlabeled dependency parsing for pre reordering for Chinese to Japanese statistical machine translation
... refined reordering approach by importing an existing re- ordering method for English proposed in (Isozaki et ...These reordering strategies are based on Head-driven phrase structure grammars (HPSG) ... See full document
9
Dependency Based Bilingual Language Models for Reordering in Statistical Machine Translation
... Our idea is to keep the simplicity of PBSMT but move towards the expressiveness typical of tree- based models. We incrementally build up the syn- tactic representation of a translation during decod- ing by ... See full document
12
A Domain Restricted, Rule Based, English Hindi Machine Translation System Based on Dependency Parsing
... uses dependency parse of the source sentence as an intermediate representation from which the tar- get language sentence can be directly ...example- based, and statistics based English-Hindi ... See full document
9
Non projective Dependency based Pre Reordering with Recurrent Neural Network for Machine Translation
... 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”, descent to ”W¨ahrungsreserven” and finally ... See full document
11
Part of Speech Induction in Dependency Trees for Statistical Machine Translation
... In this step, we train a forest-to-string MT model based on the learned dependency parser in Step 3. We use an in-house developed hypergraph-based toolkit, cicada, for training and decoding with a ... See full document
11
Cross-language Projection of Dependency Trees for Tree-to-tree Machine Translation
... Syntax-based machine translation (MT) is an attractive approach for introducing addi- tional linguistic knowledge in corpus-based ...string-to-tree translation mod- els perform better ... See full document
9
Non projective Dependency based Pre Reordering with Recurrent Neural Network for Machine Translation
... the reordering relation from word alignments. Some of them learn reordering rules on the constituency (Dyer and Resnik, 2010) (Khalilov and Fonollosa, 2011) or projec- tive dependency (Genzel, 2010), ... See full document
11
BTG-based Machine Translation with Simple Reordering Model using Structured Perceptron
... the parse tree as latent variables (Loehlin, 1998) can benefit the BTG tree inference but for preorder- ing (see Figure ...The reordering model is trained to maximize the conditional likelihood of ... See full document
10
Dependency-based Pre-ordering For English-Vietnamese Statistical Machine Translation
... the translation quality done ...as parse tree source sentence quality, word alignment quality and quality of ...automatic reordering rules. Table 9 showed the translation output examples are ... See full document
14
Pre reordering Model of Chinese Special Sentences for Patent Machine Translation
... at reordering Chinese special sentences to organize phrases or words in English order without L0 ...the reordering of Chi- nese special sentences with these words, we use semantic features from the ... See full document
8
Modeling Syntactic and Semantic Structures in Hierarchical Phrase based Translation
... Third, initial phrase pair extraction in Chiang’s HPB generates a very large number of rules, which makes training and decoding very slow. To avoid this, a widely used strategy is to limit initial phrases to a reasonable ... See full document
10
Recognizing Implicit Discourse Relations in the Penn Discourse Treebank
... from dependency trees of the ...constituent parse tree and produces a de- pendency ...whole dependency tree, parts of a tree, or multiple trees, depending on the span of the ar- ...for ... See full document
9
Using Reordering in Statistical Machine Translation based on Alignment Block Classification
... The objective of this algorithm is to perform block reorder- ings in case the order of the blocks swaps from source to target. These block reorderings will take into account re- orderings that appear in the database, and ... See full document
6
Soft Dependency Constraints for Reordering in Hierarchical Phrase Based Translation
... As mentioned in Section 2.2, the cohesion penalty can be extended to also account for how a head word is translated with its children so that we are not biased towards one form of cohesive noncon- stituent ... See full document
12
Reordering Constraints for Phrase Based Statistical Machine Translation
... For the ITG constraints a dynamic program- ming search algorithm exists as described in the previous section. It would be more prac- tical with respect to language model recom- bination to have an algorithm that ... See full document
7
Related subjects