Nothing Special   »   [go: up one dir, main page]

Skip to main content

Using Concept Space to Verify Hyponymy in Building a Hyponymy Lexicon

  • Conference paper
Artificial Intelligence and Computational Intelligence (AICI 2009)

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

  • 2012 Accesses

Abstract

Verification of hyponymy relations is a basic problem in knowledge acquisition. We present a method of hyponymy verification based on concept space. Firstly, we give the definition of concept space about a group of candidate hyponymy relations. Secondly we analyze the concept space and define a set of hyponymy features based on the space structure. Then we use them to verify candidate hyponymy relations. Experimental results show that the method can provide adequate verification of hyponymy.

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 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.

Similar content being viewed by others

References

  1. Beeferman, D.: Lexical discovery with an enriched semantic network. In: Proceedings of the Workshop on Applications of WordNet in Natural Language Processing Systems, ACL/COLING, pp. 358–364 (1998)

    Google Scholar 

  2. Cao, C., Shi, Q.: Acquiring Chinese Historical Knowledge from Encyclopedic Texts. In: Proceedings of the International Conference for Young Computer Scientists, pp. 1194–1198 (2001)

    Google Scholar 

  3. Hearst, M.A.: Automated Discovery of WordNet Relations. In: Fellbaum, C. (ed.) To Appear in WordNet: An Electronic Lexical Database and Some of its Applications, pp. 131–153. MIT Press, Cambridge (1998)

    Google Scholar 

  4. Morin, E., Jacquemin, C.: Projecting corpus-based semantic links on a thesaurus. In: Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, pp. 389–396 (1999)

    Google Scholar 

  5. Lloréns, J., Astudillo, H.: Automatic generation of hierarchical taxonomies from free text using linguistic algorithms. In: Advances in Object-Oriented Information Systems, OOIS 2002 Workshops, Montpellier, France, pp. 74–83 (2002)

    Google Scholar 

  6. Sánchez, D., Moreno, A.: Pattern-ed automatic taxonomy learning from the Web. AI Communications 21(3), 27–48 (2008)

    MATH  MathSciNet  Google Scholar 

  7. Elghamry, K.: Using the Web in Building a Corpus-Based Hypernymy-Hyponymy Lexicon with Hierarchical Structure for Arabic. Faculty of Computers and Information, 157–165 (2008)

    Google Scholar 

  8. Zhang, C.-x., Hao, T.-y.: The State of the Art and Difficulties in Automatic Chinese Word Segmentation. Journal of System simulation 17(1), 138–143 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, L., Zhang, S., Diao, L.H., Yan, S.Y., Cao, C.G. (2009). Using Concept Space to Verify Hyponymy in Building a Hyponymy Lexicon. In: Deng, H., Wang, L., Wang, F.L., Lei, J. (eds) Artificial Intelligence and Computational Intelligence. AICI 2009. Lecture Notes in Computer Science(), vol 5855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05253-8_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05253-8_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05252-1

  • Online ISBN: 978-3-642-05253-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics