English
Related papers

Related papers: Intensional Verbs Without Type-Raising or Lexical …

200 papers

Sentence-level relation extraction (RE) aims to identify the relationship between 2 entities given a contextual sentence. While there have been many attempts to solve this problem, the current solutions have a lot of room to improve. In…

Computation and Language · Computer Science 2023-07-04 N Harsha Vardhan , Manav Chaudhary

Epistemic logics of intensional groups lift the assumption that membership in a group of agents is common knowledge. Instead of being represented directly as a set of agents, intensional groups are represented by a property that may change…

Logic in Computer Science · Computer Science 2023-07-12 Marta Bílková , Igor Sedlár

This paper is a short empirical study of the performance of centrality and classification based iterative term set expansion methods for distributional semantic models. Iterative term set expansion is an interactive process using…

Computation and Language · Computer Science 2018-02-15 Amaru Cuba Gyllensten , Magnus Sahlgren

Contemporary use of the term 'intension' derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intensional FOL (First-order-logic) for P2P systems by fusing the…

Databases · Computer Science 2011-03-07 Zoran Majkic

The goal of our work is to use a set of reports and extract named entities, in our case the names of Industrial or Academic partners. Starting with an initial list of entities, we use a first set of documents to identify syntactic patterns…

Information Retrieval · Computer Science 2009-09-29 Thierry Despeyroux , Eduardo Fraschini , Anne-Marie Vercoustre

Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who…

Logic in Computer Science · Computer Science 2017-12-27 G. A. Kavvos

Recent work on vector-based compositional natural language semantics has proposed the use of density matrices to model lexical ambiguity and (graded) entailment (e.g. Piedeleu et al 2015, Bankova et al 2019, Sadrzadeh et al 2018). Ambiguous…

Computation and Language · Computer Science 2020-11-06 Adriana D. Correia , Michael Moortgat , Henk T. C. Stoof

Long-sequence transformers are designed to improve the representation of longer texts by language models and their performance on downstream document-level tasks. However, not much is understood about the quality of token-level predictions…

Computation and Language · Computer Science 2023-03-15 Kamil Bujel , Andrew Caines , Helen Yannakoudakis , Marek Rei

Lexical semantics is concerned with both the multiple senses a word can adopt in different contexts, and the semantic relations that exist between meanings of different words. To investigate them, Contextualized Language Models are a…

Computation and Language · Computer Science 2026-01-26 Bastien Liétard , Gabriel Loiseau

Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas…

Logic in Computer Science · Computer Science 2015-07-21 Constantin Enea , Mihaela Sighireanu , Zhilin Wu

In this paper we propose a categorical theory of intensionality. We first revisit the notion of intensionality, and discuss we its relevance to logic and computer science. It turns out that 1-category theory is not the most appropriate…

Logic in Computer Science · Computer Science 2017-04-27 G. A. Kavvos

We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…

Programming Languages · Computer Science 2025-10-08 Qiancheng Fu , Hongwei Xi

We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause…

cmp-lg · Computer Science 2016-08-31 Mary Dalrymple , Stuart M. Shieber , Fernando C. N. Pereira

Word frequency-based methods for extractive summarization are easy to implement and yield reasonable results across languages. However, they have significant limitations - they ignore the role of context, they offer uneven coverage of…

Computation and Language · Computer Science 2018-10-25 Archit Sakhadeo , Nisheeth Srivastava

Adjectives like pretty, beautiful and gorgeous describe positive properties of the nouns they modify but with different intensity. These differences are important for natural language understanding and reasoning. We propose a novel…

Computation and Language · Computer Science 2020-10-07 Aina Garí Soler , Marianna Apidianaki

Solving math word problems requires deductive reasoning over the quantities in the text. Various recent research efforts mostly relied on sequence-to-sequence or sequence-to-tree models to generate mathematical expressions without…

Computation and Language · Computer Science 2022-09-16 Zhanming Jie , Jierui Li , Wei Lu

At the heart of intuitionistic type theory lies an intuitive semantics called the "meaning explanations"; crucially, when meaning explanations are taken as definitive for type theory, the core notion is no longer "proof" but "verification".…

Logic in Computer Science · Computer Science 2016-07-18 Jonathan Sterling

Progress on deep language understanding is inhibited by the lack of a broad coverage lexicon that connects linguistic behavior to ontological concepts and axioms. We have developed COLLIE-V, a deep lexical resource for verbs, with the…

Computation and Language · Computer Science 2020-07-07 James Allen , Hannah An , Ritwik Bose , Will de Beaumont , Choh Man Teng

Contemporary use of the term 'intension' derives from the traditional logical Frege-Russell's doctrine that an idea (logic formula) has both an extension and an intension. From the Montague's point of view, the meaning of an idea can be…

Logic in Computer Science · Computer Science 2011-03-04 Zoran Majkic

Formal reasoning with non-denoting terms, esp. non-referring descriptions such as "the King of France", is still an under-investigated area. The recent exception being a series of papers e.g. by Indrzejczak, Zawidzki and K\"rbis. The…

Logic in Computer Science · Computer Science 2025-01-03 Jiří Raclavský