English
Related papers

Related papers: Pumping lemmas for classes of languages generated …

200 papers

A major target of linguistics and cognitive science has been to understand what class of learning systems can acquire the key structures of natural language. Until recently, the computational requirements of language have been used to argue…

Artificial Intelligence · Computer Science 2022-01-27 Yuan Yang

While large language models (LLMs) appear to be increasingly capable of solving compositional tasks, it is an open question whether they do so using compositional mechanisms. In this work, we investigate how feedforward LLMs solve two-hop…

Computation and Language · Computer Science 2026-05-11 Apoorv Khandelwal , Ellie Pavlick

In `free word order' languages, every sentence is embedded in its specific context. Among others, the order of constituents is determined by the categories `theme', `rheme' and `contrastive focus'. This paper shows how to recognise and to…

cmp-lg · Computer Science 2008-02-03 Ralf Steinberger

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

System prompts provide a lightweight yet powerful mechanism for conditioning large language models (LLMs) at inference time. While prior work has focused on English-only settings, real-world deployments benefit from having a single prompt…

Computation and Language · Computer Science 2025-12-03 Lechen Zhang , Yusheng Zhou , Tolga Ergen , Lajanugen Logeswaran , Moontae Lee , David Jurgens

Neural language models (LMs) have shown to benefit significantly from enhancing word vectors with subword-level information, especially for morphologically rich languages. This has been mainly tackled by providing subword-level information…

Computation and Language · Computer Science 2019-10-28 Yash Shah , Ishan Tarunesh , Harsh Deshpande , Preethi Jyothi

Morphological inflection generation is the task of generating the inflected form of a given lemma corresponding to a particular linguistic transformation. We model the problem of inflection generation as a character sequence to sequence…

Computation and Language · Computer Science 2016-03-23 Manaal Faruqui , Yulia Tsvetkov , Graham Neubig , Chris Dyer

Biological cells are the prototypical example of active matter. Cells sense and respond to mechanical, chemical and electrical environmental stimuli with a range of behaviors, including dynamic changes in morphology and mechanical…

Computational Engineering, Finance, and Science · Computer Science 2017-02-28 Endre Somogyi , James A. Glazier

Endowing Large Multimodal Models (LMMs) with visual grounding capability can significantly enhance AIs' understanding of the visual world and their interaction with humans. However, existing methods typically fine-tune the parameters of…

Computer Vision and Pattern Recognition · Computer Science 2025-04-14 Size Wu , Sheng Jin , Wenwei Zhang , Lumin Xu , Wentao Liu , Wei Li , Chen Change Loy

Spreading dynamics is a central topic in the physics of complex systems and network science, providing a unified framework for understanding how information, behaviors, and diseases propagate through interactions among system units. In many…

Physics and Society · Physics 2026-02-10 Shuyu Jiang , Hao Ren , Yichang Gao , Yi-Cheng Zhang , Li Qi , Dayong Xiao , Jie Fan , Rui Tang , Wei Wang

Large Language Models (LLM) have emerged as a tool for robots to generate task plans using common sense reasoning. For the LLM to generate actionable plans, scene context must be provided, often through a map. Recent works have shifted from…

Robotics · Computer Science 2024-09-25 Mike Zhang , Kaixian Qu , Vaishakh Patil , Cesar Cadena , Marco Hutter

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

Do LLMs understand the meaning of the texts they generate? Do they possess a semantic grounding? And how could we understand whether and what they understand? I start the paper with the observation that we have recently witnessed a…

Computation and Language · Computer Science 2024-02-20 Holger Lyre

Semantic parsing is the task of obtaining machine-interpretable representations from natural language text. We consider one such formal representation - First-Order Logic (FOL) and explore the capability of neural models in parsing English…

Computation and Language · Computer Science 2020-02-18 Hrituraj Singh , Milan Aggrawal , Balaji Krishnamurthy

Language models (LMs) are sentence-completion engines trained on massive corpora. LMs have emerged as a significant breakthrough in natural-language processing, providing capabilities that go far beyond sentence completion including…

Artificial Intelligence · Computer Science 2021-10-26 Robert E. Wray , III , James R. Kirk , John E. Laird

Tree-controlled grammars are context-free grammars where the derivation process is controlled in such a way that every word on a level of the derivation tree must belong to a certain control language. We investigate the generative capacity…

Computational Complexity · Computer Science 2023-09-07 Bianca Truthe

We propose a human in the loop approach for black-box testing of Functional Mock-up Units (FMUs) using Large Language Models (LLMs). The goal is to reduce the manual effort in defining test scenarios for dynamic simulation models and to…

Software Engineering · Computer Science 2026-04-29 Abdullah Mughees , Gaadha Sudheerbabu , Tanwir Ahmad , Dragos Truscan , Mikael Manngård , Kristian Klemets

We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author's pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples…

Formal Languages and Automata Theory · Computer Science 2012-06-15 Alexander Kartzow , Paweł Parys

Large language models (LLMs) work by manipulating the geometry of input embedding vectors over multiple layers. Here, we ask: how are the input vocabulary representations of language models structured, and how and when does this structure…

Computation and Language · Computer Science 2025-10-10 Isabel Papadimitriou , Jacob Prince

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