Signals 4 · free daily AI digest

Fewer Words, Not Fewer Tokens: Measuring the Sanskrit Tokenization Penalty per Proposition

Paper recorded by Signals 4 on 2026-09-11 in cs.CL. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-11 on arXiv · recorded by Signals 4 on 2026-09-14

Category: cs.CL · 自然语言处理 · first seen 2026-09-14

Abstract

Sanskrit fuses case, number, person and tense into word endings and chains clauses into compounds, so it is information-dense per word. Whether that density survives subword tokenization is a separate question, to be asked per unit of meaning rather than per word. On identical FLORES-200 devtest content, Sanskrit costs 1.774-2.187 times the English tokens under deployed tokenizers with vocabularie

Read on arXiv →

#57 most recent of 186 cs.CL papers we have recorded · ↑ newer: Judging by the Cover: Cleaning LLM Truthfulness Benchmarks to Avoid Su · ↓ older: LLM-Enhanced Dual-Branch Learning for Large-Scale Multi-Label Text Cla
Cite this page: Fewer Words, Not Fewer Tokens: Measuring the Sanskrit Tokenization Penalty per Proposition: the #57 most recent of 186 cs.CL papers we have recorded (as of 2026-09-11). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/fewer-words-not-fewer-tokens-measuring-the-sanskrit-tokenization-penalty-per-pro.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.CL papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions