TRANSMISSION // 2611.13059v1
A multilingual tokenizer cuts token counts—but model benefits remain untested
Source published
Havon’s tokenizer uses fewer tokens than GPT-4o’s on many languages in a benchmark, including all 25 Indian languages tested. A second training stage that can combine neighboring words also reduces English token counts. These results measure text compression, not whether a model using Havon would give better answers or run faster in practice.
Language models break text into tokens—whole words, fragments or punctuation. When a passage takes more tokens to represent, it can use more of a model’s context and may cost more under token-based billing. Researchers at Havon AI trained tokenizers intended to reduce token use across languages. Their benchmark results are promising, but do not show that models using these tokenizers will perform better or cost less to operate.
A sentence that looks equally long on screen can take very different numbers of tokens to process, depending on the language and tokenizer. That matters because language-model systems often measure context limits and usage charges in tokens. If one language takes more tokens to express the same content, users may fit less text into a context window or pay more for a request. But reducing token counts is only one step: it does not, by itself, show that a model will understand or generate that language well.
In an arXiv preprint, Johin Johny, Ankur Ghosh and Shervin Sam of Havon AI describe tokenizers designed for many languages. Their central question was whether one could reduce token use across languages—including English—while maintaining favorable token counts for Indian languages.
The researchers trained their tokenizers from scratch using human-written web, educational and programming text. Havon v3 uses byte-pair encoding, a method that learns which character sequences to combine into reusable pieces. Its text-processing rules keep certain Indic vowel marks attached to their letters. For languages usually written without spaces, such as Khmer and Burmese, it divides text into bounded chunks rather than treating a long uninterrupted passage as one unit.
Havon v4 adds a second training stage based on SuperBPE. Unlike the usual approach, which prevents a token from crossing a space, this stage can combine multiple neighboring words. The team compared token counts with GPT-4o’s o200k_base tokenizer on FLORES-200, a multilingual translation benchmark. They counted tokens for individual sentences in the devtest split, which contains 1,012 sentences per language. A lower count means fewer tokens for those benchmark sentences; it does not measure translation quality.
At the same vocabulary size as GPT-4o—200,019 tokens—Havon v4 used fewer tokens on English and on 161 of the 204 languages tested. Its median count across the 25 Indian languages was 0.74 times GPT-4o’s count, or about a quarter fewer. The authors report lower counts for all 25. By contrast, v3 at the same vocabulary size used more tokens on English and had lower counts on 133 languages. This comparison points to a benefit from the multi-word stage. In a separate controlled test on identical text, adding that stage also reduced counts in the six languages examined.
With a larger vocabulary of 262,144 tokens, v4 used fewer tokens than GPT-4o on 182 languages. At 524,288 tokens, it did so on 203 of 204; German was the exception. Havon v5 adapts the recipe using programming code in 15 languages. On the code samples tested, its counts were closer to GPT-4o’s than v4’s, though they remained higher in the reported categories. V5 also had lower counts on all 25 Indian languages and used 0.94 times GPT-4o’s tokens on English.
The results varied by language. The authors report especially strong reductions for Indian languages, English, Hindi and Romance languages. Languages written without spaces tended to gain less from combining words across spaces; at equal vocabulary size, v4 sometimes needed more tokens than v3 for languages including Khmer, Burmese and Tibetan. A fixed-size vocabulary is a limited budget: adding useful pieces for one language can leave fewer available for another. The authors’ reallocation experiment illustrates this trade-off, improving counts in some languages while worsening them in others.
Several limitations shape how broadly to interpret the findings. FLORES-200 contains formal, Wikipedia-style text, so results for conversation and other writing styles remain unknown. Training samples were not equal across languages, and the multi-word stage used only part of the available sample because of memory limits. Code comparisons covered relatively small samples. The authors also note that some public competitor tokenizer files could not be verified against official releases.
Most importantly, the study measures compression—not language-model quality, actual API bills or serving speed. Fewer tokens could allow more text in a context window and fewer decoding steps for a fixed output, but the authors have not evaluated a model trained with v4 or v5. Tokenization changes how text is represented; it does not guarantee that a model learns from that representation equally well. The work is an arXiv preprint, and the evidence provided here does not establish its peer-review status. The paper and accompanying materials provide further methods and results.
- tokenization
- multilingual AI
- byte-pair encoding
- language models
- Indian languages
- SuperBPE
Reviewed cross-references
These connections were reviewed by a model, not independently fact-checked by a human. Similarity does not imply agreement; consult the original papers and the evidence below.
A Smaller AI Model for Assamese Shows Promise—and the Limits of Fluent Answers
Shared method: Both papers use byte-pair encoding: the origin paper trains a byte-level BPE tokenizer from scratch, while AssameseLM-E2B expands Gemma’s vocabulary with Assamese tokens. This is a shared tokenization method, not evidence that their compression results are directly comparable: the training recipes, baselines and evaluations differ.
Model review: · openai-codex/gpt-6-luna
Evidence and provenance
Selected excerpts, not complete papers. PDF extraction can omit figures or damage equations, tables and reading order; sources may be preprints.
2611.13059v1 — Original paper
Excerpt reference:
static/papers/2611.13059v1.md:13-89
Basis: Paper text
Source SHA-256:6daac5741c4cfad178617002d148b676ac141ee7ca049946ce04d636c36560e22611.06170v1 — Original paper
Excerpt reference:
static/papers/2611.06170v1.md:188-268
Basis: Paper text
Source SHA-256:b118ebd43e13a869650cdb12bf7ba46367738169f5d8801cf4d1166977f4a44d2611.06170v1 — Original paper
Excerpt reference:
static/papers/2611.06170v1.md:269-322
Basis: Paper text
Source SHA-256:b118ebd43e13a869650cdb12bf7ba46367738169f5d8801cf4d1166977f4a44d
Related reading
Automatically matched by shared topic keywords. These links do not imply that the sources agree or establish a consensus.
ALTO study tests detection of online gender-based violence in three language settings
Source published
Shared keywords: multilingual ai
Small language models can learn backdoors without simply copying their teachers
Source published
Shared keywords: language models
A good forecasting record carries uneven weight in language models
Source published
Shared keywords: language models
Teaching diffusion models to do more with fewer decoding steps
Source published
Shared keywords: language models
Simulated city tests how AI investigators handle incomplete evidence
Source published
Shared keywords: language models