Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Automatic Anaphora Resolution: Limits, Impediments, and Ways Forward

  • Conference paper
  • First Online:
Advances in Natural Language Processing (PorTAL 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2389))

Included in the following conference series:

  • 479 Accesses

Abstract

The talk will discuss both the limits of and impediments to automatic anaphora resolution and will provide suggestions as to how to overcome some of these hurdles. To start with, anaphora resolution will be introduced as a daunting NLP task requiring the employment of different sources of knowledge. As recent research focusing on robust and knowledge-poor solutions will be summarised, as well as the latest trends, it will be argued that it is the absence of sophisticated semantic and real-world knowledge that imposes limits on all current algorithms. Next, the talk will explain that the lack of reliable pre-processing tools to feed correct inputs into resolution algorithms is another impediment which imposes a limit on the success rate of automatic anaphora resolution systems. It is argued that the performance of the best anaphora resolution algorithms can drop by over 20% if fully automatic pre-processing is undertaken. Comparative results and conclusions will be presented from the evaluation of the different versions of MARS, a fully automatic anaphora resolution system based on Mitkov’s knowledge-poor approach to pronoun resolution, as well as from the evaluation of other (well-known) systems developed or re-implemented by members of the Research Group in Computational Linguistics at the University of Wolverhampton. Outstanding evaluation issues will also be highlighted as a further impediment to measuring progress in anaphora resolution and a new ‘evaluation workbench’ will be proposed as a suitable environment for comprehensive evaluation of anaphora resolution algorithms. In addition, the issue of annotated corpora and how it is addressed at Wolverhampton will be discussed. Finally, ways forward in enhancing the performance of current algorithms will be suggested.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mitkov, R. (2002). Automatic Anaphora Resolution: Limits, Impediments, and Ways Forward. In: Ranchhod, E., Mamede, N.J. (eds) Advances in Natural Language Processing. PorTAL 2002. Lecture Notes in Computer Science(), vol 2389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45433-0_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45433-0_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43829-8

  • Online ISBN: 978-3-540-45433-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics