Skip to main content

Evaluation Method for Automated Wordnet Expansion

  • Conference paper
Security and Intelligent Information Systems (SIIS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7053))

Abstract

Laborious construction of large wordnets (lexico-semantic networks) can be supported by automatic wordnet expansion methods. Several methods were proposed but mostly were not thoroughly evaluated and compared. In the paper an evaluation methodology for automated wordnet expansion algorithms is proposed. Basic requirements for it are formulated in relation to the linguistic process. The general scheme based on the idea of automated wordnet reconstruction is presented. The methodology is illustrated by applying it to the comparison of the two top level wordnet expansion algorithms: Algorithm of Activation-area Attachment and the algorithm of Snow et al.. The latter was reimplemented and adopted to the Polish language tools.

Work financed by Innovative Economy Programme project POIG.01.01.02-14-013/09.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Alfonseca, E., Manandhar, S.: Extending a lexical ontology by a combination of distributional semantics signatures. In: Gómez-Pérez, A., Benjamins, V.R. (eds.) EKAW 2002. LNCS (LNAI), vol. 2473, pp. 1–7. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. BNC: The British National Corpus, version 2 (BNC World), distributed by Oxford University Computing Services on behalf of the BNC Consortium (2001)

    Google Scholar 

  3. Broda, B., Piasecki, M., Szpakowicz, S.: Extraction of polish noun senses from large corpora by means of clustering. Control and Cybernetics 31(2), 401–420 (2010)

    Google Scholar 

  4. Caraballo, S.A.: Automatic construction of a hypernym-labeled noun hierarchy from text. In: Proceedings of ACL 1999, Baltimore, MD, pp. 120–126 (1999)

    Google Scholar 

  5. Fellbaum, C. (ed.): WordNet — An Electronic Lexical Database. The MIT Press (1998)

    Google Scholar 

  6. Harris, Z.S.: Mathematical Structures of Language. Interscience Publishers, New York (1968)

    MATH  Google Scholar 

  7. Israel, G.: Determining sample size. Tech. rep., University of Florida (1992)

    Google Scholar 

  8. Lin, D.: Principle-based parsing without overgeneration. In: Proc. ACL 1993, Columbus, Ohio (1993)

    Google Scholar 

  9. Pantel, P.: Clustering by committee. Ph.D. thesis, Edmonton, Alta., Canada (2003), adviser-Dekang Lin

    Google Scholar 

  10. Piasecki, M., Broda, B., Głąbska, M., Marcińczuk, M., Szpakowicz, S.: Semi-automatic expansion of polish wordnet based on activation-area attachment. In: Recent Advances in Intelligent Information Systems, pp. 247–260. EXIT (2009)

    Google Scholar 

  11. Piasecki, M., Szpakowicz, S., Marcińczuk, M., Broda, B.: Classification-based filtering of semantic relatedness in hypernymy extraction. In: Nordström, B., Ranta, A. (eds.) GoTAL 2008. LNCS (LNAI), vol. 5221, pp. 393–404. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Piasecki, M., Szpakowicz, S., Broda, B.: A Wordnet from the Ground Up. Oficyna Wydawnicza Politechniki Wrocławskiej, Wrocław (2009)

    Google Scholar 

  13. Przepiórkowski, A.: The IPI PAN Corpus: Preliminary version. Institute of Computer Science PAS (2004)

    Google Scholar 

  14. Ravichandran, D., Pantel, P., Hovy, E.: Randomized algorithms and nlp: using locality sensitive hash function for high speed noun clustering. In: Proc. of the 43rd Annual Meeting on ACL, pp. 622–629 (2005)

    Google Scholar 

  15. Snow, R.: Semantic Taxonomy Induction. Ph.D. thesis (2009)

    Google Scholar 

  16. Snow, R., Jurafsky, D., Ng, A.Y.: Semantic taxonomy induction from heterogenous evidence. In: COLING 2006 (2006)

    Google Scholar 

  17. Weiss, D.: Korpus Rzeczpospolitej, corpus from the online edtion of Rzeczypospolita (2008), http://www.cs.put.poznan.pl/dweiss/rzeczpospolita

  18. Widdows, D.: Unsupervised methods for developing taxonomies by combining syntactic and statistical information. In: Proc. HLT of North American Chapter of the ACL (2003)

    Google Scholar 

  19. Witschel, H.F.: Using decision trees and text mining techniques for extending taxonomies. In: Proc. of Learning and Extending Lexical Ontologies by Using Machine Learning Methods, Workshop at ICML 2005 (2005)

    Google Scholar 

  20. Yang, H., Callan, J.: A metric-based framework for automatic taxonomy induction. In: Proceedings of the 47th Annual Meeting of the ACL and the 4th IJCNLP of the AFNLP, pp. 271–279. ACL (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Pascal Bouvry Mieczysław A. Kłopotek Franck Leprévost Małgorzata Marciniak Agnieszka Mykowiecka Henryk Rybiński

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Broda, B., Kurc, R., Piasecki, M., Ramocki, R. (2012). Evaluation Method for Automated Wordnet Expansion. In: Bouvry, P., Kłopotek, M.A., Leprévost, F., Marciniak, M., Mykowiecka, A., Rybiński, H. (eds) Security and Intelligent Information Systems. SIIS 2011. Lecture Notes in Computer Science, vol 7053. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25261-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25261-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25260-0

  • Online ISBN: 978-3-642-25261-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics