HackerPapers

arXiv:1804.10959cs.CL

Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidates

Taku Kudo

Abstract

Subword units are an effective way to alleviate the open vocabulary problems in neural machine translation (NMT). While sentences are usually converted into unique subword sequences, subword segmentation is potentially ambiguous and multiple segmentations are possible even with the same vocabulary. The question addressed in this paper is whether it is possible to harness the segmentation ambiguity as a noise to improve the robustness of NMT. We present a simple regularization method, subword regularization, which trains the model with multiple subword segmentations probabilistically sampled during training. In addition, for better subword sampling, we propose a new subword segmentation algorithm based on a unigram language model. We experiment with multiple corpora and report consistent improvements especially on low resource and out-of-domain settings.

arXiv comments
Accepted as a long paper at ACL2018
Journal reference
DOI
Subjects
cs.CLComputation and Language

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from Feb 2024 to May 2025. Found in 1 HN submission from May 2018 to May 2018. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments2 threads

    • Just a minor nit: SentencePiece is a library, not a tokenization algorithm. It implements two tokenization algorithms, Unigram and BPE. BPE builds vocabularies from the base up so I assume you are talking about Unigram which starts with a big vocabulary and trims it. The details…

      mcycView on HNParent context

    • Also very neat is the Unigram algorithm. IIRC that paper also introduces subword regularization which I think is really cool. https://arxiv.org/abs/1804.10959

      jszymborskiView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.