Comparison of Conceptual Graphs

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

DOI: 10.1007/10720076_50

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1793)
Cite this paper as:
Montes-y-Gómez M., Gelbukh A., López-López A. (2000) Comparison of Conceptual Graphs. In: Cairó O., Sucar L.E., Cantu F.J. (eds) MICAI 2000: Advances in Artificial Intelligence. MICAI 2000. Lecture Notes in Computer Science, vol 1793. Springer, Berlin, Heidelberg

Abstract

In intelligent knowledge-based systems, the task of approximate matching of knowledge elements has crucial importance. We present the algorithm of comparison of knowledge elements represented with conceptual graphs. The method is based on well-known strategies of text comparison, such as Dice coefficient, with new elements introduced due to the bipartite nature of the conceptual graphs. Examples of comparison of two pieces of knowledge are presented. The method can be used in both semantic processing in natural language interfaces and for reasoning with approximate associations.

Keywords

conceptual graphs approximate matching knowledge representation 

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
  • Alexander Gelbukh
    • 1
  • Aurelio López-López
    • 2
  1. 1.Center for Computing Research (CIC)National Polytechnic Institute (IPN)Mexico D.F.Mexico
  2. 2.INAOE, ElectronicsTonantzintla, PueblaMéxico

Personalised recommendations