Broken Words, Broken Performance: Effect of Tokenization on Performance of LLMs
Not on the map. Why?
Abstract (arXiv)
Tokenization is the first step in training any Large Language Model (LLM), where the text is split into a sequence of tokens as per the model's fixed vocabulary. This tokenization in LLMs is different from the traditional tokenization in NLP where the text is split into a sequence of "natural" words. In LLMs, a natural word may also be broken into multiple tokens due to limited vocabulary size of the LLMs (e.g., Mistral's tokenizer splits "martial" into "mart" and "ial"). In this paper, we hypothesize that such breaking of natural words negatively impacts LLM performance on various NLP tasks. To quantify this effect, we propose a set of penalty functions that compute a tokenization penalty for a given text for a specific LLM, indicating how "bad" the tokenization is. We establish statistical significance of our hypothesis on multiple NLP tasks for a set of different LLMs.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 9 of its 25 references that are in the map. First posted on arXiv 26 Dec 2025.
Builds on
9 of 25 references.
References · 9
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2021Structured Prediction as Translation between Augmented Natural Languagescited by 183
- 2023Tokenizer Choice For LLM Training: Negligible or Crucial?cited by 105
- 2024BPE Gets Picky: Efficient Vocabulary Refinement During Tokenizer Trainingcited by 30
- 2024Scaffold-BPE: Enhancing Byte Pair Encoding for Large Language Models with Simple and Effective Scaffold Token Removalcited by 16
Built on by
Citing papers per year: 2026: 2.
2 papers.