Information Retrieval with Conceptual Graph Matching

  • Manuel Montes-y-Gómez
  • Aurelio López-López
  • Alexander Gelbukh
Conference paper

DOI: 10.1007/3-540-44469-6_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1873)
Cite this paper as:
Montes-y-Gómez M., López-López A., Gelbukh A. (2000) Information Retrieval with Conceptual Graph Matching. In: Ibrahim M., Küng J., Revell N. (eds) Database and Expert Systems Applications. DEXA 2000. Lecture Notes in Computer Science, vol 1873. Springer, Berlin, Heidelberg

Abstract

The use of conceptual graphs for the representation of text contents in information retrieval is discussed. A method for measuring the similarity between two texts represented as conceptual graphs is presented. The method is based on well-known strategics of text comparison, such as Dice coefficient, with new elements introduced due to the bipartite nature of the conceptual graphs. Examples of the representation and comparison of the phrases are given. The structure of an information retrieval system using two-level document representation, traditional keywords and conceptual graphs, is presented.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Manuel Montes-y-Gómez
    • 1
  • Aurelio López-López
    • 2
  • Alexander Gelbukh
    • 1
  1. 1.Center for Computing Research (CIC)National Polytechnic Institute (IPN)DFMéxico
  2. 2.INAOEPueblaMexico

Personalised recommendations