English
Related papers

Related papers: Beyond Fertility: Analyzing STRR as a Metric for M…

200 papers

Tokenization is an understudied and often neglected component of modern LLMs. Most published works use a single tokenizer for all experiments, often borrowed from another model, without performing ablations or analysis to optimize…

Computation and Language · Computer Science 2024-02-08 Gautier Dagan , Gabriel Synnaeve , Baptiste Rozière

Relative to English, low-resource languages suffer from substantial tokenization premiums in modern LMs, meaning that it generally requires several times as many tokens to encode a sentence in a low-resource language than to encode the…

Computation and Language · Computer Science 2026-01-21 Geoffrey Churchill , Steven Skiena

Computing next-token likelihood ratios between two language models (LMs) is a standard task in training paradigms such as knowledge distillation. Since this requires both models to share the same probability space, it becomes challenging…

Computation and Language · Computer Science 2026-05-07 Buu Phan , Ashish Khisti , Karen Ullrich

Word embeddings are computed by a class of techniques within natural language processing (NLP), that create continuous vector representations of words in a language from a large text corpus. The stochastic nature of the training process of…

Computation and Language · Computer Science 2020-08-03 Lucas Rettenmeier

Tokenization defines the foundation of multilingual language models by determining how words are represented and shared across languages. However, existing methods often fail to support effective cross-lingual transfer because semantically…

Computation and Language · Computer Science 2025-10-08 Muhammad Dehan Al Kautsar , Fajri Koto

The application of large language models (LLMs) to chemistry is frequently hampered by a "tokenization bottleneck", where tokenizers tuned on general-domain text tend to fragment chemical representations such as SMILES into semantically…

Computation and Language · Computer Science 2025-11-19 Prathamesh Kalamkar , Ned Letcher , Meissane Chami , Sahger Lad , Shayan Mohanty , Prasanna Pendse

Modern language models are typically trained over subword sequences, but ultimately define probabilities over character-strings. Ideally, the choice of the tokeniser -- which maps character-strings to subwords -- should not affect the…

Computation and Language · Computer Science 2025-06-04 Pietro Lesci , Clara Meister , Thomas Hofmann , Andreas Vlachos , Tiago Pimentel

To understand what kinds of linguistic knowledge are encoded by pretrained Chinese language models (LMs), we introduce the benchmark of Sino LINGuistics (SLING), which consists of 38K minimal sentence pairs in Mandarin Chinese grouped into…

Computation and Language · Computer Science 2022-10-24 Yixiao Song , Kalpesh Krishna , Rajesh Bhatt , Mohit Iyyer

Large language models (LLMs) for code rely on subword tokenizers, such as byte-pair encoding (BPE), learned from mixed natural language text and programming language code but driven by statistics rather than grammar. As a result,…

Computation and Language · Computer Science 2025-10-17 Yinxi Li , Yuntian Deng , Pengyu Nie

Multilingual machine translation (MT) benchmarks play a central role in evaluating the capabilities of modern MT systems. Among them, the FLORES+ benchmark is widely used, offering English-to-many translation data for over 200 languages,…

Computation and Language · Computer Science 2025-08-29 Chihiro Taguchi , Seng Mai , Keita Kurabe , Yusuke Sakai , Georgina Agyei , Soudabeh Eslami , David Chiang

Current multilingual vision-language models either require a large number of additional parameters for each supported language, or suffer performance degradation as languages are added. In this paper, we propose a Scalable Multilingual…

Computer Vision and Pattern Recognition · Computer Science 2020-08-31 Andrea Burns , Donghyun Kim , Derry Wijaya , Kate Saenko , Bryan A. Plummer

Tasks that require character-level reasoning, such as counting or locating characters within words, remain challenging for contemporary language models. A common conjecture is that language models' reliance on subword units, rather than…

Computation and Language · Computer Science 2026-04-08 Omri Uzan , Yuval Pinter

Despite the widespread use of Transformer-based text embedding models in NLP tasks, surprising 'sticky tokens' can undermine the reliability of embeddings. These tokens, when repeatedly inserted into sentences, pull sentence similarity…

Computation and Language · Computer Science 2025-07-25 Kexin Chen , Dongxia Wang , Yi Liu , Haonan Zhang , Wenhai Wang

Multilingual sentence representations are the foundation for similarity-based bitext mining, which is crucial for scaling multilingual neural machine translation (NMT) system to more languages. In this paper, we introduce MuSR: a…

Computation and Language · Computer Science 2023-06-13 Pengzhi Gao , Liwen Zhang , Zhongjun He , Hua Wu , Haifeng Wang

The entropy rate of printed English is famously estimated to be about one bit per character, a benchmark that modern large language models (LLMs) have only recently approached. This entropy rate implies that English contains nearly 80…

Computation and Language · Computer Science 2026-02-19 Weishun Zhong , Doron Sivan , Tankut Can , Mikhail Katkov , Misha Tsodyks

We present MultiTempBench, a multilingual temporal reasoning benchmark spanning three tasks, date arithmetic, time zone conversion, and temporal relation extraction across five languages (English, German, Chinese, Arabic, and Hausa) and…

Computation and Language · Computer Science 2026-03-20 Gagan Bhatia , Ahmad Muhammad Isa , Maxime Peyrard , Wei Zhao

Reinforcement-learning-based post-training has become a key approach for improving the reasoning ability of large language models, but its token-level learning signals remain poorly understood. This work studies their heterogeneity through…

Computation and Language · Computer Science 2026-05-11 Gengyang Li , Zheng-Fan Wu , Siqi Bao , Yunfang Wu

The widespread application of pre-trained language models (PLMs) in natural language processing (NLP) has led to increasing concerns about their explainability. Selective rationalization is a self-explanatory framework that selects…

Computation and Language · Computer Science 2025-01-07 Libing Yuan , Shuaibo Hu , Kui Yu , Le Wu

The relationship between tokenizer algorithm (e.g., Byte-Pair Encoding (BPE), Unigram), morphological alignment, tokenization quality (e.g., compression efficiency), and downstream performance remains largely unclear, particularly for…

Computation and Language · Computer Science 2025-11-11 Saketh Reddy Vemula , Sandipan Dandapat , Dipti Misra Sharma , Parameswari Krishnamurthy

Large Language Models have proven highly successful at modelling a variety of tasks. However, this comes at a steep computational cost that hinders wider industrial uptake. In this paper, we present MWT: a Multi-Word Tokenizer that goes…

Computation and Language · Computer Science 2024-04-08 Leonidas Gee , Leonardo Rigutini , Marco Ernandes , Andrea Zugarini