English
Related papers

Related papers: Specimens: "most of" generic NPs in a contextually…

200 papers

We argue for a compositional semantics grounded in a strongly typed ontology that reflects our commonsense view of the world and the way we talk about it. Assuming such a structure we show that the semantics of various natural language…

Artificial Intelligence · Computer Science 2007-05-23 Walid S. Saba

The semantics of determiner phrases, be they definite de- scriptions, indefinite descriptions or quantified noun phrases, is often as- sumed to be a fully solved question: common nouns are properties, and determiners are generalised…

Computation and Language · Computer Science 2016-03-02 Christian Retoré

Cognitive theories for reasoning are about understanding how humans come to conclusions from a set of premises. Starting from hypothetical thoughts, we are interested which are the implications behind basic everyday language and how do we…

Artificial Intelligence · Computer Science 2022-05-11 Emmanuelle Dietz , Johannes K. Fichte , Florim Hamiti

Techniques in which words are represented as vectors have proved useful in many applications in computational linguistics, however there is currently no general semantic formalism for representing meaning in terms of vectors. We present a…

Computation and Language · Computer Science 2015-03-17 Daoud Clarke

In previous work with J. Hedges, we formalised a generalised quantifiers theory of natural language in categorical compositional distributional semantics with the help of bialgebras. In this paper, we show how quantifier scope ambiguity can…

Computation and Language · Computer Science 2016-08-05 Mehrnoosh Sadrzadeh

Natural language semantics has recently sought to combine the complementary strengths of formal and distributional approaches to meaning. More specifically, proposals have been put forward to augment formal semantic machinery with…

Computation and Language · Computer Science 2021-03-03 Noortje J. Venhuizen , Petra Hendriks , Matthew W. Crocker , Harm Brouwer

We study approximations of theories both in general context and with respect to some natural classes of theories. Some kinds of approximations are considered, connections with finitely axiomatizable theories and minimal generating sets of…

Logic · Mathematics 2019-01-28 Sergey Sudoplatov

A perspective of statistical language models which emphasizes their collocational aspect is advocated. It is suggested that strings be generalized in terms of classes of relationships instead of classes of objects. The single most important…

cmp-lg · Computer Science 2008-02-03 Robert John Freeman

Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these…

Group Theory · Mathematics 2018-04-25 Frédérique Bassino , Cyril Nicaud , Pascal Weil

We propose a grounded approach to meaning in language typology. We treat data from perceptual modalities, such as images, as a language-agnostic representation of meaning. Hence, we can quantify the function--form relationship between…

Computation and Language · Computer Science 2024-12-16 Coleman Haley , Sharon Goldwater , Edoardo Ponti

Beyond individual languages, multilingual natural language processing (NLP) research increasingly aims to develop models that perform well across languages generally. However, evaluating these systems on all the world's languages is…

Computation and Language · Computer Science 2025-09-09 Esther Ploeger , Wessel Poelman , Andreas Holck Høeg-Petersen , Anders Schlichtkrull , Miryam de Lhoneux , Johannes Bjerva

To a good extent, words can be understood as corresponding to patterns or categories that appeared in order to represent concepts and structures that are particularly important or useful in a given time and space. Words are characterized by…

Computation and Language · Computer Science 2021-07-21 Henrique Ferraz de Arruda , Luciano da Fontoura Costa

To make sense of massive data, we often fit simplified models and then interpret the parameters; for example, we cluster the text embeddings and then interpret the mean parameters of each cluster. However, these parameters are often…

Artificial Intelligence · Computer Science 2025-01-14 Ruiqi Zhong , Heng Wang , Dan Klein , Jacob Steinhardt

ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…

Logic · Mathematics 2019-06-14 Paul Blain Levy

Training data for text classification is often limited in practice, especially for applications with many output classes or involving many related classification problems. This means classifiers must generalize from limited evidence, but…

Computation and Language · Computer Science 2020-05-19 Abhijit Mahabal , Jason Baldridge , Burcu Karagol Ayan , Vincent Perot , Dan Roth

An essential task of groups is to provide efficient solutions for the complex problems they face. Indeed, considerable efforts have been devoted to the question of collective decision-making related to problems involving a single dominant…

Physics and Society · Physics 2017-04-05 Anna Zafeiris , Zsombor Koman , Enys Mones , Tamás Vicsek

Probabilistic word embeddings have shown effectiveness in capturing notions of generality and entailment, but there is very little work on doing the analogous type of investigation for sentences. In this paper we define probabilistic models…

Computation and Language · Computer Science 2020-05-19 Mingda Chen , Kevin Gimpel

Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…

Category Theory · Mathematics 2024-12-31 Benedikt Ahrens , Peter LeFanu Lumsdaine , Paige Randall North

Word class flexibility refers to the phenomenon whereby a single word form is used across different grammatical categories. Extensive work in linguistic typology has sought to characterize word class flexibility across languages, but…

Computation and Language · Computer Science 2020-09-22 Bai Li , Guillaume Thomas , Yang Xu , Frank Rudzicz

A standard form of analysis for linguistic typology is the universal implication. These implications state facts about the range of extant languages, such as ``if objects come after verbs, then adjectives come after nouns.'' Such…

Computation and Language · Computer Science 2009-07-07 Hal Daumé , Lyle Campbell