Skip to main content

Mapping General-Specific Noun Relationships to WordNet Hypernym/Hyponym Relations

  • Conference paper
Knowledge Engineering: Practice and Patterns (EKAW 2008)

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

Abstract

In this paper, we propose a new methodology based on directed graphs and the TextRank algorithm to automatically induce general-specific noun relations from web corpora frequency counts. Different asymmetric association measures are implemented to build the graphs upon which the TextRank algorithm is applied and produces an ordered list of nouns from the most general to the most specific. Experiments are conducted based on the WordNet noun hierarchy and both quantitative and qualitative evaluations are proposed.

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 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.00
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. Beesley, K.B.: Language Identifier: a Computer Program for Automatic Natural-Language Identification of On-line Text. In: Proceedings of the 29th Annual Conference of the American Translators Association, pp. 47–54 (1998)

    Google Scholar 

  2. Bollegala, D., Matsuo, Y., Ishizuka, M.: Measuring Semantic Similarity between Words Using WebSearch Engines. In: Proceedings of International World Wide Web Conference (WWW 2007) (2007)

    Google Scholar 

  3. Caraballo, S.A.: Automatic Construction of a Hypernym-labeled Noun Hierarchy from Text. In: Proceedings of the Conference of the Association for Computational Linguistics (ACL 1999) (1999)

    Google Scholar 

  4. Dias, G., Santos, C., Cleuziou, G.: Automatic Knowledge Representation using a Graph-based Algorithm for Language-Independent Lexical Chaining. In: Proceedings of the Workshop on Information Extraction Beyond the Document associated to the Joint Conference of the International Committee of Computational Linguistics and the Association for Computational Linguistics (COLING/ACL), pp. 36–47 (2006)

    Google Scholar 

  5. Grefenstette, G.: Explorations in Automatic Thesaurus Discovery. Kluwer Academic Publishers, USA (1994)

    MATH  Google Scholar 

  6. Hearst, M.H.: Automatic Acquisition of Hyponyms from Large Text Corpora. In: Proceedings of the Fourteenth International Conference on Computational Linguistics (COLING 1992), pp. 539–545 (1992)

    Google Scholar 

  7. Kilgarriff, A.: Googleology is Bad Science. Computational Linguistics 33(1), 147–151 (2007)

    Article  Google Scholar 

  8. Michelbacher, L., Evert, S., Schütze, H.: Asymmetric Association Measures. In: Proceedings of the Recent Advances in Natural Language Processing (RANLP 2007) (2007)

    Google Scholar 

  9. Mihalcea, R., Tarau, P.: TextRank: Bringing Order into Texts. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP 2004), pp. 404–411 (2004)

    Google Scholar 

  10. Pecina, P., Schlesinger, P.: Combining Association Measures for Collocation Extraction. In: Proceedings of the International Committee of Computational Linguistics and the Association for Computational Linguistics (COLING/ACL 2006) (2006)

    Google Scholar 

  11. Riloff, E.: Automatically Constructing a Dictionary for Information Extraction Tasks. In: Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI 1993), pp. 811–816 (1993)

    Google Scholar 

  12. Sang, E.J.K., Hofmann, K.: Automatic Extraction of Dutch Hypernym-Hyponym Pairs. In: Proceedings of Computational Linguistics in the Netherlands Conference (CLIN 2007) (2007)

    Google Scholar 

  13. Snow, R., Jurafsky, D., Ng, A.Y.: Learning Syntactic Patterns for Automatic Hypernym Discovery. In: Proceedings of the International Committee of Computational Linguistics and the Association for Computational Linguistics (COLING/ACL 2006) (2005)

    Google Scholar 

  14. Snow, R., Jurafsky, D., Ng, A.Y.: Semantic Taxonomy Induction from Heterogenous Evidence. In: Proceedings of the Neural Information Processing Systems Conference (NIPS 2005) (2005)

    Google Scholar 

  15. Stevenson, M., Greenwood, M.: Comparing Information Extraction Pattern Models. In: Proceedings of the Workshop on Information Extraction Beyond the Document associated to the Joint Conference of the International Committee of Computational Linguistics and the Association for Computational Linguistics (COLING/ACL 2006), pp. 29–35 (2006)

    Google Scholar 

  16. Tan, P.-N., Kumar, V., Srivastava, J.: Selecting the Right Objective Measure for Association Analysis. Information Systems 29(4), 293–313 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Aldo Gangemi Jérôme Euzenat

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dias, G., Mukelov, R., Cleuziou, G. (2008). Mapping General-Specific Noun Relationships to WordNet Hypernym/Hyponym Relations. In: Gangemi, A., Euzenat, J. (eds) Knowledge Engineering: Practice and Patterns. EKAW 2008. Lecture Notes in Computer Science(), vol 5268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87696-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87696-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87695-3

  • Online ISBN: 978-3-540-87696-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics