Flexible Comparison of Conceptual GraphsWork done under partial support of CONACyT, CGEPI-IPN, and SNI, Mexico

  • Authors:
  • Manuel Montes-y-Gómez;Alexander F. Gelbukh;Aurelio López-López;Ricardo A. Baeza-Yates

  • Affiliations:
  • -;-;-;-

  • Venue:
  • DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.