[PDF] Top 20 The UPV PRHLT combination system for WMT 2011

... MBRSC operates directly on the outputs of the component models. We perform an MBR decod- ing using a linear combination of the component models’ probability distributions. Instead of re- ranking the translations ... See full document

... the tuning stage with the use of a development set. Such features typically include the target lan- guage model p(e), which is one of the core com- ponents of an SMT system. In fact, most of the times it is ... See full document

... JHU system combi- nation scheme used in WMT-11. The JHU system combination is based on confusion network alignment, and inherited the frame- work developed by (Karakos et ...core system ... See full document

... In this paper we describe our systems for the EMNLP 2011 Sixth Workshop on Statistical Ma- chine Translation. We participated in the Shared Translation Task and submitted translations for English↔German and ... See full document

... We applied test10 as the held-out data to tune the German-English and English-German transla- tion systems. For experiments, we applied a small- scaled 4-gram language model trained only on the target side of the ... See full document

... the system presented for the English-Spanish translation task by the collaboration between CEU-UCH and UPV for 2011 ...primary system, com- puted over lowercased and detokenized out- puts. The ... See full document

... rule extraction is based on tree manipulation and re- laxed extraction algorithms. Moses implements sev- eral algorithms that have been proposed in the lit- erature. Tree binarisation is one of them. This can be done in ... See full document

... NMT system based on the Transformer architecture (Vaswani et ...NMT system due to the great advances this technology has made in the field of SMT over the last few years, which has led it to outperform ... See full document

... linear combination of three types of scores: (1) BTNG F-measures as in TESLA-M and TESLA-B, (2) BPNG F-measures as in TESLA-B, and (3) nor- malized language model scores of the system trans- lation, defined ... See full document

... the WMT 2011 shared task, we built a system with the multi-engine MT ap- proach described in (Sennrich, 2011), which builds on the idea by (Chen et ...SMT system (Koehn et al., 2007) is ... See full document

... The phrase-based approach to SMT performs the translation splitting the source sentence in segments and assigning to each segment a bilingual phrase from a phrase-table. Bilingual phrases are trans- lation units that ... See full document

... In an n-best reranking step, we compute depen- dency language model scores on the dependencies which were assembled on the hypotheses by the search procedure. We apply one language model for left-side dependencies and ... See full document

... new system is build, including time consuming word alignment with ...For WMT’11, we directly used the word-to-word alignments produced by the decoder at the output instead of GIZA’s align- ... See full document

... LIG system since we lacked time to apply SPE on the N-best hypotheses for the development and test corpora (the N-best being nec- essary for combination of LIG and LIA ... See full document

... The main tasks were quite competitive and many systems were within a BLEU point of the top. This is an ideal scenario for system combination, and we show corresponding improvements. The English- Czech task ... See full document

... In this paper, the system submitted by the PRHLT group for the Fifth Work- shop on Statistical Machine Translation of ACL2010 is presented. On this evalua- tion campaign, we have worked on the ... See full document

... chose the set median string using the same set of weight values chosen for the primary submission. We compute MT quality scores on the WMT 2010 test corpora to verify the results on the tuning data. Table 3 ... See full document

... ditional system combination engines for the first time: The first one uses the same alignments as A2L, but generates lattices in the OpenFST frame- work (Allauzen et ...of system combination – ... See full document

... The first, more naive grammar filtering method sorted all hierarchical rules by extracted frequency, then retained the most frequent 10,000 rules to join all matching phrase pair rules in the final translation grammar. ... See full document

... The second method that we propose now is a modification of the first one. With the formula of the first method, it was observed that, in some cas- es, the unigram probabilities had a relevant signifi- cance in the ... See full document