paper-with-me

Papers

Fast and Accurate Reordering with ITG Transition RNN

2018-08-01 · COLING 2018 8 · Hao Zhang, Axel Ng, Richard Sproat

Attention-based sequence-to-sequence neural network models learn to jointly align and translate. The quadratic-time attention mechanism is powerful as it is capable of handling arbitrary long-distance reordering, but computationally expensive. In this paper, towards making neural translation both accurate and efficient, we follow the traditional pre-reordering approach to decouple reordering from translation. We add a reordering RNN that shares the input encoder with the decoder. The RNNs are trained jointly with a multi-task loss function and applied sequentially at inference time. The task of the reordering model is to predict the permutation of the input words following the target language word order. After reordering, the attention in the decoder becomes more peaked and monotonic. For reordering, we adopt the Inversion Transduction Grammars (ITG) and propose a transition system to parse input to trees for reordering. We harness the ITG transition system with RNN. With the modeling power of RNN, we achieve superior reordering accuracy without any feature engineering. In experiments, we apply the model to the task of text normalization. Compared to a strong baseline of attention-based RNN, our ITG RNN re-ordering model can reach the same reordering accuracy with only 1/10 of the training data and is 2.5x faster in decoding.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

DecoderFeature EngineeringMachine TranslationMorphological InflectionSpeech RecognitionText NormalizationTranslation

Similar Papers 제목 키워드 기반

Fast and Accurate Preordering for SMT using Neural Networks

2015-05-01 · HLT 2015 5 · Adrià De Gispert, Bill Byrne, Gonzalo Iglesias
Language ModelingLanguage ModellingLearning-To-RankMachine Translation+4

Effective Online Reordering with Arc-Eager Transitions

2017-09-01 · WS 2017 9 · Ryosuke Kohita, Hiroshi Noji, Yuji Matsumoto

We present a new transition system with word reordering for unrestricted non-projective dependency parsing. Our system is based on decomposed arc-eager rather than arc-standard, which allows more flexible ambiguity resol…

ARCDependency ParsingTransition-Based Dependency Parsing

Pre-Reordering for Machine Translation Using Transition-Based Walks on Dependency Parse Trees

2013-08-01 · WS 2013 8 · Antonio Valerio Miceli-Barone, Giuseppe Attardi
Machine TranslationTranslation

Phrase-based Machine Translation using Multiple Preordering Candidates

2016-12-01 · COLING 2016 12 · Yusuke Oda, Taku Kudo, Tetsuji Nakagawa, Taro Watanabe

In this paper, we propose a new decoding method for phrase-based statistical machine translation which directly uses multiple preordering candidates as a graph structure. Compared with previous phrase-based decoding meth…

DecoderMachine TranslationTranslation

IHS-RD-Belarus at SemEval-2016 Task 9: Transition-based Chinese Semantic Dependency Parsing with Online Reordering and Bootstrapping.

2016-06-01 · SEMEVAL 2016 6 · Artsiom Artsymenia, Palina Dounar, Maria Yermakovich
Dependency ParsingSemantic Dependency ParsingSemantic Parsing