1999 NounPhraseCoreferenceAsClustering

From GM-RKB
Jump to navigation Jump to search

Subject Headings: Entity Mention Coreference Resolution Algorithm, Clustering Algorithm.

Notes

Cited By

Quotes

Abstract

This paper introduces a new, unsupervised algorithm for noun phrase coreference resolution. It differs from existing methods in that it views coreference resolution as a clustering task. In an evaluation on the MUC-6 coreference resolution corpus, the algorithm achieves an F-measure of 53.6%, placing it firmly between the worst (40%) and best (65%) systems in the MUC-6 evaluation. More importantly, the clustering approach outperforms the only MUC-6 system to treat coreference resolution as a learning problem. The clustering algorithm appears to provide a flexible mechanism for coordinating the application of context-independent and context-dependent constraints and preferences for accurate partitioning of noun phrases into coreference equivalence classes.


References

  • Chinatsu Aone and William Bennett. (1995). Evaluating Automated and Manual Acquisition of Anaphora Resolution Strategies. In: Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, pages 122–129. Association for Computational Linguistics.
  • S. Azzam, K. Humphreys, and R. Gaizauskas. (1998). Evaluating a Focus-based Approach to Anaphora Resolution. In: Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and COLING-98, pages 74–78. Association for Computational Linguistics.
  • C. Cardie and D. Pierce. (1998). Error-Driven Pruning of Treebank Grammars for Base Noun Phrase Identification. In: Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and COLING-98, pages 218–224, University of Montreal, Montreal, Canada. Association for Computational Linguistics.
  • C. Cardie. 1992a. Corpus-based Acquisition of Relative Pronoun Disambiguation Heuristics. In: Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, pages 216–223, University of Delaware, Newark, DE. Association for Computational Linguistics.
  • C. Cardie. 1992b. Learning to Disambiguate Relative Pronouns. In: Proceedings of the Tenth National Conference on Artificial Intelligence, pages 38–43, San Jose, CA. AAAI Press / MIT Press.
  • I. Dagan and A. Itai. (1991). A Statistical Filter for Resolving Pronoun References. In Y. A. Feldman and A. Bruckstein, editors, Artificial Intelligence and Computer Vision, pages 125–135. Elsevier Science Publishers, North Holland.
  • C. Fellbaum. (1998). WordNet: An Electronical Lexical Database. MIT Press, Cambridge, MA.
  • N. Ge, J. Hale, and Eugene Charniak. (1998). A Statistical Approach to Anaphora Resolution. In Charniak, Eugene, editor, Proceedings of the Sixth Workshop on Very Large Corpora, pages 161–170, Montreal, Canada. ACL SIGDAT.
  • S. Lappin and H. Leass. (1994). An Algorithm for Pronominal Anaphora Resolution. Computational Linguistics, 20(4):535–562.
  • M. Marcus, M. Marcinkiewicz, and B. Santorini. (1993). Building a Large Annotated Corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313–330.
  • ([[McCarthy & Lehnert, 1995) ⇒ Joseph F. McCarthy, and Wendy G. Lehnert. (1995). “Using Decision Trees for Coreference Resolution.” In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995)
  • MUC-6. (1995). Proceedings of the Sixth Message Understanding Conference (MUC-6). Morgan Kaufmann, San Francisco, CA.
  • J. Ross Quinlan. (1993). C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA.
  • M. Vilain, J. Burger, J. Aberdeen, D. Connolly, and Lynette Hirschman. (1995). A model-theoretic coreference scoring scheme. In: Proceedings of the Sixth Message Understanding Conference (MUC-6), pages 45–52, San Francisco, CA. Morgan Kaufmann.

,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
1999 NounPhraseCoreferenceAsClusteringKiri WagstaffNoun Phrase Coreference as Clusteringhttp://acl.ldc.upenn.edu/W/W99/W99-0611.pdf