[PDF] Top 20 A Tree based Decoder for Neural Machine Translation

... dependency tree structures and is not trivially applicable to other varieties of trees such as phrase-structure trees, which have been used more widely in other works on syntax-based machine ...parse ... See full document

... phrase-based translation, even though the system could not achieve the upper bound shown in Table ...Korean-to-X translation as the future ... See full document

... The Danish to English translation engine in GramTrans (Bick, 2007) is called through an API. The output is a constraint grammar (CG) analysis on the target language side after all transfer and target side ... See full document

... the neural network (Pollack, 1990; Goller and K¨uchler, 1996; Socher et ...described neural network mod- els take the second approach and treat hierarchi- cal structure as a latent variable, applying ... See full document

... After obtaining the word-aligned corpus, in which each word alignment satisfy the ITG con- straint, we can extract the blocks in a straight- forward way. For the word alignment forms a hier- archical binary tree, ... See full document

... proposed neural ma- chine translation system can directly handle trans- lation at the level of characters without any word ...a decoder was asked to generate one char- acter at a time, while ... See full document

... word-based decoder and the character-based decoder when generating a sentence by a beam size of ...character-based decoder is about 41 times faster than the word-based ... See full document

... a tree-based encoder following the parsed ...proposed tree-based encoder is a natural extension of the sequential encoder model, where the leaf units of the tree-LSTM in the encoder can ... See full document

... Neural machine translation (NMT) is a new ap- proach to machine translation that has shown promising results compared to the existing ap- proaches such as phrase-based ... See full document

... constituent tree, the packed forest, which contains multiple different trees, de- scribes the syntactic structure of the sentence in different aspects, which together increase the ac- curacy of machine ... See full document

... One main reason is that P-TFM is highly sensitive to the value of the reward defined in Zhang et al. (2018), which is determined by the sentence similarity and the hyperparame- ter. To further support this, we add the ... See full document

... As far as we are concerned, we are not aware of any research work in neural machine transla- tion that has experimented with bytes. Related work can be found int the area of natural language processing. ... See full document

... better translation model at various levels, which seems to include better alignment, reordering, morphological generation and disam- ...character-based neural MT system is capable of achieving com- ... See full document

... as alignment. While we use larger vocabularies compared to the attention-based system, we ob- serve incorrect translations of rare words. E.g., the German word ¨Olknappheit in sentence 3 oc- curs only 7 times in ... See full document

... The tree-to-tree alignment model has tree transfor- mation operations similar to those of the tree-to- string model described ...formed tree must not only match the surface string of ... See full document

... three neural machine translation (NMT)- based models (LSTM, CNN, and transformer) and a statistical machine translation (SMT)- based model is evaluated against six learner ... See full document

... As shown in Table 1, our proposed model out- performs different baselines on all sets, which ver- ifies that the chunk-based bi-scale decoder is ef- fective for NMT. Our model gives a 1.6 BLEU score ... See full document

... the judgments, we proceed in pairs, and count the number of times each system was ranked higher, equal to, or lower than another competing sys- tem. The results shown in Table 5 indicate that the self-attentive residual ... See full document

... Data The English side of the corpus was tok- enized (into Penn treebank format) and truecased using the scripts provided in Moses (Koehn et al., 2007). We ran the BPE process on a concatenation of the source and target ... See full document

... In Table. 2 (a)–(b), we show the translations of some randomly selected sentences from the de- velopment and test sets. We chose the ones that have no unknown words. (a) lists long sentences (longer than 30 words), and ... See full document