English
Related papers

Related papers: Anaphora Resolution in Japanese Sentences Using Su…

200 papers

Verbs are sometimes omitted in Japanese sentences. It is necessary to recover omitted verbs for purposes of language understanding, machine translation, and conversational processing. This paper describes a practical way to recover omitted…

Computation and Language · Computer Science 2009-09-25 M. Murata , M. Nagao

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

In this paper, we present a method of estimating referents of demonstrative pronouns, personal pronouns, and zero pronouns in Japanese sentences using examples, surface expressions, topics and foci. Unlike conventional work which was…

Computation and Language · Computer Science 2007-05-23 M. Murata , H. Isahara , M. Nagao

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

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

This paper proposes a method to analyze Japanese anaphora, in which zero pronouns (omitted obligatory cases) are used to refer to preceding entities (antecedents). Unlike the case of general coreference resolution, zero pronouns have to be…

Computation and Language · Computer Science 2007-05-23 Kazuhiro Seki , Atsushi Fujii , Tetsuya Ishikawa

A noun phrase can indirectly refer to an entity that has already been mentioned. For example, ``I went into an old house last night. The roof was leaking badly and ...'' indicates that ``the roof'' is associated with `` an old house}'',…

Computation and Language · Computer Science 2007-05-23 M. Murata , H. Isahara , M. Nagao

The ongoing neural revolution in machine translation has made it easier to model larger contexts beyond the sentence-level, which can potentially help resolve some discourse-level ambiguities such as pronominal anaphora, thus enabling…

Computation and Language · Computer Science 2019-09-04 Prathyusha Jwalapuram , Shafiq Joty , Irina Temnikova , Preslav Nakov

In anaphora resolution for English, animacy identification can play an integral role in the application of agreement restrictions between pronouns and candidates, and as a result, can improve the accuracy of anaphora resolution systems. In…

Computation and Language · Computer Science 2011-10-12 R. J. Evans , C. Orasan

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

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

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

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

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 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

The high volume of published chemical patents and the importance of a timely acquisition of their information gives rise to automating information extraction from chemical patents. Anaphora resolution is an important component of…

Computation and Language · Computer Science 2023-06-26 Chieling Yueh , Evangelos Kanoulas , Bruno Martins , Camilo Thorne , Saber Akhondi

Reference resolution is one of the important tasks in natural language processing. In this paper, the author first determines the referents and their locations of "dousha", literally meaning "the same company", which appear in Japanese…

cmp-lg · Computer Science 2008-02-03 Takahiro Wakao

This paper studies the relationship between the surface form of a mathematical problem and its solvability by large language models. We find that subtle alterations in the surface form can significantly impact the answer distribution and…

Computation and Language · Computer Science 2024-04-18 Yue Zhou , Yada Zhu , Diego Antognini , Yoon Kim , Yang Zhang

Resolving pronouns to their referents has long been studied as a fundamental natural language understanding problem. Previous works on pronoun coreference resolution (PCR) mostly focus on resolving pronouns to mentions in text while…

Computation and Language · Computer Science 2021-09-13 Xintong Yu , Hongming Zhang , Yangqiu Song , Changshui Zhang , Kun Xu , Dong Yu

The referential properties of noun phrases in the Japanese language, which has no articles, are useful for article generation in Japanese-English machine translation and for anaphora resolution in Japanese noun phrases. They are generally…

Computation and Language · Computer Science 2007-05-23 Masaki Murata , Kiyotaka Uchimoto , Qing Ma , Hitoshi Isahara
‹ Prev 1 2 3 10 Next ›