Challenge: Subword tokenization schemes such as Byte Pair Encoding (BPE) are widely adopted, but their effectiveness in multilingual settings remains understudied.
Approach: They propose a multilingual tokenizer that produces linguistically coherent tokens for multilingual LLMs.
Outcome: The proposed tokenizer improves fertility score by 39.5% over LLaMA4 and 18% over Sutra.

Similar Papers

One Tokenizer To Rule Them All: Emergent Language Plasticity via Multilingual Tokenizers (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to train multilingual large language models for many languages at once are limited due to limited model capacity, scarce high-quality data, and compute constraints.
Approach: They propose to use a universal tokenizer to improve language plasticity and adaptability to new languages by up to 20%.
Outcome: The proposed tokenizer improves language plasticity and improves plasticity towards languages that are completely unseen in the tokenizer and pretraining, by up to 5% win rate gain.
Multilingual Tokenization through the Lens of Indian Languages: Challenges and Insights (2026.findings-acl)

Copied to clipboard

Challenge: Existing tokenizers are often skewed towards high-resource languages limiting their effectiveness for linguistically diverse and morphologically rich languages.
Approach: They evaluate multilingual tokenization across 17 Indic languages spanning 11 scripts and two language families.
Outcome: The proposed method improves tokenization quality and vocabulary size in 17 languages . poor tokenization can lead to increase in sequence lengths, fragment meaningful units, weaken model's ability to capture linguistic structure and semantics.
Tokenizer Choice For LLM Training: Negligible or Crucial? (2024.findings-naacl)

Copied to clipboard

Challenge: Recent success of large language models has been driven by curating the training dataset composition, scaling of model architectures and advancements in pretraining objectives, leaving tokenizer influence as a blind spot.
Approach: They conduct a comprehensive study on the influence of tokenizer choice on LLM downstream performance by training 24 mono- and multilingual LLMs at a 2.6B parameter scale.
Outcome: The proposed model can significantly impact the model's downstream performance and training costs.
From Where Words Come: Efficient Regularization of Code Tokenizers Through Source Attribution (2026.acl-long)

Copied to clipboard

Challenge: Currently, subword tokenization is the most common approach for vocabulary building in large models.
Approach: They propose to regularize training and minimize overfitting by using source-attributed BPE . they find that undertrained tokens are prone to producing unused, unusable tokens .
Outcome: The proposed techniques reduce the number of under-trained tokens while maintaining the same inference procedure as with regular BPE.
Accelerating Multilingual Language Model for Excessively Tokenized Languages (2024.findings-acl)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have shown a significant degree of multilingual proficiency on a variety of tasks in multiple languages.
Approach: They propose a framework to fine-tune a language model head and fine-track it while preserving its performance.
Outcome: The proposed framework increases the generation speed by 1.7 while maintaining the performance of pre-trained multilingual models on target monolingual tasks.
AdaptBPE: From General Purpose to Specialized Tokenizers (2026.eacl-long)

Copied to clipboard

Challenge: Subword tokenization methods impact performance and efficiency of large language models . generic tokens can incur inefficiencies when applying the model to specific domains or languages .
Approach: They propose a subword tokenization technique that selectively replaces low-utility tokens with more relevant ones based on their frequency in an adaptation corpus.
Outcome: The proposed method compresses test corpora more effectively than baselines using the same vocabulary size.
TReX: Tokenizer Regression for Optimal Data Mixture (2026.eacl-long)

Copied to clipboard

Challenge: Existing approaches to train and inference tokenizers rely on heuristics or large-scale searches to determine optimal data mixtures.
Approach: They propose a regression-based framework that efficiently predicts the optimal data mixture for tokenizer training.
Outcome: The proposed model outperforms mixtures based on LLaMA3 and uniform distributions by up to 12% in both in- and out-of-distribution compression efficiency.
Tokenizer-Aware Cross-Lingual Adaptation of Decoder-Only LLMs through Embedding Relearning and Swapping (2026.eacl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have been primarily focused on English, leaving the multilingual ability unexplored.
Approach: They propose a technique that creates new tokenizers and tunes embeddings on fixed model weights for target language adaptation.
Outcome: The proposed method is light-weight and performant but has limitations for older models and high resource languages.
Tokenization Falling Short: On Subword Robustness in Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Language models typically tokenize raw text into sequences of subword identifiers from a predefined vocabulary.
Approach: They propose to tokenize raw text into sequences of subword identifiers from a predefined vocabulary . they also investigate the challenges and their impact on large language models .
Outcome: The proposed model can mitigate tokenization issues, but still suffer from typos and other variations.
Improving Consistency in LLM Inference using Probabilistic Tokenization (2025.findings-naacl)

Copied to clipboard

Challenge: Prior work has shown that probabilistic tokenizations can generate multiple tokenization of the same input string.
Approach: They propose a method to leverage the multiple tokenization capabilities of modern LLM tokenizers.
Outcome: The proposed method improves the self-consistency of large language models by generating multiple tokenizations.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations