English
Related papers

Related papers: Stay Together: A System for Single and Split-antec…

200 papers

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

Now that the performance of coreference resolvers on the simpler forms of anaphoric reference has greatly improved, more attention is devoted to more complex aspects of anaphora. One limitation of virtually all coreference resolution models…

Computation and Language · Computer Science 2020-11-03 Juntao Yu , Nafise Sadat Moosavi , Silviu Paun , Massimo Poesio

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

Anaphora resolution (coreference) systems designed for the CONLL 2012 dataset typically cannot handle key aspects of the full anaphora resolution task such as the identification of singletons and of certain types of non-referring…

Computation and Language · Computer Science 2020-06-23 Juntao Yu , Alexandra Uma , Massimo Poesio

Modern sequential recommender systems, ranging from lightweight transformer-based variants to large language models, have become increasingly prominent in academia and industry due to their strong performance in the next-item prediction…

Information Retrieval · Computer Science 2025-08-11 Danil Gusak , Anna Volodkevich , Anton Klenitskiy , Alexey Vasilev , Evgeny Frolov

Traditional learning-based coreference resolvers operate by training the mention-pair model for determining whether two mentions are coreferent or not. Though conceptually simple and easy to understand, the mention-pair model is…

Computation and Language · Computer Science 2014-05-21 Altaf Rahman , Vincent Ng

This paper presents an analysis of temporal anaphora in sentences which contain quantification over events, within the framework of Discourse Representation Theory. The analysis in (Partee 1984) of quantified sentences, introduced by a…

cmp-lg · Computer Science 2019-08-14 Rani Nelken , Nissim Francez

We present a new architecture for storing and accessing entity mentions during online text processing. While reading the text, entity references are identified, and may be stored by either updating or overwriting a cell in a fixed-length…

Computation and Language · Computer Science 2019-07-10 Fei Liu , Luke Zettlemoyer , Jacob Eisenstein

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

Anaphora resolution is a challenging task which has been the interest of NLP researchers for a long time. Traditional resolution techniques like eliminative constraints and weighted preferences were successful in many languages. However,…

Computation and Language · Computer Science 2019-11-25 Vinay Annam , Nikhil Koditala , Radhika Mamidi

Anaphora resolution is an important task for information extraction across a range of languages, text genres, and domains, motivating the need for methods that do not require large annotated datasets. In-context learning has emerged as a…

Computation and Language · Computer Science 2022-11-15 Nghia T. Le , Fan Bai , Alan Ritter

Combining several (sample approximations of) distributions, which we term sub-posteriors, into a single distribution proportional to their product, is a common challenge. Occurring, for instance, in distributed 'big data' problems, or when…

Methodology · Statistics 2023-07-13 Ryan S. Y. Chan , Murray Pollock , Adam M. Johansen , Gareth O. Roberts

This paper concerns both anaphora resolution and prepositional phrase (PP) attachment that are the most frequent ambiguities in natural language processing. Several methods have been proposed to deal with each phenomenon separately, however…

cmp-lg · Computer Science 2016-08-31 Saliha Azzam

The new class of alternating-conjugate splitting methods is presented and analyzed. They are obtained by concatenating a given composition involving complex coefficients with the same composition but with the complex conjugate coefficients.…

Numerical Analysis · Mathematics 2025-12-19 J. Bernier , S. Blanes , F. Casas , A. Escorihuela-Tomàs

Reflexive anaphora present a challenge for semantic interpretation: their meaning varies depending on context in a way that appears to require abstract variables. Past work has raised doubts about the ability of recurrent networks to meet…

Computation and Language · Computer Science 2020-11-03 Robert Frank , Jackson Petty

Anaphora resolution is envisaged in this paper as part of the reference resolution process. A general open architecture is proposed, which can be particularized and configured in order to simulate some classic anaphora resolution methods.…

Computation and Language · Computer Science 2007-05-23 Andrei Popescu-Belis , Isabelle Robba

This paper presents an algorithm for identifying noun-phrase antecedents of pronouns and adjectival anaphors in Spanish dialogues. We believe that anaphora resolution requires numerous sources of information in order to find the correct…

Computation and Language · Computer Science 2011-06-06 P. Martinez-Barco , M. Palomar

Split-learning (SL) has recently gained popularity due to its inherent privacy-preserving capabilities and ability to enable collaborative inference for devices with limited computational power. Standard SL algorithms assume an ideal…

Machine Learning · Computer Science 2021-06-03 Mounssif Krouka , Anis Elgabli , Chaouki ben Issaid , Mehdi Bennis

We present an approach to anaphora resolution based on a focusing algorithm, and implemented within an existing MUC (Message Understanding Conference) Information Extraction system, allowing quantitative evaluation against a substantial…

cmp-lg · Computer Science 2007-05-23 Saliha Azzam , Kevin Humphreys , Robert Gaizauskas

Singleton mentions, i.e.~entities mentioned only once in a text, are important to how humans understand discourse from a theoretical perspective. However previous attempts to incorporate their detection in end-to-end neural coreference…

Computation and Language · Computer Science 2024-03-27 Yilun Zhu , Siyao Peng , Sameer Pradhan , Amir Zeldes
‹ Prev 1 2 3 10 Next ›