Xem 1-20 trên 46 kết quả Anaphora
  • This paper presents a supervised pronoun anaphora resolution system based on factorial hidden Markov models (FHMMs). The basic idea is that the hidden states of FHMMs are an explicit short-term memory with an antecedent buffer containing recently described referents. Thus an observed pronoun can find its antecedent from the hidden buffer, or in terms of a generative model, the entries in the hidden buffer generate the corresponding pronouns.

    pdf10p hongdo_1 12-04-2013 20 4   Download

  • Current work on automatic opinion mining has ignored opinion targets expressed by anaphorical pronouns, thereby missing a significant number of opinion targets. In this paper we empirically evaluate whether using an off-the-shelf anaphora resolution algorithm can improve the performance of a baseline opinion mining system. We present an analysis based on two different anaphora resolution systems.

    pdf6p hongdo_1 12-04-2013 25 3   Download

  • This paper presents a new model of anaphoric processing that utilizes the establishment of coherence relations between clauses in a discourse. We survey data that comprises a currently stalemated argument over whether VP-ellipsis is an inherently syntactic or inherently semantic phenomenon, and show that the data can be handled within a uniform discourse processing architecture. This architecture, which revises the dichotomy between ellipsis vs.

    pdf8p bunmoc_1 20-04-2013 14 3   Download

  • We present an ILP-based model of zero anaphora detection and resolution that builds on the joint determination of anaphoricity and coreference model proposed by Denis and Baldridge (2007), but revises it and extends it into a three-way ILP problem also incorporating subject detection. We show that this new model outperforms several baselines and competing models, as well as a direct translation of the Denis / Baldridge model, for both Italian and Japanese zero anaphora.

    pdf10p hongdo_1 12-04-2013 15 2   Download

  • This paper explores how to apply the notion of caching introduced by Walker (1996) to the task of zero-anaphora resolution. We propose a machine learning-based implementation of a cache model to reduce the computational cost of identifying an antecedent. Our empirical evaluation with Japanese newspaper articles shows that the number of candidate antecedents for each zero-pronoun can be dramatically reduced while preserving the accuracy of resolving it.

    pdf9p hongphan_1 14-04-2013 23 2   Download

  • We approach the zero-anaphora resolution problem by decomposing it into intra-sentential and inter-sentential zeroanaphora resolution. For the former problem, syntactic patterns of the appearance of zero-pronouns and their antecedents are useful clues. Taking Japanese as a target language, we empirically demonstrate that incorporating rich syntactic pattern features in a state-of-the-art learning-based anaphora resolution model dramatically improves the accuracy of intra-sentential zero-anaphora, which consequently improves the overall performance of zeroanaphora resolution. ...

    pdf8p hongvang_1 16-04-2013 22 2   Download

  • Most existing anaphora resolution algorithms are designed to account only for anaphors with NP-antecedents. This paper describes an algorithm for the resolution of discourse deictic anaphors, which constitute a large percentage of anaphors in spoken dialogues. The success of the resolution is dependent on the classification of all pronouns and demonstratives into individual, discourse deictic and vague anaphora. Finally, the empirical results of the application of the algorithm to a corpus of spoken dialogues are presented. spoken language cannot succeed without taking this into account.

    pdf8p bunthai_1 06-05-2013 14 2   Download

  • This paper presents a predicate-argument structure analysis that simultaneously conducts zero-anaphora resolution. By adding noun phrases as candidate arguments that are not only in the sentence of the target predicate but also outside of the sentence, our analyzer identifies arguments regardless of whether they appear in the sentence or not. Because we adopt discriminative models based on maximum entropy for argument identification, we can easily add new features. We add language model scores as well as contextual features.

    pdf4p hongphan_1 15-04-2013 23 1   Download

  • The main aim of this paper is to analyse the e ects of applying pronominal anaphora resolution to Question Answering QA systems. For this task a complete QA system has been implemented. System evaluation measures performance improvements obtained when information that is referenced anaphorically in documents is not ignored.

    pdf8p bunrieu_1 18-04-2013 17 1   Download

  • In this paper we argue that comparative evaluation in anaphora resolution has to be performed using the same pre-processing tools and on the same set of data. The paper proposes an evaluation environment for comparing anaphora resolution algorithms which is illustrated by presenting the results of the comparative evaluation of three methods on the basis of several evaluation measures.

    pdf8p bunrieu_1 18-04-2013 15 1   Download

  • We describe one approach to build an automatically trainable anaphora resolution system. In this approach, we use Japanese newspaper articles tagged with discourse information as training examples for a machine learning algorithm which employs the C4.5 decision tree algorithm by Quinlan (Quinlan, 1993). Then, we evaluate and compare the results of several variants of the machine learning-based approach with those of our existing anaphora resolution system which uses manually-designed knowledge sources.

    pdf8p bunmoc_1 20-04-2013 15 1   Download

  • Computational linguists, in m o d e l i n g the process of anaphora resolution, have p r o p o s e d the n o t i o n of focusing. Focusing is the process, engaged in by a reader, of selecting a subset of the discourse items and maJ£ing them h i g h l y a v a i l a b l e for further computations. This paper provides a c o g n i t i v e basis for a n a p h o r a r e s o...

    pdf10p bungio_1 03-05-2013 10 1   Download

  • We propose a syntactic falter for identifying non-coreferential pronoun-NP pairs within a sentence. The filter applies to the output of a Slot Grammar parser and is formulated m terms of the head-argument structures which the parser generates. It liandles control and unbounded dependency constructions without empty categories or binding chains, by virtue of the uniticational nature of the parser. The filter provides constraints for a discourse semantics system, reducing the search domain to which the inference rules of the system's anaphora resolution component apply. ...

    pdf8p bungio_1 03-05-2013 22 1   Download

  • The interpretation of plural anaphora often requires the construction of complex reference objects (RefOs) out of RefOs which were formerly introduced not by plural terms but by a number of singular terms only. Often, several complex RefOs can be constructed, but only one of them is the preferred referent for the plural anaphor in question. As a means of explanation for preferred and non-preferred interpretations of plural anaphora, the concept of a Common Association Basis (CAB) for the potential atomic parts of a complex object is introduced in the following.

    pdf7p buncha_1 08-05-2013 17 1   Download

  • The paper presents a computational theory for resolving Japanese zero anaphora, based on the notion of discourse segment. We see that the discourse segment reduces the domain of antecedents for zero anaphora and thus leads to their efficient resolution. Also we make crucial use of functional notions such as empathy hierarchy and minimal semantics thesis to resolve reference for zero anaphora [Kuno, 1987]. Our al)proach differs from the Centering analysis [Walker et al.

    pdf7p buncha_1 08-05-2013 17 1   Download

  • In this study we map out a way to build event representations incrementally, using information which may be widely distributed across a discourse. An enhanced Discourse Representation (Kamp, 1981) provides the vehicle both for carrying open event roles through the discourse until they can be instantiated by NPs, and for resolving the reference of these otherwise problematic NPs by binding them to the event roles.

    pdf8p bunmoc_1 20-04-2013 15 2   Download

  • Standard Discourse Representation Theory (DRT) was designed mainly to explain the so-called donkey-sentences. The pronouns plaYing such a prominent role in all these sentences belong, however, exclusively to one (partlculaPly simple) type of pronoun. We try to extend DRT in order to cover an equally Important type of pronoun, the so-called etdes0rIptlonal,* pronoun. Discourse referents ape now used Eo carry information on the intenslon of their referents as well as on the extenslon. This allows, at the same time.

    pdf8p buncha_1 08-05-2013 16 2   Download

  • A proposal to deal with French tenses in the framework of Discourse Representation Theory is presented, as it has been implemented for a fragment at the IMS. It is based on the theory of tenses of H. Kamp and Ch. Rohrer. Instead of using operators to express the meaning of the tenses the Reichenbachian point of view is adopted and refined such that the impact of the tenses with respect to the meaning of the text is understood as contribution to the integration of the events of a sentence in the event structure of the preceeding text. ...

    pdf8p buncha_1 08-05-2013 20 2   Download

  • We give an analysis of ellipsis resolution in terms of a straightforward discourse copying algorithm that correctly predicts a wide range of phenomena. The treatment does not suffer from problems inherent in identity-of-relations analyses. Furthermore, in contrast to the approach of Dalrymple et al. [1991], the treatment directly encodes the intuitive distinction between full NPs and the referential elements that corefer with them through what we term role linking.

    pdf10p buncha_1 08-05-2013 17 2   Download

  • We present an algorithm for pronounanaphora (in English) that uses Expectation Maximization (EM) to learn virtually all of its parameters in an unsupervised fashion. While EM frequently fails to find good models for the tasks to which it is set, in this case it works quite well. We have compared it to several systems available on the web (all we have found so far). Our program significantly outperforms all of them. The algorithm is fast and robust, and has been made publically available for downloading....

    pdf9p bunthai_1 06-05-2013 18 1   Download


Đồng bộ tài khoản