Skip to main content

Using Sense Recognition to Resolve the Problem of Polysemy in Building a Taxonomic Hierarchy

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2008)

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

  • 1930 Accesses

Abstract

Hyponymy is used to build a taxonomic hierarchy. But the terms in hyponymy may have multiple senses. It will cause the problem of polysemy and affect the building of taxonomic hierarchy. In order to solve the problem, we present a method of sense recognition of hyponymy based on vector space model. Firstly we acquire the contexts of hyponymy from Chinese free corpus. Secondly we use Cilin to construct a relation-word vector space. Then we use latent semantic analysis to reduce the dimension of the vector space. In the final phase, we recognize the senses of hyponymy using average-group clustering. Experimental results show that the method can provide adequate discrimination of the different senses.

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. Hearst, M.A.: Automatic acquisition of hyponyms from large text corpora. In: Proceedings of the 14th International Conference on Computational Linguistics, Nantes, France, pp. 539–545 (1992)

    Google Scholar 

  2. Rydin, S.: Building a Hyponymy Lexicon with Hierarchical Structure. In: Proceedings of the SIGLEX Workshop on Unsupervised Lexical Acquisition (2002)

    Google Scholar 

  3. Miura, K., Tsuruoka, Y., Tsujii, J.: Automatic acquisition of concept relations from web documents with sense clustering. In: IJCNLP 2004 Interactive Poster/Demo, pp. 37–40 (2004)

    Google Scholar 

  4. Purandare, A., Pedersen, T.: SenseClusters - Finding Clusters that Represent Word Senses. In: AAAI 2004, pp. 1030–1031 (2004)

    Google Scholar 

  5. McRoy, S.W.: Using multiple knowledge sources for word sense discrimination. Association for Computational Linguistics 18(1), 1–30 (1992)

    Google Scholar 

  6. Schutze, H.: Automatic Word Sense Discrimination. Association for Computational Linguistics 24(1), 97–123 (1998)

    MathSciNet  Google Scholar 

  7. Mei, J.J., Zhu, Y.M., Gao, Y.Q., Yin, H.X.: Tongyici Cilin(Dictionary of Synonymous Words). Shanghai Cishu Publisher, China (1983)

    Google Scholar 

  8. Chen, K.-J., You, J.-M.: A Study on Word Similarity using Context Vector Models. Computational Linguistics and Chinese Language Processing 7(2), 37–58 (2002)

    MathSciNet  Google Scholar 

  9. Karov, Y., Edelman, S.: Similarity- based word sense disambiguation. Computational Linguistics 24(1) (1998)

    Google Scholar 

  10. Liu, L., Cao, C., Wang, H.: Acquiring Hyponymy Relations from Large Chinese Corpus. Wseas Transactions on Business and Economics 4(2) (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ignac Lovrek Robert J. Howlett Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, L., Zhang, S., Diao, L.H., Yan, S.Y., Cao, C.G. (2008). Using Sense Recognition to Resolve the Problem of Polysemy in Building a Taxonomic Hierarchy. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2008. Lecture Notes in Computer Science(), vol 5177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85563-7_68

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85563-7_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85562-0

  • Online ISBN: 978-3-540-85563-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics