@inproceedings{6058ebf4b83f469494cdee0ae10f5192,
title = "Flexible comparison of conceptual graphs",
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.",
author = "M. Montes-Y-G{\'o}mez and A. Gelbukh and A. L{\'o}pez-L{\'o}pez and R. Baeza-Yates",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 12th International Conference on Database and Expert Systems Applications, DEXA 2001 ; Conference date: 03-09-2001 Through 05-09-2001",
year = "2001",
doi = "10.1007/3-540-44759-8_12",
language = "Ingl{\'e}s",
isbn = "3540425276",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "102--111",
editor = "Mayr, {Heinrich C.} and Jiri Lazansky and Gerald Quirchmayr and Pavel Vogel",
booktitle = "Database and Expert Systems Applications - 12th International Conference, DEXA 2001, Proceedings",
address = "Alemania",
}