English
Related papers

Related papers: A Probabilistic Method for Analyzing Japanese Anap…

200 papers

For Japanese-to-English translation, zero pronouns in Japanese pose a challenge, since the model needs to infer and produce the corresponding pronoun in the target side of the English sentence. However, although fully resolving zero…

Computation and Language · Computer Science 2022-03-23 Ryokan Ri , Toshiaki Nakazawa , Yoshimasa Tsuruoka

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 one of the major problems in natural language processing. It is also one of the important tasks in machine translation and man/machine dialogue. We solve the problem by using surface expressions and examples. Surface…

Computation and Language · Computer Science 2009-09-25 Masaki Murata

Existing approaches for Chinese zero pronoun resolution overlook semantic information. This is because zero pronouns have no descriptive information, which results in difficulty in explicitly capturing their semantic similarities with…

Computation and Language · Computer Science 2017-09-28 Qingyu Yin , Weinan Zhang , Yu Zhang , Ting Liu

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

In this paper we propose a computational treatment of the resolution of zero pronouns in Japanese discourse, using an adaptation of the centering algorithm. We are able to factor language-specific dependencies into one parameter of the…

cmp-lg · Computer Science 2008-02-03 Marilyn Walker , Masayo Iida , Sharon Cote

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

Japanese predicate-argument structure (PAS) analysis involves zero anaphora resolution, which is notoriously difficult. To improve the performance of Japanese PAS analysis, it is straightforward to increase the size of corpora annotated…

Computation and Language · Computer Science 2018-06-06 Shuhei Kurita , Daisuke Kawahara , Sadao Kurohashi

Masked language models (MLMs) have contributed to drastic performance improvements with regard to zero anaphora resolution (ZAR). To further improve this approach, in this study, we made two proposals. The first is a new pretraining task…

Computation and Language · Computer Science 2021-09-13 Ryuto Konno , Shun Kiyono , Yuichiroh Matsubayashi , Hiroki Ouchi , Kentaro Inui

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

In machine translation and man-machine dialogue, it is important to clarify referents of noun phrases. We present a method for determining the referents of noun phrases in Japanese sentences by using the referential properties, modifiers,…

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

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

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

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

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

Possessive pronouns are used as determiners in English when no equivalent would be used in a Japanese sentence with the same meaning. This paper proposes a heuristic method of generating such possessive pronouns even when there is no…

cmp-lg · Computer Science 2008-02-03 Francis Bond , Kentaro Ogura , Satoru Ikehara

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

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

Most existing approaches for zero pronoun resolution are heavily relying on annotated data, which is often released by shared task organizers. Therefore, the lack of annotated data becomes a major obstacle in the progress of zero pronoun…

Computation and Language · Computer Science 2017-09-25 Ting Liu , Yiming Cui , Qingyu Yin , Weinan Zhang , Shijin Wang , Guoping Hu

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
‹ Prev 1 2 3 10 Next ›