English
Related papers

Related papers: Extending DRT with a Focusing Mechanism for Pronom…

200 papers

Anaphora resolution is one of the most active research areas in natural language processing. This study examines focusing as a tool for the resolution of pronouns which are a kind of anaphora. Focusing is a discourse phenomenon like…

cmp-lg · Computer Science 2008-02-03 Ebru Ersan , Varol Akman

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

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

Discourse Representation Theory (DRT) distinguishes itself from other semantic representation frameworks by its ability to model complex semantic and discourse phenomena through structural nesting and variable binding. While seq2seq models…

Computation and Language · Computer Science 2024-10-10 Xiulin Yang , Jonas Groschwitz , Alexander Koller , Johan Bos

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

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 use the Lambek Calculus with soft sub-exponential modalities to model and reason about discourse relations such as anaphora and ellipsis. A semantics for this logic is obtained by using truncated Fock spaces, developed in our previous…

Computation and Language · Computer Science 2022-08-11 Hadi Wazni , Kin Ian Lo , Lachlan McPheat , Mehrnoosh Sadrzadeh

This paper evaluates the different tasks carried out in the translation of pronominal anaphora in a machine translation (MT) system. The MT interlingua approach named AGIR (Anaphora Generation with an Interlingua Representation) improves…

Computation and Language · Computer Science 2011-06-27 A. Ferrandez , J. Peral

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

We develop a vector space semantics for verb phrase ellipsis with anaphora using type-driven compositional distributional semantics based on the Lambek calculus with limited contraction (LCC) of J\"ager (2006). Distributional semantics has…

Computation and Language · Computer Science 2019-05-07 Gijs Wijnholds , Mehrnoosh Sadrzadeh

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 and ellipses are two common phenomena in dialogues. Without resolving referring expressions and information omission, dialogue systems may fail to generate consistent and coherent responses. Traditionally, anaphora is resolved by…

Artificial Intelligence · Computer Science 2021-05-21 Bo-Hsiang Tseng , Shruti Bhargava , Jiarui Lu , Joel Ruben Antony Moniz , Dhivya Piraviperumal , Lin Li , Hong Yu

We propose an algorithm to resolve anaphors, tackling mainly the problem of intrasentential antecedents. We base our methodology on the fact that such antecedents are likely to occur in embedded sentences. Sidner's focusing mechanism is…

cmp-lg · Computer Science 2008-02-03 Saliha Azzam

This paper provides the first discourse parsing experiments with a large language model(LLM) finetuned on corpora annotated in the style of SDRT (Segmented Discourse Representation Theory Asher, 1993; Asher and Lascarides, 2003). The result…

Computation and Language · Computer Science 2024-10-04 Kate Thompson , Akshay Chaturvedi , Julie Hunter , Nicholas Asher

A model for the full treatment of Spanish inflection for verbs, nouns and adjectives is presented. This model is based on feature unification and it relies upon a lexicon of allomorphs both for stems and morphemes. Word forms are built by…

cmp-lg · Computer Science 2016-08-15 Antonio Moreno , José M. Goñi

Recursive algebraic data types (term algebras, ADTs) are one of the most well-studied theories in logic, and find application in contexts including functional programming, modelling languages, proof assistants, and verification. At this…

Logic in Computer Science · Computer Science 2018-01-09 Hossein Hojjat , Philipp Rümmer

Natural Language Processing has moved rather quickly from modelling specific tasks to taking more general pre-trained models and fine-tuning them for specific tasks, to a point where we now have what appear to be inherently generalist…

Computation and Language · Computer Science 2024-07-19 David Schlangen

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

Anaphora resolution plays a critical role in natural language understanding, especially in morphologically rich languages like Czech. This paper presents a comparative evaluation of two modern approaches to anaphora resolution on Czech…

Computation and Language · Computer Science 2025-06-24 Patrik Stano , Aleš Horák

Entity resolution aims at resolving repeated references to an entity in a document and forms a core component of natural language processing (NLP) research. This field possesses immense potential to improve the performance of other NLP…

Computation and Language · Computer Science 2018-05-31 Rhea Sukthanker , Soujanya Poria , Erik Cambria , Ramkumar Thirunavukarasu
‹ Prev 1 2 3 10 Next ›