TY - GEN
T1 - Comparison of conceptual graphs
AU - Montes-Y-Gómez, Manuel
AU - Gelbukh, Alexander
AU - López-López, Aurelio
PY - 2000
Y1 - 2000
N2 - 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.
AB - 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.
KW - Approximate matching
KW - Conceptual graphs
KW - Knowledge representation
UR - http://www.scopus.com/inward/record.url?scp=84897585673&partnerID=8YFLogxK
U2 - 10.1007/10720076_50
DO - 10.1007/10720076_50
M3 - Contribución a la conferencia
SN - 3540673547
SN - 9783540673545
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 548
EP - 556
BT - MICAI 2000
T2 - 1st Mexican International Conference on Artificial Intelligence, MICAI 2000
Y2 - 11 April 2000 through 14 April 2000
ER -