[PDF] Top 20 Multi Target Machine Translation with Multi Synchronous Context free Grammars
Has 10000 "Multi Target Machine Translation with Multi Synchronous Context free Grammars" found on our website. Below are the top 20 most common "Multi Target Machine Translation with Multi Synchronous Context free Grammars".
Multi Target Machine Translation with Multi Synchronous Context free Grammars
... multiple target languages T1, T2, ...better translation results. As a spe- cific framework to realize multi-target transla- tion, we expand the formalism of synchronous ... See full document
10
Binarization of Synchronous Context Free Grammars
... of multi-text grammars on a theoretical level, showing the importance and difficulty of binarization for efficient synchronous ...the target language and extracting tree transducer rules that ... See full document
38
Synchronous Linear Context Free Rewriting Systems for Machine Translation
... discontinuous translation units, is ...constraining synchronous derivations by monolin- gual syntactic parse trees on the source and/or target side, allowing discontinuous constituents becomes even ... See full document
10
Quasi Synchronous Phrase Dependency Grammars for Machine Translation
... In looking at BLEU score differences between the two systems, the unigram precisions were typically equal or only slightly different, while precisions for higher-order n-grams contained the bulk of the im- provement. ... See full document
12
Prefix Probability for Probabilistic Synchronous Context Free Grammars
... statistical machine translation, there has been a growing interest in so-called syntax- based translation models, that is, models that de- fine mappings between languages through hierar- chical ... See full document
10
On the Complexity of Alignment Problems in Two Synchronous Grammar Formalisms
... the context of the NP-hardness of decoding in statistical machine translation (Knight, 1999; Udupa and Maji, 2006), it is natural to ask why the universal recognition problem of (2,2)- BRCGs isn’t ... See full document
9
Learning Synchronous Grammars for Semantic Parsing with Lambda Calculus
... chronous grammars have seen a surge of interest re- cently in the statistical machine translation (SMT) community as a way of formalizing syntax-based translation models between natural ... See full document
8
Synchronous Context Free Tree Grammars
... Machine translation involves mappings between strings in two languages, formalized as string ...syntax-directed translation schemata (Lewis II and Stearns, 1968; Aho and Ullman, 1969b; Aho and ... See full document
9
Some Computational Complexity Results for Synchronous Context Free Grammars
... for machine transla- tion are all based on mathematical models called translation ...of translation between the words and the different word orderings of the source and target ...languages. ... See full document
8
Learning Probabilistic Synchronous CFGs for Phrase Based Translation
... phrase-based synchronous grammars are now considered promis- ing devices for statistical machine transla- tion because they can express reordering phenomena between pairs of ...chronous ... See full document
9
Efficient Multi Pass Decoding for Synchronous Context Free Grammars
... a multi-pass approach to ma- chine translation decoding when using syn- chronous context-free grammars as the trans- lation model and n-gram language models: the first pass uses a ... See full document
9
Pattern Based Context Free Grammars for Machine Translation
... • Synchronization Shieber and Schabes, 1990 of the source and target language structures Readers should note, however, that the pars1See LTAG Schabes, AbeiU~, and Joshi, 1988 Lexicalized[r] ... See full document
8
MEKA: A Multi-label/Multi-target Extension to WEKA
... Mulan (Tsoumakas et al., 2011) is a programmatic API also based on Weka providing a number of multi-label algorithms implemented from the literature. There is some overlap in terms of classifiers available, but ... See full document
5
Prefix probabilities for linear context free rewriting systems
... to context-free ...probabilistic synchronous context-free gram- mars was shown by Nederhof and Satta (2011b), which departed from earlier papers on the subject in that the solution was ... See full document
12
The Ellogon Pattern Engine: Context free Grammars over Annotations
... regular grammars or Perl- style regular expressions (which are slightly more expres- sive than regular grammars), and they tend to handle cases that need greater expressiveness with the cascade applica- ... See full document
6
Word Sense Disambiguation Improves Statistical Machine Translation
... Using the MT 2002 test set, we ran the minimum- error rate training (MERT) (Och, 2003) with the decoder to tune the weights for each feature. The weights obtained are shown in the row Hiero of Table 2. Using these ... See full document
8
Target Side Context for Discriminative Models in Statistical Machine Translation
... source context information to disam- biguate its ...ture target-side information and they were inde- pendent; no parameters were shared between clas- sifiers for different ...each target word, using ... See full document
11
Syntax based Multi system Machine Translation
... Petrov, S., Barrett, L., Thibaux, R., Klein, D. (2006). Learning accurate, compact, and interpretable tree annotation. Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual ... See full document
7
Multi level Evaluation for Machine Translation
... a multi-level ...the multi-level framework con- sistently improves the performance of two benchmarking metrics, resulting in better correlation with human ... See full document
5
Online Full Text
... in machine translation ...proper target equivalent of any source language word by comprehension of the ...a machine, a huge amount of data will be required as input and the output may still ... See full document
5
Related subjects