pith. sign in

arxiv: 1811.04719 · v1 · pith:O3A7CDH6new · submitted 2018-11-12 · 💻 cs.CL

End-to-End Non-Autoregressive Neural Machine Translation with Connectionist Temporal Classification

classification 💻 cs.CL
keywords modelsnon-autoregressivetranslationautoregressiveclassificationconnectionistend-to-endmachine
0
0 comments X
read the original abstract

Autoregressive decoding is the only part of sequence-to-sequence models that prevents them from massive parallelization at inference time. Non-autoregressive models enable the decoder to generate all output symbols independently in parallel. We present a novel non-autoregressive architecture based on connectionist temporal classification and evaluate it on the task of neural machine translation. Unlike other non-autoregressive methods which operate in several steps, our model can be trained end-to-end. We conduct experiments on the WMT English-Romanian and English-German datasets. Our models achieve a significant speedup over the autoregressive models, keeping the translation quality comparable to other non-autoregressive models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.