English
Related papers

Related papers: The Compactness of Construction Grammars

200 papers

This paper presents a novel framework for evaluating Neural Language Models' linguistic abilities using a constructionist approach. Not only is the usage-based model in line with the underlying stochastic philosophy of neural architectures,…

Computation and Language · Computer Science 2024-11-12 Ludovica Pannitto , Aurélie Herbelot

The need for rigorous process composition is encountered in many situations pertaining to the development and analysis of complex systems. We discuss the use of Classical Linear Logic (CLL) for correct-by-construction resource-based process…

Logic in Computer Science · Computer Science 2018-08-20 Petros Papapanagiotou , Jacques Fleuriot

Large Language Models (LLMs) are increasingly used to generate textual explanations of process models discovered from event logs. Producing explanations from large behavioral abstractions (e.g., directly-follows graphs or Petri nets) can be…

Machine Learning · Computer Science 2025-10-14 P. van Oerle , R. H. Bemthuis , F. A. Bukhsh

An efficient representation of observed data has many benefits in various domains of engineering and science. Representing static data sets, such as images, is a living branch in machine learning and eases downstream tasks, such as…

Systems and Control · Computer Science 2018-09-28 Friedrich Solowjow , Arash Mehrjou , Bernhard Schölkopf , Sebastian Trimpe

Concept-to-text generation typically employs a pipeline architecture, which often leads to suboptimal texts. Content selection, for example, may greedily select the most important facts, which may require, however, too many words to…

Computation and Language · Computer Science 2018-11-02 Gerasimos Lampouras , Ion Androutsopoulos

Ontology, and more broadly, Knowledge Graph Matching is a challenging task in which expressiveness has not been fully addressed. Despite the increasing use of embeddings and language models for this task, approaches for generating…

Computation and Language · Computer Science 2025-02-20 Guilherme Sousa , Rinaldo Lima , Cassia Trojahn

Concept learning becomes possible only when existing representations fail to account for experience. Most models of learning and inference, however, presuppose a fixed representational basis within which belief updating occurs. In this…

Artificial Intelligence · Computer Science 2025-12-23 Chainarong Amornbunchornvej

We train neural networks to optimize a Minimum Description Length score, i.e., to balance between the complexity of the network and its accuracy at a task. We show that networks optimizing this objective function master tasks involving…

Computation and Language · Computer Science 2022-04-01 Nur Lan , Michal Geyer , Emmanuel Chemla , Roni Katzir

Networks are fundamental models for data used in practically every application domain. In most instances, several implicit or explicit choices about the network definition impact the translation of underlying data to a network…

Artificial Intelligence · Computer Science 2018-01-12 Ivan Brugere , Tanya Y. Berger-Wolf

Measuring what linguistic information is encoded in neural models of language has become popular in NLP. Researchers approach this enterprise by training "probes" - supervised models designed to extract linguistic structure from another…

Computation and Language · Computer Science 2020-05-13 Rowan Hall Maudslay , Josef Valvoda , Tiago Pimentel , Adina Williams , Ryan Cotterell

For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$. We study the…

Computational Complexity · Computer Science 2024-08-07 Lijie Chen , Ce Jin , Rahul Santhanam , Ryan Williams

This short note presents a new formal language, lambda dependency-based compositional semantics (lambda DCS) for representing logical forms in semantic parsing. By eliminating variables and making existential quantification implicit, lambda…

Artificial Intelligence · Computer Science 2013-09-19 Percy Liang

We give an optimal (EXPTIME), sound and complete tableau-based algorithm for deciding satisfiability for propositional dynamic logic with converse (CPDL) which does not require the use of analytic cut. Our main contribution is a sound…

Logic in Computer Science · Computer Science 2010-04-16 Rajeev Goré , Florian Widmann

DL^N is a recent approach that extends description logics with defeasible reasoning capabilities. In this paper we provide an overview on DL^N, illustrating the underlying knowledge engineering requirements as well as the characteristic…

Artificial Intelligence · Computer Science 2020-09-18 Piero A. Bonatti , Iliana M. Petrova , Luigi Sauro

As deep neural models in NLP become more complex, and as a consequence opaque, the necessity to interpret them becomes greater. A burgeoning interest has emerged in rationalizing explanations to provide short and coherent justifications for…

Computation and Language · Computer Science 2024-05-21 Neema Kotonya , Francesca Toni

Complex feature extractors are widely employed for text representation building. However, these complex feature extractors make the NLP systems prone to overfitting especially when the downstream training datasets are relatively small,…

Computation and Language · Computer Science 2023-09-11 Ming Li , Ruihong Huang

Research on dialogue constructiveness assessment focuses on (i) analysing conversational factors that influence individuals to take specific actions, win debates, change their perspectives or broaden their open-mindedness and (ii)…

Computation and Language · Computer Science 2024-10-03 Lexin Zhou , Youmna Farag , Andreas Vlachos

The logical negation property (LNP), which implies generating different predictions for semantically opposite inputs, is an important property that a trustworthy language model must satisfy. However, much recent evidence shows that…

Computation and Language · Computer Science 2022-08-12 Myeongjun Jang , Frank Mtumbuka , Thomas Lukasiewicz

Modern NLP models rely heavily on engineered features, which often combine word and contextual information into complex lexical features. Such combination results in large numbers of features, which can lead to over-fitting. We present a…

Computation and Language · Computer Science 2016-04-05 Mo Yu , Mark Dredze , Raman Arora , Matthew Gormley

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can…

Logic in Computer Science · Computer Science 2007-05-23 Ian Horrocks , Ulrike Sattler , Stephan Tobies
‹ Prev 1 3 4 5 6 7 10 Next ›