English
Related papers

Related papers: The Compactness of Construction Grammars

200 papers

Modal logic is a paradigm for several useful and applicable formal systems in computer science. It generally retains the low complexity of classical propositional logic, but notable exceptions exist in the domains of description, temporal,…

Logic in Computer Science · Computer Science 2016-09-15 Davide Bresolin , Emilio Muñoz-Velasco , Guido Sciavicco

Neural language models trained with a predictive or masked objective have proven successful at capturing short and long distance syntactic dependencies. Here, we focus on verb argument structure in German, which has the interesting property…

Computation and Language · Computer Science 2021-03-05 Charlotte Rochereau , Benoît Sagot , Emmanuel Dupoux

Shifting to a lexicalized grammar reduces the number of parsing errors and improves application results. However, such an operation affects a syntactic parser in all its aspects. One of our research objectives is to design a realistic model…

Computation and Language · Computer Science 2007-11-22 Eric Laporte , Sébastien Paumier

Pretraining on large, semantically rich datasets is key for developing language models. Surprisingly, recent studies have shown that even synthetic data, generated procedurally through simple semantic-free algorithms, can yield some of the…

Machine Learning · Computer Science 2025-05-29 Zachary Shinnick , Liangze Jiang , Hemanth Saratchandran , Anton van den Hengel , Damien Teney

Causal language modeling (CLM) serves as the foundational framework underpinning remarkable successes of recent large language models (LLMs). Despite its success, the training approach for next word prediction poses a potential risk of…

Computation and Language · Computer Science 2024-09-06 DongNyeong Heo , Daniela Noemi Rim , Heeyoul Choi

Figurative language is ubiquitous in English. Yet, the vast majority of NLP research focuses on literal language. Existing text representations by design rely on compositionality, while figurative language is often non-compositional. In…

Computation and Language · Computer Science 2022-03-03 Tuhin Chakrabarty , Yejin Choi , Vered Shwartz

Contextual Markov Decision Processes (CMDPs) offer a framework for sequential decision-making under external signals, but existing methods often fail to generalize in high-dimensional or unstructured contexts, resulting in excessive…

Artificial Intelligence · Computer Science 2025-10-06 Peidong Liu , Junjiang Lin , Shaowen Wang , Yao Xu , Haiqing Li , Xuhao Xie , Siyi Wu , Hao Li

The principle of compositionality, which enables natural language to represent complex concepts via a structured combination of simpler ones, allows us to convey an open-ended set of messages using a limited vocabulary. If compositionality…

Computation and Language · Computer Science 2020-02-18 Yi Ren , Shangmin Guo , Matthieu Labeau , Shay B. Cohen , Simon Kirby

We study comparisons between interpretations in description logics with respect to "logical consequences" of the form of semi-positive concepts (like semi-positive concept assertions). Such comparisons are characterized by conditions…

Logic in Computer Science · Computer Science 2013-04-23 Ali Rezaei Divroodi , Linh Anh Nguyen

Explanation methods have emerged as an important tool to highlight the features responsible for the predictions of neural networks. There is mounting evidence that many explanation methods are rather unreliable and susceptible to malicious…

Computation and Language · Computer Science 2022-06-27 Shriya Atmakuri , Tejas Chheda , Dinesh Kandula , Nishant Yadav , Taesung Lee , Hessel Tuinhof

Recently, large language models (LLMs) have shown significant progress, approaching human perception levels. In this work, we demonstrate that despite these advances, LLMs still struggle to reason using molecular structural information.…

Machine Learning · Computer Science 2025-05-26 Yunhui Jang , Jaehyung Kim , Sungsoo Ahn

We solve an open problem related to an optimal encoding of a straight line program (SLP), a canonical form of grammar compression deriving a single string deterministically. We show that an information-theoretic lower bound for representing…

Data Structures and Algorithms · Computer Science 2013-06-18 Yasuo Tabei , Yoshimasa Takabatake , Hiroshi Sakamoto

Many NLP applications require models to be interpretable. However, many successful neural architectures, including transformers, still lack effective interpretation methods. A possible solution could rely on building explanations from…

Computation and Language · Computer Science 2024-04-04 Federico Ruggeri , Marco Lippi , Paolo Torroni

Though English sentences are typically inflexible vis-\`a-vis word order, constituents often show far more variability in ordering. One prominent theory presents the notion that constituent ordering is directly correlated with constituent…

Computation and Language · Computer Science 2025-02-18 Ada Defne Tur , Gaurav Kamath , Siva Reddy

We present an integer programming framework to build accurate and interpretable discrete linear classification models. Unlike existing approaches, our framework is designed to provide practitioners with the control and flexibility they need…

Methodology · Statistics 2014-10-03 Berk Ustun , Cynthia Rudin

Recursive processing is considered a hallmark of human linguistic abilities. A recent study evaluated recursive processing in recurrent neural language models (RNN-LMs) and showed that such models perform below chance level on embedded…

Computation and Language · Computer Science 2021-10-15 Yair Lakretz , Théo Desbordes , Dieuwke Hupkes , Stanislas Dehaene

Effective code generation with language models hinges on two critical factors: accurately understanding the intent of the prompt and generating code that applies algorithmic reasoning to produce correct solutions capable of passing diverse…

Artificial Intelligence · Computer Science 2025-10-21 Amir Jalilifard , Anderson de Rezende Rocha , Marcos Medeiros Raimundo

In the evaluation of attribution quality, the quantitative assessment of explanation legibility is particularly difficult, as it is influenced by varying shapes and internal organization of attributions not captured by simple statistics. To…

Artificial Intelligence · Computer Science 2026-04-01 Mohammad Mahdi Mesgari , Jackie Ma , Wojciech Samek , Sebastian Lapuschkin , Leander Weber

Abstractive summarization is an ideal form of summarization since it can synthesize information from multiple documents to create concise informative summaries. In this work, we aim at developing an abstractive summarizer. First, our…

Computation and Language · Computer Science 2016-09-23 Siddhartha Banerjee , Prasenjit Mitra , Kazunari Sugiyama

Abstract grammatical knowledge - of parts of speech and grammatical patterns - is key to the capacity for linguistic generalization in humans. But how abstract is grammatical knowledge in large language models? In the human literature,…

Computation and Language · Computer Science 2023-11-16 James A. Michaelov , Catherine Arnett , Tyler A. Chang , Benjamin K. Bergen