Flexible Comparison of Conceptual Graphs*

  • M. Montes-y-Gómez
  • A. Gelbukh
  • A. López-López
  • R. Baeza-Yates
Conference paper

DOI: 10.1007/3-540-44759-8_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2113)
Cite this paper as:
Montes-y-Gómez M., Gelbukh A., López-López A., Baeza-Yates R. (2001) Flexible Comparison of Conceptual Graphs*. In: Mayr H.C., Lazansky J., Quirchmayr G., Vogel P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg

Abstract

Conceptual graphs allow for powerful and computationally affordable representation of the semantic contents of natural language texts. We propose a method of comparison (approximate matching) of conceptual graphs. The method takes into account synonymy and subtype/supertype relationships between the concepts and relations used in the conceptual graphs, thus allowing for greater flexibility of approximate matching. The method also allows the user to choose the desirable aspect of similarity in the cases when the two graphs can be generalized in different ways. The algorithm and examples of its application are presented. The results are potentially useful in a range of tasks requiring approximate semantic or another structural matching - among them, information retrieval and text mining.

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

  • M. Montes-y-Gómez
    • 1
  • A. Gelbukh
    • 1
  • A. López-López
    • 2
  • R. Baeza-Yates
    • 3
  1. 1.Center for Computing Research (CIC)National Polytechnic Institute (IPN)Mexico
  2. 2.Instituto Nacional de Astrofísica, Optica y Electrónica (INAOE)Mexico
  3. 3.Departamento de Ciencias de la ComputaciónUniversidad de ChileChile

Personalised recommendations