Automatic Enrichment of Very Large Dictionary of Word Combinations on the Basis of Dependency Formalism

  • Alexander Gelbukh
  • Grigori Sidorov
  • Sang-Yong Han
  • Erika Hernández-Rubio
Conference paper

DOI: 10.1007/978-3-540-24694-7_44

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2972)
Cite this paper as:
Gelbukh A., Sidorov G., Han SY., Hernández-Rubio E. (2004) Automatic Enrichment of Very Large Dictionary of Word Combinations on the Basis of Dependency Formalism. In: Monroy R., Arroyo-Figueroa G., Sucar L.E., Sossa H. (eds) MICAI 2004: Advances in Artificial Intelligence. MICAI 2004. Lecture Notes in Computer Science, vol 2972. Springer, Berlin, Heidelberg

Abstract

The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sentences. The dependency formalism is used for representation of syntactic trees that allows for easier treatment of information about syntactic compatibility. Evaluation of the method is presented for the Spanish language based on comparison of the automatically generated results with manually marked word combinations.

Keywords

Collocations parsing dependency grammar Spanish 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Alexander Gelbukh
    • 1
    • 2
  • Grigori Sidorov
    • 1
  • Sang-Yong Han
    • 2
  • Erika Hernández-Rubio
    • 1
  1. 1.Center for Computing Research, National Polytechnic InstituteNatural Language and Text Processing LaboratoryMexico CityMexico
  2. 2.Department of Computer Science and EngineeringChung-Ang UniversitySeoulKorea

Personalised recommendations