Skip to main content

Enhancing Preference-Based Anaphora Resolution with Genetic Algorithms

  • Conference paper
  • First Online:
Natural Language Processing — NLP 2000 (NLP 2000)

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

Included in the following conference series:

Abstract

The paper argues that a promising way to improve the success rate of preference-based anaphora resolution algorithms is the use of machine learning. The paper outlines MARS - a program for automatic resolution of pronominal anaphors and describes an experiment which we have conducted to optimise the success rate of MARS with the help of a genetic algorithm. After the optimisation we noted an improvement up to 8% for some files. The results obtained after optimisation are discussed.

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

Access this chapter

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dumitrescu, D., Lazzerini, B., Jain, L. and Dumitrescu, A. (forthcoming) Evolutionary Computation, CRC Press

    Google Scholar 

  2. Evans, R. (2000) A Comparison of Rule-Based and Machine Learning Methods for Identifying Non-nominalIt, in Proceedings of NLP 2000 Conference, Patras, Greece. http://www.muc.saic.com/proceedings/co_task.pdf

  3. Hirst, G. (1981) Anaphora in Natural Language Understanding, Springer Verlag, Germany

    Google Scholar 

  4. Holland, J.H. (1975) Adaptation in Natural and Artificial Systems, University of Michigan Press, US.

    Google Scholar 

  5. Lappin, S. and Leass, H.J. (1994) An Algorithm for Pronominal Anaphora Resolution, in Computational Linguistics Volume 20, Number 4

    Google Scholar 

  6. Mitkov, R., Belguith, L. and Stys, M. (1998) Multilingual Robust Anaphora Resolution, in Proceedings of The Third International Conference on Empirical Methods in Natural Language Processing, Granada, Spain.

    Google Scholar 

  7. Tapanainen, P. and Järvinen, T. (1997) A Non-Projective Dependency Parser, in The Proceedings of The 5th Conference of Applied Natural Language Processing, pages 64–71, ACL, US.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

OrĂsan, C., Evans, R., Mitkov, R. (2000). Enhancing Preference-Based Anaphora Resolution with Genetic Algorithms. In: Christodoulakis, D.N. (eds) Natural Language Processing — NLP 2000. NLP 2000. Lecture Notes in Computer Science(), vol 1835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45154-4_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45154-4_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45154-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics