FertiScope: Measuring the Multilingual Tokenizer Tax in Low-Resource Asian Languages

Miles Whiticker, Leo Deng, Antoine Pedretti

When using LLMs with lower-resource Asian languages, a hidden “tax” is applied where text is fragmented into a greater number of tokens compared to the English language. That greater token generation raises API bills, leaves room for fewer in-context examples, and fills the context window faster. To address this we made FertiScope: an open-source web tool that measures how many tokens are generated in 15 lower-resource Asian languages as well as other associated costs. Our tool measures three tokenizers: GPT-4o, GPT-4/3.5 and SEA-LION v3. We find that on parallel FLORES-200 sentences, the cost of the same content reaches up to 11.6× English, depending heavily on the tokenizer. Finally, we carried out a 540 call needle-in-haystack test across a subset of language, model and tokenizer combinations which found no degradation at token length inside the models’ publicly advertised context window sizes.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

This project clearly explains how the “tokenization tax” varies across Southeast and South Asian languages compared with English, which remains the dominant language around which many LLM systems and tokenizers were originally optimized. The project makes a strong contribution by showing that this cost is not only economic, but also affects usable context length, in-context capacity, and cost fairness for lower-resource languages within the FLORES-200 sentences.

One suggestion is to expand the analysis of the multi-turn recall pilot in Section 4.4 to include an AUC-style summary across needle positions and context-fill levels, or another metric that captures any degradation difference between Latin and non-Latin language classes.

I was also curious about the choice of the marker <>, as the author notes the caveat of putting Latin-script marker placed inside non-Latin haystacks. Further analysis could explore whether using a script-native marker changes the results, especially since only Malayalam showed a slight drop in the pilot. This could help distinguish whether the observed behavior is due to tokenization, script mismatch, or the salience of Latin text inside non-Latin language analysis. Beyond that, the project is very strong. The app and visualizations are convincing and functional, and the methodology, codebase, and reproducibility materials provide strong evidence for future research on this topic.

ONe possible edge case is in a localized application features short user queries (cheap input tokens) but generates large AI outputs, which can be expensive, which can cause asymmetry. It would be good to take them into account separately. To be clear, it doesnt in any way invalidate the paper's discovery that the "token tax" is massive and unfair. Just that the the estimates might not be what actually happens in production environment

This is a well executed and practically useful submission. FertiScope addresses a real deployment issue for lower-resource Asian languages: the same content can require many more tokens than English, increasing API cost, reducing effective context length, and limiting the number of in-context examples that fit. The project’s strongest contribution is translating a known research issue into an actionable open-source tool. The tool compares production tokenizers, reports same-content cost ratios on FLORES-200, estimates dollar costs, shows context-window exhaustion, and helps deployment teams make more informed model/tokenizer choices. The presentation is especially careful in distinguishing exact deterministic tokenization measurements from estimated multi-turn risk, and the authors avoid overclaiming that tokenizer fertility directly causes accuracy degradation.

That said, the broader area of multilingual tokenizer unfairness and tokenization quality is already well studied in the research literature. Beyond the tokenizer-tax papers already cited in the report, Rust et al.’s How Good is Your Tokenizer? On the Monolingual Performance of Multilingual Language Models is another relevant example, since it shows that tokenizer choice and vocabulary coverage can materially affect multilingual model performance.

The main novelty here is therefore practical tooling and regional deployment framing rather than a new research method. The main limitations are that the FLORES leaderboard uses only 50 sentences, the safety relevance is somewhat indirect, the multi-turn needle-in-haystack pilot does not yet probe context lengths where degradation is likely to appear, and the tokenizer coverage is still limited.

Overall, this is a strong tool-building submission with clear Global South relevance. To mature this into a more robust deployment tool, the authors could prioritize more tokenizer families, broader corpora, upload-based analysis, richer efficiency metrics, and a long-context benchmark that pushes closer to the edge of each model’s window.

I really like this one. You took a known problem (tokenizer unfairness) and made it something a team can act on before they ship: a free, local tool showing the dollar gap, usable context, and cheapest tokenizer per language. The rigor sells it. Deterministic, reproducible measurements, per-sentence cost kept separate from per-word fertility, cross-checks against independent Indic benchmarks, and no overclaiming, no causal accuracy story and the null pilot reported straight. To push it: scale past the 50 FLORES sentences to the full split with variance, run the 32k-128k window arm where degradation actually shows up, and add a purpose-built Indic tokenizer plus STRR. Some of the cleanest thinking in the batch.

Cite this work

@misc {

title={

(HckPrj) FertiScope: Measuring the Multilingual Tokenizer Tax in Low-Resource Asian Languages

},

author={

Miles Whiticker, Leo Deng, Antoine Pedretti

},

date={

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

PROTEUS (PROTein Evaluation for Unusual Sequences): Structure-Informed Safety Screening for de novo and Evasion-Prone Protein-Coding Sequences

AI protein design tools like RFdiffusion, ProteinMPNN, and Bindcraft make it trivial to produce low-homology sequences that fold into active, potentially hazardous architectures. However, sequence homology-based biosafety screening tools cannot detect proteins that pose functional risk through structurally novel mechanisms with no sequence precedent. We present a tiered computational pipeline that addresses this gap by combining MMseqs2 sequence alignment with structure-based comparison via FoldSeek and DALI against curated toxin databases totaling ~34,000 entries. AlphaFold2-predicted structures are screened for both global fold similarity (FoldSeek) and local active/allosteric site geometry (DALI), capturing convergent functional hazards that sequence screening misses. The pipeline was validated against a panel of toxins, benign proteins, structural mimics, and de novo-designed Munc13 binders, as well as modified ricin variants with residue substitutions. We additionally tested robustness to partial-synthesis evasion, where a bad actor submits multiple shorter coding sequences intended for downstream reassembly into a full toxin-coding gene. We found that while sequence-based screening did not identify any de novo ricin analogues with high certainty, the combined pipeline with FoldSeek and DALI identified all 24 tested de novo ricins as toxic.

Read More

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.