Back to the reading lists

    Language, speech & LLMs· 2015

    Neural Machine Translation of Rare Words with Subword Units

    Rico Sennrich (first author) · 2015

    Read the original

    DOI 10.18653/v1/p16-1162arXiv 1508.07909OpenAlex W1816313093

    Merge frequent neighboring pieces.

    On the reading lists

    Why it matters

    Established byte-pair encoding for neural NLP, enabling practical open-vocabulary modeling.

    Condensed from the expert lists' notes.

    Inside the paper

    The problem
    Word-based neural translation systems use a limited vocabulary, so infrequent words and names may become unknown tokens. A dictionary fallback can help, but it does not reliably form new words or transliterate names.
    The idea
    Represent words as sequences of reusable pieces and let the translation model generate those pieces. The authors adapt byte pair encoding to learn a compact vocabulary of variable-length units.
    How it works
    • Start with characters and repeatedly join the most frequent adjacent pair, recording each merge as a reusable segmentation rule.
    • Apply the learned merges to training and test text, preserving word boundaries so output pieces can be joined back into words.
    • Train an attention-based translation model on the resulting sequences instead of treating every complete word as a separate symbol.
    • The paper compares independently learned segmentation with a joint vocabulary across languages, as well as word and character-based alternatives.
    What it showed
    In English-to-German and English-to-Russian experiments, subword systems improve rare-word measures over the dictionary-backed baseline. Examples show both successful transliteration and errors caused by inconsistent segmentation.
    Read it for
    Read Section 3.2 for the merge procedure and Tables 2–3 for the translation comparisons. Section 5.2 gives concrete examples; detailed training settings in Section 4 can wait.

    Written in our own words from the paper itself. A draft the editors have not yet reviewed.

    Reading it

    Difficulty: Introductory

    Read this first: sequence-to-sequence models.

    The record

    First released
    2015 (from arXiv 1508.07909)
    Citations
    9,118 citations, as counted by Papers With Code (CC BY-SA 4.0)
    Awards
    ACL Test of Time
    Named by
    both expert lists
    Score
    0.757 · computed rank 24 · consensus 0.81, must-read 1, citations percentile 0.756 (2010s · language), awards 1, existing lists 0. Method

    Editor's notes

    • Readability check: pass: Byte-pair encoding, the tokenisation idea behind modern language models. (AI draft (Claude), not yet reviewed, 2026-10-29)

    Data sources

    Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0). Each count names its source. See the method.