English
Related papers

Related papers: Anaphoric Binding: an integrated overview

200 papers

Bridging refers to the associative relationship between inferable entities in a discourse and the antecedents which allow us to understand them, such as understanding what "the door" means with respect to an aforementioned "house". As…

Computation and Language · Computer Science 2025-06-10 Lauren Levine , Amir Zeldes

We propose a system for the interpretation of anaphoric relationships between unbound pronouns and quantifiers. The main technical contribution of our proposal consists in combining generalized quantifiers with dependent types. Empirically,…

Logic · Mathematics 2016-08-02 Justyna Grudzinska , Marek Zawadowski

Anaphoric reference is an aspect of language interpretation covering a variety of types of interpretation beyond the simple case of identity reference to entities introduced via nominal expressions covered by the traditional coreference…

Computation and Language · Computer Science 2022-05-26 Silviu Paun , Juntao Yu , Nafise Sadat Moosavi , Massimo Poesio

In this paper we discuss the notion of "bridging" in Discourse Representation Theory as a tool to account for discourse referents that have only been established implicitly, through the lexical semantics of other referents. In doing so, we…

cmp-lg · Computer Science 2008-02-03 Johan Bos , Paul Buitelaar , Anne-Marie Mineur

Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…

Artificial Intelligence · Computer Science 2021-05-12 Steven Schockaert , Yazmín Ibáñez-García , Víctor Gutiérrez-Basulto

We provide a unified account of sentence-level and text-level anaphora within the framework of a dependency-based grammar model. Criteria for anaphora resolution within sentence boundaries rephrase major concepts from GB's binding theory,…

cmp-lg · Computer Science 2016-08-31 Michael Strube , Udo Hahn

Natural language definitions possess a recursive, self-explanatory semantic structure that can support representation learning methods able to preserve explicit conceptual relations and constraints in the latent space. This paper presents a…

Computation and Language · Computer Science 2024-02-19 Marco Valentino , Danilo S. Carvalho , André Freitas

Notional anaphors are pronouns which disagree with their antecedents' grammatical categories for notional reasons, such as plural to singular agreement in: 'the government ... they'. Since such cases are rare and conflict with evidence from…

Computation and Language · Computer Science 2018-04-23 Amir Zeldes

Resolving abstract anaphora is an important, but difficult task for text understanding. Yet, with recent advances in representation learning this task becomes a more tangible aim. A central property of abstract anaphora is that it…

Computation and Language · Computer Science 2017-07-24 Ana Marasović , Leo Born , Juri Opitz , Anette Frank

Pragmatics is core to natural language, enabling speakers to communicate efficiently with structures like ellipsis and anaphora that can shorten utterances without loss of meaning. These structures require a listener to interpret an…

Computation and Language · Computer Science 2023-08-17 Nicholas Edwards , Hannah Rohde , Henry Conklin

Although sloppy interpretation is usually accounted for by theories of ellipsis, it often arises in non-elliptical contexts. In this paper, a theory of sloppy interpretation is provided which captures this fact. The underlying idea is that…

cmp-lg · Computer Science 2008-02-03 Claire Gardent

All scientific interpretations of statistical outputs depend on background (auxiliary) assumptions that are rarely delineated or explicitly interrogated. These include not only the usual modeling assumptions, but also deeper assumptions…

Methodology · Statistics 2022-08-01 Sander Greenland , Zad Rafi , Robert Matthews , Megan Higgs

Research on metaphorical language has shown ties between abstractness and emotionality with regard to metaphoricity; prior work is however limited to the word and sentence levels, and up to date there is no empirical study establishing the…

Computation and Language · Computer Science 2022-05-19 Prisca Piccirilli , Sabine Schulte im Walde

We argue in this paper that many common adverbial phrases generally taken to signal a discourse relation between syntactically connected units within discourse structure, instead work anaphorically to contribute relational meaning, with…

Computation and Language · Computer Science 2007-05-23 Bonnie Webber , Matthew Stone , Aravind Joshi , Alistair Knott

We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…

Logic in Computer Science · Computer Science 2017-07-04 Lorenzo Gheri , Andrei Popescu

An account of utterance interpretation in discourse needs to face the issue of how the discourse context controls the space of interacting preferences. Assuming a discourse processing architecture that distinguishes the grammar and…

cmp-lg · Computer Science 2008-02-03 Megumi Kameyama

We probe pre-trained transformer language models for bridging inference. We first investigate individual attention heads in BERT and observe that attention heads at higher layers prominently focus on bridging relations in-comparison with…

Computation and Language · Computer Science 2021-04-20 Onkar Pandit , Yufang Hou

We explore the ability of word embeddings to capture both semantic and morphological similarity, as affected by the different types of linguistic properties (surface form, lemma, morphological tag) used to compose the representation of each…

Computation and Language · Computer Science 2017-04-07 Oded Avraham , Yoav Goldberg

We develop a unified categorical theory of substructural abstract syntax with variable binding and single-variable (capture-avoiding) substitution. This is done for the gamut of context structural rules given by exchange (linear theory)…

Logic in Computer Science · Computer Science 2025-06-02 Marcelo Fiore , Sanjiv Ranchod

We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…

Category Theory · Mathematics 2021-12-14 Matt Wilson , Augustin Vanrietvelde
‹ Prev 1 2 3 10 Next ›