Skip to main content

A Semantics-Enhanced Language Model for Unsupervised Word Sense Disambiguation

  • Conference paper
Book cover Computational Linguistics and Intelligent Text Processing (CICLing 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4919))

Abstract

An N-gram language model aims at capturing statistical word order dependency information from corpora. Although the concept of language models has been applied extensively to handle a variety of NLP problems with reasonable success, the standard model does not incorporate semantic information, and consequently limits its applicability to semantic problems such as word sense disambiguation. We propose a framework that integrates semantic information into the language model schema, allowing a system to exploit both syntactic and semantic information to address NLP problems. Furthermore, acknowledging the limited availability of semantically annotated data, we discuss how the proposed model can be learned without annotated training examples. Finally, we report on a case study showing how the semantics-enhanced language model can be applied to unsupervised word sense disambiguation with promising results.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Banerjee, S., Pedersen, T.: Extended gloss overlaps as a measure of semantic relatedness. In: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 805–810 (2003)

    Google Scholar 

  2. Baum, L.E.: An Inequality and Associated Maximization in Statistical Estimation for Probabilistic Functions of Markov Processes. Inequalities 627(3), 1–8 (1972)

    MathSciNet  Google Scholar 

  3. Bellegarda, J.: Exploiting latent semantic information in statistical language modeling. Proceedings of IEEE 88(8), 1279–1296 (2000)

    Article  Google Scholar 

  4. Brody, S., Navigli, R., Lapata, M.: Ensemble Methods for Unsupervised WSD. In: Proceedings of the ACL/COLING, pp. 97–104 (2006)

    Google Scholar 

  5. Brown, P.F., et al.: Class-based n-gram models of natural language. Computational Linguistics 18(4), 467–479 (1992)

    Google Scholar 

  6. Chueh, C.H., Wang, H.M., Chien, J.T.: A Maximum Entropy Approach for Semantic Language Modeling. Computational Linguistics and Chinese Language Processing 11(1), 37–56 (2006)

    Google Scholar 

  7. Cutting, D., et al.: A practical part-of-speech tagger. In: Proceedings of ANLP-1992, Trento, Italy, pp. 133–140 (1992)

    Google Scholar 

  8. Dempster, A.D., Laird, N.M., Rubin, D.B.: Maximum likelihood for incomplete data via the EM algorithm. Journal of Royal Statistical Society Series B 39, 1–38 (1977)

    MATH  MathSciNet  Google Scholar 

  9. Galley, M., McKeown, K.: Improving Word Sense Disambiguation in Lexical Chaining. In: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 1486–1488 (2003)

    Google Scholar 

  10. Griffiths, T., et al.: Integrating Topics and Syntax. In: Proceedings of the Advances in Neural Information Processing Systems (2004)

    Google Scholar 

  11. Hoste, V., et al.: Parameter optimization for machine-learning of word sense disambiguation. Language Engineering 8(4), 311–325 (2002)

    Article  Google Scholar 

  12. Knight, K., et al.: Unsupervised Analysis for Decipherment Problems. In: Proceedings of the ACL-COLING (2006)

    Google Scholar 

  13. Koehn, P., Knight, K.: Estimating word translation probabilities from unrelated monolingual corpora using the EM algorithm. In: Proceedings of the AAAI, pp. 711–715 (2000)

    Google Scholar 

  14. Lin, S.d., Knight, K.: Discovering the linear writing order of a two-dimensional ancient hieroglyphic script. Artificial Intelligence 170(4-5) (2006)

    Google Scholar 

  15. McCarthy, D., et al.: Finding predominant word senses in untagged text. In: Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, Barcelona, Spain (2004)

    Google Scholar 

  16. Mihalcea, R.: Unsupervised Large-Vocabulary Word Sense Disambiguation with Graph-based Algorithms for Sequence Data Labeling. In: Proceedings of the Joint Conference on Human Language Technology / Empirical Methods in Natural Language Processing (HLT/EMNLP) (2005)

    Google Scholar 

  17. Navigli, R., Velardi, P.: Structural Semantic Interconnections: a Knowledge-Based Approach to Word Sense Disambiguation. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI) 27(7), 1063–1074 (2005)

    Article  Google Scholar 

  18. Rapaport, W.J.: Holism, Conceptual-Role Semantics, and Syntactic Semantics. Minds and Machines 12(1), 3–59 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alexander Gelbukh

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, Sd., Verspoor, K. (2008). A Semantics-Enhanced Language Model for Unsupervised Word Sense Disambiguation. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2008. Lecture Notes in Computer Science, vol 4919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78135-6_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78135-6_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78134-9

  • Online ISBN: 978-3-540-78135-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics