English
Related papers

Related papers: A Triadic Suffix Tokenization Scheme for Numerical…

200 papers

We introduce Tokenization with Split Trees (ToaST), a subword tokenization method that directly optimizes compression under a new recursive inference procedure. ToaST greedily splits each pretoken into a full binary tree using precomputed…

Computation and Language · Computer Science 2026-05-28 Craig W. Schmidt , Michael Krumdick , Adam Wiemerslage , Seth Ebner , Varshini Reddy , Yuval Pinter , Chris Tanner

Tokenization is a fundamental technique in the generative modeling of various modalities. In particular, it plays a critical role in autoregressive (AR) models, which have recently emerged as a compelling option for 3D generation. However,…

Computer Vision and Pattern Recognition · Computer Science 2026-03-19 Niladri Shekhar Dutt , Zifan Shi , Paul Guerrero , Chun-Hao Paul Huang , Duygu Ceylan , Niloy J. Mitra , Xuelin Chen

Large language models (LLMs) have demonstrated remarkable capabilities across diverse tasks. However, the truthfulness of their outputs is not guaranteed, and their tendency toward overconfidence further limits reliability. Uncertainty…

Computation and Language · Computer Science 2026-03-23 Qi Cao , Andrew Gambardella , Takeshi Kojima , Yutaka Matsuo , Yusuke Iwasawa

Tokenization is the first step in every language model (LM), yet it never takes the sounds of words into account. We investigate how tokenization influences text-only LMs' ability to represent phonological knowledge. Through a series of…

Computation and Language · Computer Science 2026-04-21 Disen Liao , Freda Shi

Improving the reasoning capabilities of large language models (LLMs) typically requires supervised fine-tuning with labeled data or computationally expensive sampling. We introduce Unsupervised Prefix Fine-Tuning (UPFT), which leverages the…

Computation and Language · Computer Science 2025-03-05 Ke Ji , Jiahao Xu , Tian Liang , Qiuzhi Liu , Zhiwei He , Xingyu Chen , Xiaoyuan Liu , Zhijie Wang , Junying Chen , Benyou Wang , Zhaopeng Tu , Haitao Mi , Dong Yu

Large Language Models (LLMs) perform well on reasoning benchmarks but often fail when inputs alter slightly, raising concerns about the extent to which their success relies on memorization. This issue is especially acute in Chain-of-Thought…

Computation and Language · Computer Science 2025-08-22 Huihan Li , You Chen , Siyuan Wang , Yixin He , Ninareh Mehrabi , Rahul Gupta , Xiang Ren

Tokenization - the practice of converting strings of characters from an alphabet into sequences of tokens over a vocabulary - is a critical step in the NLP pipeline. The use of token representations is widely credited with increased model…

Computation and Language · Computer Science 2025-04-04 Juan Luis Gastaldi , John Terilla , Luca Malagutti , Brian DuSell , Tim Vieira , Ryan Cotterell

Prior research has demonstrated noticeable performance gains through the use of probabilistic tokenizations, an approach that involves employing multiple tokenizations of the same input string during the training phase of a language model.…

Computation and Language · Computer Science 2024-07-08 Ashutosh Sathe , Divyanshu Aggarwal , Sunayana Sitaram

Speech tokenization is the task of representing speech signals as a sequence of discrete units. Such representations can be later used for various downstream tasks including automatic speech recognition, text-to-speech, etc. More relevant…

Sound · Computer Science 2024-06-18 Shoval Messica , Yossi Adi

Large language models (LLMs) have recently attracted considerable interest for their ability to perform complex reasoning tasks, such as chain-of-thought (CoT) reasoning. However, most of the existing approaches to enhance this ability rely…

Computation and Language · Computer Science 2024-08-08 Xinyi Wang , Lucas Caccia , Oleksiy Ostapenko , Xingdi Yuan , William Yang Wang , Alessandro Sordoni

Despite recent successes in language models, their ability to represent numbers is insufficient. Humans conceptualize numbers based on their magnitudes, effectively projecting them on a number line; whereas subword tokenization fails to…

Computation and Language · Computer Science 2023-10-11 Avijit Thawani , Jay Pujara , Ashwin Kalyan

Current language models (LMs) use a fixed, static subword tokenizer. This default choice typically results in degraded efficiency and language capabilities, especially in languages other than English. To address this issue, we challenge the…

Computation and Language · Computer Science 2025-06-12 Darius Feher , Ivan Vulić , Benjamin Minixhofer

Pre-training of Large Language Models is often prohibitively expensive and inefficient at scale, requiring complex and invasive modifications in order to achieve high data throughput. In this work, we present Token-Superposition Training…

Computation and Language · Computer Science 2026-05-20 Bowen Peng , Théo Gigant , Jeffrey Quesnelle

Test-Time Scaling (TTS) improves the reasoning performance of Large Language Models (LLMs) by allocating additional compute during inference. We conduct a structured survey of TTS methods and categorize them into sampling-based,…

Computation and Language · Computer Science 2025-06-06 Ho-Lam Chung , Teng-Yun Hsiao , Hsiao-Ying Huang , Chunerh Cho , Jian-Ren Lin , Zhang Ziwei , Yun-Nung Chen

Latent reasoning offers a computation-efficient alternative to Chain-of-Thought but often suffers from performance degradation due to distributional misalignment and ambiguous chain definitions. Ideally, latent reasoning should function as…

Computation and Language · Computer Science 2026-02-02 Jingcheng Deng , Liang Pang , Zihao Wei , Shicheng Xu , Zenghao Duan , Kun Xu , Yang Song , Huawei Shen , Xueqi Cheng

Tokenization serves as a foundational step for Large Language Models (LLMs) to process text. In new domains or languages, the inefficiency of the tokenizer will slow down the training and generation of LLM. The mismatch in vocabulary also…

Computation and Language · Computer Science 2025-06-05 Chong Li , Jiajun Zhang , Chengqing Zong

Tokenization is the first - and often underappreciated - layer of computation in language models. While Chain-of-Thought (CoT) prompting enables transformer models to approximate recurrent computation by externalizing intermediate steps, we…

Computation and Language · Computer Science 2025-05-21 Xiang Zhang , Juntai Cao , Jiaqi Wei , Yiwei Xu , Chenyu You

Language-independent tokenisation (LIT) methods that do not require labelled language resources or lexicons have recently gained popularity because of their applicability in resource-poor languages. Moreover, they compactly represent a…

Computation and Language · Computer Science 2020-02-26 Danushka Bollegala , Ryuichi Kiryo , Kosuke Tsujino , Haruki Yukawa

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

Tokenization shapes how language models perceive morphology and meaning in NLP, yet widely used frequency-driven subword tokenizers (e.g., Byte Pair Encoding and WordPiece) can fragment morphologically rich and agglutinative languages in…

Computation and Language · Computer Science 2026-04-01 M. Ali Bayram , Ali Arda Fincan , Ahmet Semih Gümüş , Sercan Karakaş , Banu Diri , Savaş Yıldırım , Demircan Çelik
‹ Prev 1 2 3 10 Next ›