A Very Large Database of Collocations and Semantic Links

  • Igor Bolshakov
  • Alexander Gelbukh
Conference paper

DOI: 10.1007/3-540-45399-7_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1959)
Cite this paper as:
Bolshakov I., Gelbukh A. (2001) A Very Large Database of Collocations and Semantic Links. In: Bouzeghoub M., Kedad Z., Métais E. (eds) Natural Language Processing and Information Systems. NLDB 2000. Lecture Notes in Computer Science, vol 1959. Springer, Berlin, Heidelberg

Abstract

A computational system manages a very large database of colloca- tions (word combinations) and semantic links. The collocations are related (in the meaning of a dependency grammar) word pairs, joint immediately or through prepositions. Synonyms, antonyms, subclasses, superclasses, etc. repre- sent semantic relations and form a thesaurus. The structure of the system is uni- versal, so that its language-dependent parts are easily adjustable to any specific language (English, Spanish, Russian, etc.). Inference rules for prediction of highly probable new collocations automatically enrich the database at runtime. The inference is assisted by the available thesaurus links. The aim of the system is word processing, foreign language learning, parse filtering, and lexical dis- ambiguation.

Keywords

dictionary collocations thesaurus syntactic relations semantic relations lexical disambiguation. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Igor Bolshakov
    • 1
  • Alexander Gelbukh
    • 1
  1. 1.Center for Computing ResearchNational Polytechnic InstituteMéxico DF.Mexico

Personalised recommendations