English
Related papers

Related papers: Exploring a type-theoretic approach to accessibili…

200 papers

The variation of word meaning according to the context leads us to enrich the type system of our syntactical and semantic analyser of French based on categorial grammars and Montague semantics (or lambda-DRT). The main advantage of a deep…

Computation and Language · Computer Science 2013-05-20 Christian Retoré

A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed…

Artificial Intelligence · Computer Science 2015-02-10 Evgenij Thorstensen

We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values),…

Logic in Computer Science · Computer Science 2008-12-01 Adel Bouhoula , Florent Jacquemard

We present a joint modeling approach to identify salient discussion points in spoken meetings as well as to label the discourse relations between speaker turns. A variation of our model is also discussed when discourse relations are treated…

Computation and Language · Computer Science 2017-05-16 Kechen Qin , Lu Wang , Joseph Kim

Discovering pattern sets or global patterns is an attractive issue from the pattern mining community in order to provide useful information. By combining local patterns satisfying a joint meaning, this approach produces patterns of higher…

Machine Learning · Computer Science 2011-07-19 Patrice Boizumault , Bruno Crémilleux , Mehdi Khiari , Samir Loudni , Jean-Philippe Métivier

For text summarization, the role of discourse structure is pivotal in discerning the core content of a text. Regrettably, prior studies on incorporating Rhetorical Structure Theory (RST) into transformer-based summarization models only…

Computation and Language · Computer Science 2024-12-11 Dongqi Liu , Yifan Wang , Vera Demberg

Some linguistic constraints cannot be effectively resolved during parsing at the location in which they are most naturally introduced. This paper shows how constraints can be propagated in a memoizing parser (such as a chart parser) in much…

cmp-lg · Computer Science 2008-02-03 Mark Johnson , Jochen Dörre

We study the problem of clustering with relative constraints, where each constraint specifies relative similarities among instances. In particular, each constraint $(x_i, x_j, x_k)$ is acquired by posing a query: is instance $x_i$ more…

Machine Learning · Computer Science 2015-01-05 Yuanli Pei , Xiaoli Z. Fern , Rómer Rosales , Teresa Vania Tjahja

A grammar model for concurrent, object-oriented natural language parsing is introduced. Complete lexical distribution of grammatical knowledge is achieved building upon the head-oriented notions of valency and dependency, while inheritance…

cmp-lg · Computer Science 2008-02-03 Norbert Broeker , Udo Hahn , Susanne Schacht

The research explores the utilization of a deep learning model employing an attention mechanism in medical text mining. It targets the challenge of analyzing unstructured text information within medical data. This research seeks to enhance…

Computation and Language · Computer Science 2024-06-04 Lingxi Xiao , Muqing Li , Yinqiu Feng , Meiqi Wang , Ziyi Zhu , Zexi Chen

The paper demonstrates that strict adherence to probability theory does not preclude the use of concurrent, self-activated constraint-propagation mechanisms for managing uncertainty. Maintaining local records of sources-of-belief allows…

Artificial Intelligence · Computer Science 2013-04-15 Judea Pearl

We study safety verification for multithreaded programs with recursive parallelism (i.e. unbounded thread creation and recursion) as well as unbounded integer variables. Since the threads in each program configuration are structured in a…

Logic in Computer Science · Computer Science 2016-05-24 Matthew Hague , Anthony Widjaja Lin

This paper introduces a novel annotation framework for the fine-grained modeling of Noun Phrases' (NPs) genericity in natural language. The framework is designed to be simple and intuitive, making it accessible to non-expert annotators and…

Computation and Language · Computer Science 2024-04-02 Claudia Collacciani , Andrea Amelio Ravelli , Marianna Marcella Bolognesi

This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…

Programming Languages · Computer Science 2011-01-25 Vilhelm Sjöberg , Aaron Stump

We model coherent conversation continuation via RNN-based dialogue models equipped with a dynamic attention mechanism. Our attention-RNN language model dynamically increases the scope of attention on the history as the conversation…

Computation and Language · Computer Science 2016-11-22 Hongyuan Mei , Mohit Bansal , Matthew R. Walter

We study the tractability of conjunctive query answering for queries with unbounded arity. It is well known that tractability of the problem can be characterised in terms of the queries treewidth under the assumption of bounded arity. We…

Databases · Computer Science 2022-06-14 Matthias Lanzinger

Multinomial processing tree (MPT) models are tools for disentangling the contributions of latent cognitive processes in a given experimental paradigm. The present note analyzes MPT models subject to order constraints on subsets of its…

Applications · Statistics 2014-11-11 Karl Christoph Klauer , Henrik Singmann , David Kellen

In this work, we focus on the problem of retrieving relevant arguments for a query claim covering diverse aspects. State-of-the-art methods rely on explicit mappings between claims and premises, and thus are unable to utilize large…

Information Retrieval · Computer Science 2021-03-18 Michael Fromm , Max Berrendorf , Sandra Obermeier , Thomas Seidl , Evgeniy Faerman

We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla. The only multiplicity we explicitly consider is two, namely one dimension…

Computation and Language · Computer Science 2007-05-23 Jørgen Villadsen

Knowledge graphs store large numbers of relations efficiently, but they remain weak at representing a quieter difficulty: the meaning of a concept often shifts with the domain in which it is used. A triple such as Apple, instance-of,…

Artificial Intelligence · Computer Science 2026-04-07 Chao Li , Yuru Wang , Chunyi Zhao