arXiv Computation and Language

A Computational Approach to Measuring Semantic Change in Sanskrit Literature

The paper evaluates whether diachronic word embeddings can track semantic change in Sanskrit, an ancient low‑resource language with complex phonological and morphological features. A 2.7‑million‑token corpus covering four canonical periods is processed with a neural sandhi splitter and lemmatizer, and per‑period embeddings are trained. Validation against a curated set of 21 historical shifts shows that 19 shifts align with philological expectations, supporting the method’s applicability to Sanskrit.

arXiv Machine Learning
Jul 28

BHARATI: Morphology-Aware Tokenizers for Classical Indian Languages with Subword Fertility Analysis

arXiv:2607. 23319v1 Announce Type: cross Abstract: Standard subword tokenization algorithms such as Byte-Pair Encoding (BPE) and SentencePiece are trained predominantly on modern language corpora and produce inefficient segmentations when applied to classical Indian languages.

By Poornima Kumaresan, Pavithra Muruganantham, Lakshmi Rajendran, Santhosh Sivasubramani
arXiv Computation and Language
Aug 27

Padamitra: Grounded Glossary Generation for Classical Sanskrit

The paper introduces grounded glossary generation, a structured NLP task that asks models to recover semantically meaningful Sanskrit phrases and provide translation‑grounded meanings from a sloka‑translation pair, mirroring the traditional patha commentary practice. A benchmark of 31,316 sloka‑translation‑glossary triples from the Valmiki Ramayana and Srimad Bhagavatam is built, evaluated with Jaccard for phrase recovery and Meaning Faithfulness for semantic consistency. Experiments with Gemma‑3n‑E4B, Gemma‑3‑12B, Phi‑4, and Qwen3.5‑9B show that instruction fine‑tuning outperforms prompting, and explicit segmentation further improves results, though over‑segmentation of sandhi and samasa compounds remains the main error source, highlighting morphological modeling as a key bottleneck.

By Manoj Balaji Jagadeeshan, Sai Pragnaan Marala, Pawan Goyal
arXiv Machine Learning
Aug 28

Vowel Signs Are Not Letters: A Pre-tokenization Ceiling on Multilingual Tokenizer Fertility

The paper shows that HuggingFace’s ByteLevel pre‑tokenizer, which treats a word as a sequence of Unicode letters, splits abugida scripts at every vowel sign, creating a training‑free lower bound on tokenizer fertility. Across 26 languages, all 17 abugidas exhibit increased token counts (up to 9×), while Latin, Cyrillic, Hangul, and Han remain unchanged. The authors demonstrate that correcting the character class reduces Nepali token counts, improves model performance, and that this issue is widespread in popular HuggingFace models.

By Sajal Regmi, Siddhartha Pudasaini, Chetan Phakami Pun
arXiv Computation and Language
Sep 1

Pad\=artha: Ontology-Grounded Fine-Grained NER Benchmark for Classical Sanskrit

Padàrtha is the first ontology‑grounded fine‑grained Named Entity Recognition benchmark for Classical Sanskrit, built on the Mahêbhárata epic. Its tag set, derived from the Nyáya‑Vai’séka ontological system, contains 18 fine‑grained categories under 10 nodes and maps to five standard coarse tags, ensuring compatibility with existing benchmarks. The dataset includes over 12.6K expert‑annotated entries and 108,335 entity mentions across 73,632 verses, plus a 5,000‑verse test set designed to challenge rare mentions, and the study compares generative NER models to traditional architectures, noting performance drops at finer granularity and difficulties with unseen entities.

By Sujoy Sarkar, Pretam Ray, Paramhans Shah, Manoj Balaji Jagadeeshan, Akash Gairola, Arjuna S R, Pawan Goyal
arXiv Computation and Language
Aug 21

SynFlow: A Multidimensional Diachronic Semantic Analysis Toolkit

arXiv:2608. 19472v1 Announce Type: new Abstract: Lexical semantic change (LSC) is commonly modelled through vector-space representations, but these approaches often provide limited insight into which aspects of usage are changing.

By Bach Phan-Tat, Kris Heylen, Dirk Geeraerts, Stefano De Pascale, Dirk Speelman
arXiv AI
Aug 20

SuTRA : Structurally-Unified Tokenization with Root Awareness

SuTRA (Structurally-Unified Tokenization with Root Awareness) is a morphology-aware tokenization algorithm designed to address the problem of Morphological Shattering in morphologically rich Indic languages. It preserves the indivisibility of aksharas—complex orthographic syllables—by penalizing merges that cross morphological boundaries, thereby reducing over-fragmentation of words. The authors also release a new morphological segmentation dataset for Hindi, Marathi, and Gujarati, and demonstrate that SuTRA improves morphological alignment by up to 14.7% and semantic recoverability by 34% over BPE, leading to an average machine translation gain of +8.08 chrF2.

By Vaibhav Rathore, Siddhant Gole, Dadhichi Telwadkar, Rooshil Bhatia, Maulik Ruparel, Siddharth Surekha, Neha Bhargava