Reducing Tokenization Premiums for Low-Resource Languages

Geoffrey Churchill, Steven Skiena
1/19/2026
cs.CL

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

Relative to English, low-resource languages suffer from substantial tokenization premiums in modern LMs, meaning that it generally requires several times as many tokens to encode a sentence in a low-resource language than to encode the analogous sentence in English. This tokenization premium results in increased API and energy costs and reduced effective context windows for these languages. In this paper we analyze the tokenizers of ten popular LMs to better understand their designs and per-language tokenization premiums. We also propose a mechanism to reduce tokenization premiums in pre-trained models, by post-hoc additions to the token vocabulary that coalesce multi-token characters into single tokens. We apply this methodology to 12 low-resource languages, demonstrating that the original and compressed inputs often have similar last hidden states when run through the Llama 3.2 1B model.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{churchill2026reducing,
  title  = {Reducing Tokenization Premiums for Low-Resource Languages},
  author = {Geoffrey Churchill and Steven Skiena},
  year   = {2026},
  eprint = {2601.13328},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.13328v1}
}

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/2601.13328.svg)](https://codeofpaper.com/paper/2601.13328)

Discussion