English
Related papers

Related papers: Inconsistent Tokenizations Cause Language Models t…

200 papers

The capabilities and limitations of Large Language Models have been sketched out in great detail in recent years, providing an intriguing yet conflicting picture. On the one hand, LLMs demonstrate a general ability to solve problems. On the…

Surprisal theory posits that the processing difficulty of a word is determined by its predictability in context, offering a potential link between human sentence processing and next-word predictions from language models. While language…

Computation and Language · Computer Science 2026-05-18 William Timkey , Brian Dillon , Tal Linzen

Large language models are increasingly relied upon as sources of information, but their propensity for generating false or misleading statements with high confidence poses risks for users and society. In this paper, we confront the critical…

Language models typically tokenize text into subwords, using a deterministic, hand-engineered heuristic of combining characters into longer surface-level strings such as 'ing' or whole words. Recent literature has repeatedly shown the…

Computation and Language · Computer Science 2023-10-19 Avijit Thawani , Saurabh Ghanekar , Xiaoyuan Zhu , Jay Pujara

Recent studies have shown that Large Language Models (LLMs) have the potential to process extremely long text. Many works only evaluate LLMs' long-text processing ability on the language modeling task, with perplexity (PPL) as the…

Computation and Language · Computer Science 2024-05-13 Yutong Hu , Quzhe Huang , Mingxu Tao , Chen Zhang , Yansong Feng

Prompt sensitivity, referring to the phenomenon where paraphrasing (i.e., repeating something written or spoken using different words) leads to significant changes in large language model (LLM) performance, has been widely accepted as a…

Computation and Language · Computer Science 2025-09-03 Andong Hua , Kenan Tang , Chenhe Gu , Jindong Gu , Eric Wong , Yao Qin

Large Language Models (LLMs) can produce verbalized self-explanations, yet prior studies suggest that such rationales may not reliably reflect the model's true decision process. We ask whether these explanations nevertheless help users…

Computation and Language · Computer Science 2026-01-08 Pingjun Hong , Benjamin Roth

Large language models (LLMs) have demonstrated potential in reasoning tasks, but their performance on linguistics puzzles remains consistently poor. These puzzles, often derived from Linguistics Olympiad (LO) contests, provide a minimal…

Latest instruction-tuned large language models (LLM) show great results on various tasks, however, they often face performance degradation for non-English input. There is evidence that the reason lies in inefficient tokenization caused by…

Computation and Language · Computer Science 2023-12-06 Mikhail Tikhomirov , Daniil Chernyshev

Large language models have exhibited impressive performance across a broad range of downstream tasks in natural language processing. However, how a language model predicts the next token and generates content is not generally understandable…

Like students facing hard exam questions, large language models sometimes guess when uncertain, producing plausible yet incorrect statements instead of admitting uncertainty. Such "hallucinations" persist even in state-of-the-art systems…

Computation and Language · Computer Science 2025-09-08 Adam Tauman Kalai , Ofir Nachum , Santosh S. Vempala , Edwin Zhang

Grammatical features across human languages show intriguing correlations often attributed to learning biases in humans. However, empirical evidence has been limited to experiments with highly simplified artificial languages, and whether…

Computation and Language · Computer Science 2025-02-19 Tianyang Xu , Tatsuki Kuribayashi , Yohei Oseki , Ryan Cotterell , Alex Warstadt

Multi-round incomplete information tasks are crucial for evaluating the lateral thinking capabilities of large language models (LLMs). Currently, research primarily relies on multiple benchmarks and automated evaluation metrics to assess…

Computation and Language · Computer Science 2025-06-02 Wenhan Dong , Tianyi Hu , Jingyi Zheng , Zhen Sun , Yuemeng Zhao , Yule Liu , Xinlei He , Xinyi Huang

We formulate language modeling as a matrix factorization problem, and show that the expressiveness of Softmax-based models (including the majority of neural language models) is limited by a Softmax bottleneck. Given that natural language is…

Computation and Language · Computer Science 2018-03-06 Zhilin Yang , Zihang Dai , Ruslan Salakhutdinov , William W. Cohen

Recent work has shown that generation from a prompted or fine-tuned language model can perform well at semantic parsing when the output is constrained to be a valid semantic representation. We introduce BenchCLAMP, a Benchmark to evaluate…

Computation and Language · Computer Science 2024-01-11 Subhro Roy , Sam Thomson , Tongfei Chen , Richard Shin , Adam Pauls , Jason Eisner , Benjamin Van Durme

Large language models (LLMs) have achieved remarkable progress in linguistic tasks, necessitating robust evaluation frameworks to understand their capabilities and limitations. Inspired by Feynman's principle of understanding through…

Computation and Language · Computer Science 2024-06-11 Zhiquan Tan , Lai Wei , Jindong Wang , Xing Xie , Weiran Huang

Recent progress in natural language processing (NLP) owes much to remarkable advances in large language models (LLMs). Nevertheless, LLMs frequently "hallucinate," resulting in non-factual outputs. Our carefully-designed human evaluation…

Computation and Language · Computer Science 2024-03-22 Jian Guan , Jesse Dodge , David Wadden , Minlie Huang , Hao Peng

Large Language Models (LLMs) are prone to generating fluent but incorrect content, known as confabulation, which poses increasing risks in multi-turn or agentic applications where outputs may be reused as context. In this work, we…

Computation and Language · Computer Science 2026-03-18 Tianyi Zhou , Johanne Medina , Sanjay Chawla

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

In this paper, we present a challenging code reasoning task: vulnerability detection. Large Language Models (LLMs) have shown promising results in natural-language and math reasoning, but state-of-the-art (SOTA) models reported only 54.5%…

Software Engineering · Computer Science 2025-01-09 Benjamin Steenhoek , Md Mahbubur Rahman , Monoshi Kumar Roy , Mirza Sanjida Alam , Hengbo Tong , Swarna Das , Earl T. Barr , Wei Le