Skip to main content

Automatic Extraction of IS-A Relations in Taxonomy Learning

  • Conference paper
Advances in Computer Science and Engineering (CSICC 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 6))

Included in the following conference series:

  • 906 Accesses

Abstract

Taxonomy learning is a prerequisite step for ontology learning. In order to create a taxonomy, first of all, existing ‘is-a’ relations between words should be extracted. A known way to extract ‘is-a’ relations is finding lexicosyntactic patterns in large text corpus. Although this approach produces results with high precision but it suffers from low values of recall. Furthermore developing a comprehensive set of patterns is tedious and cumbersome. In this paper, firstly, we introduce an approach for developing lexico-syntactic patterns automatically using the snippets of search engine results and then, challenge the law recall of this approach using a combined model, which is based on cooccurrence of pair words in the web and neural network classifier. Using our approach both precision and recall of extracted ‘is-a’ relations improved and FMeasure value reaches 0.72.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Cimiano, P., Hotho, A., Staab, S.: Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis. Journal of Artificial Intelligence Research 24 (2005)

    Google Scholar 

  2. Harris, Z.: Mathematical Structures of Language (1968)

    Google Scholar 

  3. Church, K.W., Hanks, P.: Word association norms, mutual information, and Lexicography. In: Association for Computational Linguistics. Proceedings of the 27th. Ainguistics, pp. 76–83 (1989)

    Google Scholar 

  4. Terra, E., Clarke, C.L.: Frequency Estimates for Statistical Word Similarity Measures. In: Edmonton, A.A. (ed.) Proceedings of Human Language Technology conference 2003, pp. 244–251 (2003)

    Google Scholar 

  5. Hearst, M.A.: Automatic acquisition of hyponyms from large text corpora. In: 4th International Conference on Computational Linguistics, pp. 539–545 (1992)

    Google Scholar 

  6. Berland, M., Charniak, E.: Finding parts in very large corpora. In: 37th Annual Meeting of the ACL, pp. 57–64 (1999)

    Google Scholar 

  7. Girju, R., Moldovan, D.I.: Text mining for causal relations. In: Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference, pp. 360–364 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neshati, M., Abolhassani, H., Fatemi, H. (2008). Automatic Extraction of IS-A Relations in Taxonomy Learning. In: Sarbazi-Azad, H., Parhami, B., Miremadi, SG., Hessabi, S. (eds) Advances in Computer Science and Engineering. CSICC 2008. Communications in Computer and Information Science, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89985-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89985-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89984-6

  • Online ISBN: 978-3-540-89985-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics