English
Related papers

Related papers: Swapping Lemmas for Regular and Context-Free Langu…

200 papers

Ambiguous words or underspecified references require interlocutors to resolve them, often by relying on shared context and commonsense knowledge. Therefore, we systematically investigate whether Large Language Models (LLMs) can leverage…

Computation and Language · Computer Science 2025-09-22 Lukas Ellinger , Georg Groh

Recently, pretrained language models (PLMs) have had exceptional success in language generation. To leverage the rich knowledge encoded by PLMs, a simple yet powerful paradigm is to use prompts in the form of either discrete tokens or…

Computation and Language · Computer Science 2022-10-04 Tianyi Tang , Junyi Li , Wayne Xin Zhao , Ji-Rong Wen

With the advent of Large Language Models (LLMs), generating rule-based data for real-world applications has become more accessible. Due to the inherent ambiguity of natural language and the complexity of rule sets, especially in long…

Computation and Language · Computer Science 2025-04-21 Teng Wang , Zhenqi He , Wing-Yin Yu , Xiaojin Fu , Xiongwei Han

We argue that language models (LMs) have strong potential as investigative tools for probing the distinction between possible and impossible natural languages and thus uncovering the inductive biases that support human language learning. We…

Computation and Language · Computer Science 2025-12-11 Julie Kallini , Christopher Potts

Over the past few years, the abilities of large language models (LLMs) have received extensive attention, which have performed exceptionally well in complicated scenarios such as logical reasoning and symbolic inference. A significant…

Computation and Language · Computer Science 2024-02-20 Junbing Yan , Chengyu Wang , Jun Huang , Wei Zhang

English verbs have multiple forms. For instance, talk may also appear as talks, talked or talking, depending on the context. The NLP task of lemmatization seeks to map these diverse forms back to a canonical one, known as the lemma. We…

Computation and Language · Computer Science 2024-05-29 Chaitanya Malaviya , Shijie Wu , Ryan Cotterell

Large language models (LLMs) can explain grammatical rules, yet they often fail to apply those rules when judging sentence acceptability. We present "grammar prompting", an explain-then-process paradigm: a large LLM first produces a concise…

Computation and Language · Computer Science 2025-06-04 Russell Scheinberg , Ameeta Agrawal , Amber Shore , So Young Lee

We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…

Computational Complexity · Computer Science 2007-05-23 Ming Li , Paul Vitanyi

Lexical ambiguity is widespread in language, allowing for the reuse of economical word forms and therefore making language more efficient. If ambiguous words cannot be disambiguated from context, however, this gain in efficiency might make…

Computation and Language · Computer Science 2024-05-29 Tiago Pimentel , Rowan Hall Maudslay , Damián Blasi , Ryan Cotterell

A recent study on structural properties of regular and context-free languages has greatly promoted our basic understandings of the complex behaviors of those languages. We continue the study to examine how regular languages behave when they…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Tomoyuki Yamakami , Yuichi Kato

We propose to cast the task of morphological inflection - mapping a lemma to an indicated inflected form - for resource-poor languages as a meta-learning problem. Treating each language as a separate task, we use data from high-resource…

Computation and Language · Computer Science 2020-04-29 Katharina Kann , Samuel R. Bowman , Kyunghyun Cho

Users interacting with Large Language Models (LLMs) in a multi-turn conversation routinely refine their requests or pivot to new topics. LLMs, however, often miss these topic shifts and carry over irrelevant context from previous turns,…

Computation and Language · Computer Science 2026-05-12 Aditya Sinha , Harald Steck , Vito Ostuni , Matteo Rinaldi

Language technologies that accurately model the dynamics of events must perform commonsense reasoning. Existing work evaluating commonsense reasoning focuses on making inferences about common, everyday situations. To instead investigate the…

Computation and Language · Computer Science 2024-05-02 Wenting Zhao , Justin T Chiu , Jena D. Hwang , Faeze Brahman , Jack Hessel , Sanjiban Choudhury , Yejin Choi , Xiang Lorraine Li , Alane Suhr

Large language models (LLMs) are the result of a massive experiment in bottom-up, data-driven reverse engineering of language at scale. Despite their utility in a number of downstream NLP tasks, ample research has shown that LLMs are…

Artificial Intelligence · Computer Science 2024-08-05 Walid S. Saba

Automatic fact-checking plays a crucial role in combating the spread of misinformation. Large Language Models (LLMs) and Instruction-Following variants, such as InstructGPT and Alpaca, have shown remarkable performance in various natural…

Computation and Language · Computer Science 2023-09-04 Tsun-Hin Cheung , Kin-Man Lam

Recent advances in Language Models (LMs) have failed to mask their shortcomings particularly in the domain of reasoning. This limitation impacts several tasks, most notably those involving ontology engineering. As part of a PhD research, we…

Artificial Intelligence · Computer Science 2025-09-15 Hanna Abi Akl

Language models (LMs) are often expected to generate strings in some formal language; for example, structured data, API calls, or code snippets. Although LMs can be tuned to improve their adherence to formal syntax, this does not guarantee…

Computation and Language · Computer Science 2024-08-06 Terry Koo , Frederick Liu , Luheng He

Slang is a commonly used type of informal language that poses a daunting challenge to NLP systems. Recent advances in large language models (LLMs), however, have made the problem more approachable. While LLM agents are becoming more widely…

Computation and Language · Computer Science 2025-09-22 Siyang Wu , Zhewei Sun

Prompt engineering has emerged as an indispensable technique for extending the capabilities of large language models (LLMs) and vision-language models (VLMs). This approach leverages task-specific instructions, known as prompts, to enhance…

Artificial Intelligence · Computer Science 2025-03-18 Pranab Sahoo , Ayush Kumar Singh , Sriparna Saha , Vinija Jain , Samrat Mondal , Aman Chadha

Large Language Models (LLMs) are increasingly used for recommendation tasks due to their general-purpose capabilities. While LLMs perform well in rich-context settings, their behavior in cold-start scenarios, where only limited signals such…

Information Retrieval · Computer Science 2025-09-09 Alexandre Andre , Gauthier Roy , Eva Dyer , Kai Wang