English
Related papers

Related papers: Anaphora Resolution in Japanese Sentences Using Su…

200 papers

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 describes a standalone, publicly-available implementation of the Resolution of Anaphora Procedure (RAP) given by Lappin and Leass (1994). The RAP algorithm resolves third person pronouns, lexical anaphors, and identifies…

Computation and Language · Computer Science 2007-05-23 Long Qiu , Min-Yen Kan , Tat-Seng Chua

A new natural language understanding method for disambiguation of difficult pronouns is described. Difficult pronouns are those pronouns for which a level of world or domain knowledge is needed in order to perform anaphoral or other types…

Computation and Language · Computer Science 2014-11-18 Glenn R. Hofford

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

Standard machine translation systems process sentences in isolation and hence ignore extra-sentential information, even though extended context can both prevent mistakes in ambiguous cases and improve translation coherence. We introduce a…

Computation and Language · Computer Science 2018-05-28 Elena Voita , Pavel Serdyukov , Rico Sennrich , Ivan Titov

Enormous explosion in the number of the World Wide Web pages occur every day and since the efficiency of most of the information processing systems is found to be less, the potential of the Internet applications is often underutilized.…

Information Retrieval · Computer Science 2011-09-13 L. Jegatha Deborah , R. Baskaran , A. Kannan

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

We propose a process for investigating the extent to which sentence representations arising from neural machine translation (NMT) systems encode distinct semantic phenomena. We use these representations as features to train a natural…

Computation and Language · Computer Science 2018-05-08 Adam Poliak , Yonatan Belinkov , James Glass , Benjamin Van Durme

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

This paper describes in outline a method for translating Japanese temporal expressions into English. We argue that temporal expressions form a special subset of language that is best handled as a special module in machine translation. The…

Computation and Language · Computer Science 2007-05-23 Francis Bond , Kentaro Ogura , Hajime Uchino

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

Most previous studies on bridging anaphora resolution (Poesio et al., 2004; Hou et al., 2013b; Hou, 2018a) use the pairwise model to tackle the problem and assume that the gold mention information is given. In this paper, we cast bridging…

Computation and Language · Computer Science 2020-06-26 Yufang Hou

In this paper, we propose a textual clue approach to help metaphor detection, in order to improve the semantic processing of this figure. The previous works in the domain studied the semantic regularities only, overlooking an obvious set of…

cmp-lg · Computer Science 2008-02-03 Stéphane Ferrari

This study proposes a method to develop neural models of the morphological analyzer for Japanese Hiragana sentences using the Bi-LSTM CRF model. Morphological analysis is a technique that divides text data into words and assigns information…

Computation and Language · Computer Science 2022-01-11 Jun Izutsu , Kanako Komiya

Metaphorical expressions are difficult linguistic phenomena, challenging diverse Natural Language Processing tasks. Previous works showed that paraphrasing a metaphor as its literal counterpart can help machines better process metaphors on…

Computation and Language · Computer Science 2021-04-09 Rui Mao , Chenghua Lin , Frank Guerin

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

In order to take steps towards establishing a methodology for evaluating Natural Language systems, we conducted a case study. We attempt to evaluate two different approaches to anaphoric processing in discourse by comparing the accuracy and…

cmp-lg · Computer Science 2008-02-03 Marilyn A. Walker

We extend the centering model for the resolution of intra-sentential anaphora and specify how to handle complex sentences. An empirical evaluation indicates that the functional information structure guides the search for an antecedent…

cmp-lg · Computer Science 2008-02-03 Michael Strube

Particles fullfill several distinct central roles in the Japanese language. They can mark arguments as well as adjuncts, can be functional or have semantic funtions. There is, however, no straightforward matching from particles to…

Computation and Language · Computer Science 2007-05-23 Melanie Siegel