pith. sign in

arxiv: 2402.18376 · v2 · pith:GUZ6GPMAnew · submitted 2024-02-28 · 💻 cs.CL · cs.AI

Tokenization Is More Than Compression

classification 💻 cs.CL cs.AI
keywords tokenizationlanguagetexttokensvocabularycompressionconstructiondesign
0
0 comments X
read the original abstract

Tokenization is a foundational step in natural language processing (NLP) tasks, bridging raw text and language models. Existing tokenization approaches like Byte-Pair Encoding (BPE) originate from the field of data compression, and it has been suggested that the effectiveness of BPE stems from its ability to condense text into a relatively small number of tokens. We test the hypothesis that fewer tokens lead to better downstream performance by introducing PathPiece, a new tokenizer that segments a document's text into the minimum number of tokens for a given vocabulary. Through extensive experimentation we find this hypothesis not to be the case, casting doubt on the understanding of the reasons for effective tokenization. To examine which other factors play a role, we evaluate design decisions across all three phases of tokenization: pre-tokenization, vocabulary construction, and segmentation, offering new insights into the design of effective tokenizers. Specifically, we illustrate the importance of pre-tokenization and the benefits of using BPE to initialize vocabulary construction. We train 64 language models with varying tokenization, ranging in size from 350M to 2.4B parameters, all of which are made publicly available.

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.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The price of incrementality in k-center clustering

    cs.DS 2026-06 unverdicted novelty 7.0

    Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.

  2. Proxy Compression for Language Modeling

    cs.CL 2026-02 conditional novelty 6.0

    Proxy compression trains language models on both raw bytes and compressed sequences to enable efficient training with raw-byte inference at test time.

  3. The Roots of Performance Disparity in Multilingual Language Models: Intrinsic Modeling Difficulty or Design Choices?

    cs.CL 2026-01 accept novelty 4.0

    Performance gaps in multilingual LMs frequently arise from modeling choices such as tokenization and data exposure rather than intrinsic linguistic complexity.