Non-autoregressive Machine Translation with Probabilistic Context-free Grammar

Shangtong Gui, Chenze Shao, Zhengrui Ma, Xishan Zhang, Yunji Chen +1 more
11/1/2023

No official code found. Best implementation: ictnlp/PCFG-NAT (12 stars, MIT, last commit 2024-01-04).

Abstract

Non-autoregressive Transformer(NAT) significantly accelerates the inference of neural machine translation. However, conventional NAT models suffer from limited expression power and performance degradation compared to autoregressive (AT) models due to the assumption of conditional independence among target tokens. To address these limitations, we propose a novel approach called PCFG-NAT, which leverages a specially designed Probabilistic Context-Free Grammar (PCFG) to enhance the ability of NAT models to capture complex dependencies among output tokens. Experimental results on major machine translation benchmarks demonstrate that PCFG-NAT further narrows the gap in translation quality between NAT and AT models. Moreover, PCFG-NAT facilitates a deeper understanding of the generated sentences, addressing the lack of satisfactory explainability in neural machine translation.Code is publicly available at https://github.com/ictnlp/PCFG-NAT.

View on arXivView PDF

Code Implementations(1)

ictnlp/PCFG-NATCommunity100%
MIT

Code for NeurIPS 2023 paper "Non-autoregressive Machine Translation with Probabilistic Context-free Grammar".

121C, C++Oct 16, 20232 years agoMIT

Similar Papers

Cite this paper

@article{gui2023nonautoregressive,
  title  = {Non-autoregressive Machine Translation with Probabilistic Context-free Grammar},
  author = {Shangtong Gui and Chenze Shao and Zhengrui Ma and Xishan Zhang and Yunji Chen and Yang Feng},
  year   = {2023},
  eprint = {2311.07941},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2311.07941},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.07941.svg)](https://codeofpaper.com/paper/2311.07941)

Discussion