Skip to main content

Using LSA for Pronominal Anaphora Resolution

  • Conference paper
  • First Online:
Computational Linguistics and Intelligent Text Processing (CICLing 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2276))

Abstract

Until now, the contribution of world knowledge to the process of pronominal anaphora resolution has not received a thorough computational investigation, mostly due to the lack of a large scale implemented model of world knowledge. This paper proposes Latent Semantic Analysis (LSA) as such a model: word meaning representation it constructs can be used to rank potential antecedents according to how well they fit in the pronoun’s context. The initial results of incorporating LSA into a pronominal anaphora resolution algorithm are encouraging.

The work was carried out when both authors were at the University of Edinburgh

Restrictions that verbs place on their objects, eg. eat requires an edible object

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

References

  1. Deerwester, S., Dumais, S.T., Landauer, T.K., Furnas, G.W., Harshman, R.A.: Indexing by Latent Semantic Analysis. In Journal of the Society for Information Science, 41(6) (1990) 391–407

    Article  Google Scholar 

  2. Ge, N., Hale, J., Charniak, E.: A statistical Approach to Anaphora Resolution. In Proceedings of the 6th Workshop on Very Large Corpora, Montreal, Canada (1998) 161–170

    Google Scholar 

  3. Haegeman, L.: Introduction to Government and Binding Theory. 2nd edition, Cambridge, Mass: Blackwell Publishers (1994)

    Google Scholar 

  4. Hobbs, J.: Resolving Pronoun References. Lingua 44 (1977) 311–338

    Article  Google Scholar 

  5. Klebanov, B.: Using Latent Semantic Analysis for Pronominal Anaphora Resolution. MSc Dissertation, Division of Informatics, University of Edinburgh (2001). Also available from http://www.cs.huji.ac.il/~beata

  6. Landauer, T., Foltz, P., Laham, D.: Introduction to Latent Semantic Analysis. In Discourse Processes 25 (1998) 259–284

    Article  Google Scholar 

  7. Lappin, S., and Leass, H.: An Algorithm for Pronominal Anaphora Resolution. Computational Linguistics 20(4) (1994) 535–561

    Google Scholar 

  8. Marcus, M., Santorini, B., Marcinkiewicz, M.: Building a Large Annotated Corpus of English: The Penn Treebank. Computational Linguistics 19(2) (1993) 313–330

    Google Scholar 

Download references

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

Klebanov, B., Wiemer-Hastings, P. (2002). Using LSA for Pronominal Anaphora Resolution. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2002. Lecture Notes in Computer Science, vol 2276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45715-1_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45715-1_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43219-7

  • Online ISBN: 978-3-540-45715-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics