Advertisement

Automatic Acquisition of Synonyms of Verbs from an Explanatory Dictionary Using Hyponym and Hyperonym Relations

  • Noé Alejandro Castro-Sánchez
  • Grigori Sidorov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6718)

Abstract

In this paper we present an automatic method for extraction of synonyms of verbs from an explanatory dictionary based only on hyponym/hyperonym relations existing between the verbs defined and the genus used in their definitions. The set of pairs verb-genus can be considered as a directed graph, so we applied an algorithm to identify cycles in these kind of structures. We found that some cycles represent chains of synonyms. We obtain high precision and low recall.

Keywords

automatic acquisition of synonyms hyponym and hyperonym relations directed graph cycles in explanatory dictionaries 

References

  1. 1.
    Atserias, J., Casas, B., Comelles, E., Gonzáles, M., Padró, L., Padró, M.: FreeLing 1.3: Syntactic and Semantic Services in an Open-Source NLP Library. In: Fifth international conference on Language Resources and Evaluation, Genoa, Italy (2006), http://www.lsi.upc.edu/nlp/freeling
  2. 2.
    Blondel, V., Senellart, P.: Automatic extraction of synonyms in a dictionary. In: Proceedings of the SIAM Text Mining Workshop, Arlington, VA (2002)Google Scholar
  3. 3.
    Gelbukh, A., Kolesnikova, O.: Supervised Learning for Semantic Classification of Spanish Collocations. Advances in Pattern Recognition 6256, 362–371 (2010)CrossRefGoogle Scholar
  4. 4.
    Gelbukh, A., Sidorov, G.: Automatic selection of defining vocabulary in an explanatory dictionary. In: Gelbukh, A. (ed.) CICLing 2002. LNCS, vol. 2276, pp. 300–303. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Hang, W., Ming, Z.: Optimizing synonym extraction using monolingual and bilingual resources. In: Proc. International Workshop on Paraphrasing (2003)Google Scholar
  6. 6.
    Johnson, D.: Finding all the Elementary Circuits of a Directed Graph. SIAM Journal on Computing 4(1), 77–84 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Muller, P., Hathout, N., Gaume, B.: Synonym Extraction Using a Semantic Distance on a Dictionary. In: Proceedings of TextGraphs: The Second Workshop on Graph Based Methods for Natural Language Processing, pp. 65–72 (2006)Google Scholar
  8. 8.
    Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing, 146–160 (1972)Google Scholar
  9. 9.
    Tarjan, R.: Enumeration of the elementary circuits of a directed graph. SIAM Journal on Computing, 211–216 (1973)Google Scholar
  10. 10.
    Tiernan, C.: An efficient algorithm for finding the simple cycles of a finite directed graph. Comm. ACM 13, 722–726 (1970)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Wang, T.: Extracting Synonyms from Dictionary Definitions. In: Recent Advances in Natural Language Processing (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Noé Alejandro Castro-Sánchez
    • 1
  • Grigori Sidorov
    • 1
  1. 1.Natural Language and Text Processing Laboratory, Center for Research in Computer Science (CIC)Instituto Politécnico Nacional (IPN)Mexico CityMexico

Personalised recommendations