1994 AnAlgorithForPronAnaphorRes

From GM-RKB
Jump to navigation Jump to search

Subject Headings: Pronomial Anaphora Resolution.

Notes

Cited By

1999

1996

Quotes

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 that 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 that 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 teh 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 that invoke a variety of informational factors in ranking antecedent candidates.

References

  • 1. Hiyan Alshawi, Memory and context for language interpretation, Cambridge University Press, New York, NY, 1987
  • 2. Asher, Nicholas, and Wada, Hajime (1988). “A computational account of syntactic, semantic and discourse principles for anaphora resolution.” In: Journal of Semantics 6:309--344.
  • 3. Bosch, Peter (1988). “Some good reasons for shallow pronoun pronoun processing.” In: Proceedings, IBM Conference on Natural Language Processing. New York: Thornwood.
  • 4. Susan E. Brennan, Marilyn W. Friedman, Carl J. Pollard, A centering approach to pronouns, Proceedings of the 25th annual meeting on Association for Computational Linguistics, p.155-162, July 06-09, 1987, Stanford, California doi:10.3115/981175.981197
  • 5. Jaime Carbonell, Ralf D. Brown, Anaphora resolution: a multi-strategy approach, Proceedings of the 12th conference on Computational linguistics, p.96-101, August 22-27, 1988, Budapest, Hungry doi:10.3115/991635.991656
  • 6. Ido Dagan (1992). “Multilingual statistical approaches for natural language disambiguation" (in Hebrew). Doctoral dissertation, Israel Institute of Technology, Haifa, Israel.
  • 7. Ido Dagan; Justeson, John; Lappin, Shalom; Leass; Herbert; and Ribak, Amnon (in press). “Syntax and lexical statistics in anaphora resolution." Applied Artificial Intelligence.
  • 8. Barbara J. Grosz, Aravind K. Joshi, Scott Weinstein, Providing a unified account of definite noun phrases in discourse, Proceedings of the 21st annual meeting on Association for Computational Linguistics, June 15-17, 1983, Cambridge, Massachusetts doi:10.3115/981311.981320
  • 9. Grosz, Barbara; Joshi, Aravind; and Weinstein, Scott (1986, unpublished). “Towards a computational theory of discourse interpretation." Harvard University and University of Pennsylvania.
  • 10. Barbara J. Grosz, Candace L. Sidner, Attention, intentions, and the structure of discourse, Computational Linguistics, v.12 n.3, p.175-204, July-September 1986
  • 11. Franz Guenthner, Hubert Lehmann, Rules for pronominalization, Proceedings of the first conference on European chapter of the Association for Computational Linguistics, p.144-151, September 01-02, 1983, Pisa, Italy doi:10.3115/980092.980117
  • 12. Hobbs, Jerry (1978). “Resolving pronoun references." Lingua 44:311--338.
  • 13. Johnson, David (1977). “On relational constraints on grammars.” In: Syntax and Semantics 8, edited by P. Cole and J. Sadock, 151--178. New York: Academic Press.
  • 14. Kamp, Hans (1981). “A theory of truth and semantic representation.” In: Formal Methods in the Study of Language, edited by J. Groenendijk, T. Janssen, and M. Stokhof. Amsterdam: Mathematisch Centrum Tracts.
  • 15. Keenan, Edward, and Comrie, Bernard (1977). “Noun phrase accessibility and universal grammar." Linguistic Inquiry 8:62--100.
  • 16. Lappin, Shalom (1985). “Pronominal binding and coreference." Theoretical Linguistics 12:241--263.
  • 17. Shalom Lappin, Michael McCord, A syntactic filter on pronominal anaphora for Slot Grammar, Proceedings of the 28th annual meeting on Association for Computational Linguistics, p.135-142, June 06-09, 1990, Pittsburgh, Pennsylvania doi:10.3115/981823.981841
  • 18. Shalom Lappin, Michael McCord, Anaphora resolution in slot grammar, Computational Linguistics, v.16 n.4, p.197-212, December 1990
  • 19. Leass, Herbert, and Schwall, Ulrike (1991). “An anaphora resolution procedure for machine translation." IWBS Report 172, IBM Germany Scientific Center, Heidelberg, Germany.
  • 20. Michael C. McCord, Design of LMT: a prolog-based machine translation system, Computational Linguistics, v.15 n.1, p.33-52, March 1989
  • 21. McCord, Michael (1989b). “A new version of the machine translation system LMT." Literary and Linguistic Computing 4:218--229.
  • 22. Michael C. McCord, Slot Grammar: A System for Simpler Construction of Practical Natural Language Grammars, Proceedings of the International Symposium on Natural Language and Logic, p.118-145, May 09-11, 1989
  • 23. Michael C. McCord, Heuristics for broad-coverage natural language parsing, Proceedings of the workshop on Human Language Technology, March 21-24, 1993, Princeton, New Jersey doi:10.3115/1075671.1075700
  • 24. McCord, Michael (in press). “The slot grammar system.” In: Unification in Grammar, edited by Jürgen Wedekin and Christian Rohrer (also IBM Research Report RC 17313). Cambridge, MA: MIT Press.
  • 25. McCord, Michael; Bernth, Arendse; Lappin, Shalom; and Zadrozny, Wlodek (1992). “Natural language processing within a slot grammar framework." International Journal on Artificial Intelligence Tools 1:229--277.
  • 26. Elaine Rich, Susann LuperFoy, An architecture for anaphora resolution, Proceedings of the second Conference on Applied Natural Language Processing, February 09-12, 1988, Austin, Texas doi:10.3115/974235.974239
  • 27. Candace L. Sidner, Focusing for interpretation of pronouns, Computational Linguistics, v.7 n.4, p.217-231, October-December 1981
  • 28. Sidner, Candice (1983). “Focusing in the comprehension of definite anaphora.” In: Computational Models of Discourse, edited by Michael Brady and Robert Berwick, 267--330. Cambridge, MA: MIT Press.
  • 29. Marilyn A. Walker, Evaluating discourse processing algorithms, Proceedings of the 27th annual meeting on Association for Computational Linguistics, p.251-261, June 26-29, 1989, Vancouver, British Columbia, Canada doi:10.3115/981623.981654
  • 30. Walker, Marilyn; Iida, Masayo; and Cote, Sharon (1990). “Centering in Japanese discourse.” In: Proceedings, 13th International conference on Computational Linguistics, 1--6.
  • 31. Bonnie Lynn Webber, Discourse deixis: reference to discourse segments, Proceedings of the 26th annual meeting on Association for Computational Linguistics, p.113-122, June 07-10, 1988, Buffalo, New York doi:10.3115/982023.982037
  • 32. Williams, Edwin (1984). “Grammatical relations." Linguistic Inquiry 15:639--673.

,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
1994 AnAlgorithForPronAnaphorResShalom Lappin
Herbert J. Leass		An Algorithm for Pronominal Anaphora Resolutionhttp://www.aclweb.org/anthology-new/J/J94/J94-4002.pdf
Retrieved from "http://www.gabormelli.com/RKB/index.php?title=1994_AnAlgorithForPronAnaphorRes&oldid=618761"