• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

An algorithm for pronominal anaphora resolution (1994)

Cached

  • Download as a PDF

Download Links

  • [webcourse.cs.technion.ac.il]
  • [acl.ldc.upenn.edu]
  • [www.cis.upenn.edu]
  • [aclweb.org]
  • [wing.comp.nus.edu.sg]
  • [www.aclweb.org]
  • [aclweb.org]
  • [ucrel.lancs.ac.uk]
  • [www.mt-archive.info]
  • [wing.comp.nus.edu.sg]
  • [www.cis.upenn.edu]
  • [www.wlv.ac.uk]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Herbert J Leass
Venue:Computational Linguistics
Citations:391 - 0 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Leass94analgorithm,
    author = {Herbert J Leass},
    title = {An algorithm for pronominal anaphora resolution},
    journal = {Computational Linguistics},
    year = {1994},
    volume = {20},
    pages = {535--561}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

This paper presents an algorithm for identifying the noun phrase antecedents of third person pronouns and lexical anaphors (reflexives and reciprocals). The algorithm applies to the syntactic representations generated by McCord's Slot Grammar parser, and relies on salience measures derived from syntactic structure and a simple dynamic model of attentional state. Like the parser, the algorithm is implemented in Prolog. The authors have tested it extensively on computer manual texts, and conducted a blind test on manual text containing 360 pronoun occurrences. The algorithm successfully identifies the antecedent of the pronoun for 86 % of these pronoun occurrences. The relative contributions of the algorithm's components to its overall success rate in this blind test are examined. Experiments were conducted with an enhancement of the algorithm which contributes statistically modelled information concerning semantic and real world relations to the algorithm's decision procedure. Interestingly, this enhancement only marginally improves the algorithm's performance (by 2%). The algorithm is compared with other approaches to anaphora resolution which have been proposed in the literature. In particular, the search procedure of Hobbs ' algorithm was implemented in the Slot Grammar framework and applied to the sentences in the blind test set. The authors ' algorithm achieves a higher rate of success (4%) than Hobbs ' algorithm. The relation of the algorithm to the centering approach is discussed, as well as to models of anaphora resolution which invoke a variety of informational factors in ranking antecedent candidates. 1.

Keyphrases

pronominal anaphora resolution    pronoun occurrence    blind test    centering approach    search procedure    slot grammar framework    slot grammar parser    lexical anaphor    real world relation    algorithm applies    antecedent candidate    relative contribution    informational factor    overall success rate    syntactic structure    decision procedure    noun phrase antecedent    third person pronoun    attentional state    computer manual text    manual text    blind test set    salience measure    anaphora resolution    simple dynamic model    syntactic representation   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University