%0 Conference Paper %1 Montes:2001 %A Montes-y-Gómez, Manuel %A Gelbukh, Alexander %A Baeza-Yates, Ricardo %B Proc. DEXA-2001 %D 2001 %I Springer-Verlag %K inf_retrieval semantic_closeness %N 2113 %P 102-111 %T Flexible Comparison of Conceptual Graphs %X 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.

@inproceedings{Montes:2001, 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.}, added-at = {2007-12-14T02:44:08.000+0100}, author = {{Montes-y-G{\'o}mez}, Manuel and Gelbukh, Alexander and Baeza-Yates, Ricardo}, biburl = {https://www.bibsonomy.org/bibtex/256fc5f404aea37d8e99b2ae8fa068f58/diego_ma}, booktitle = {Proc. DEXA-2001}, interhash = {9856d735d3660a527040d4eb6801cc8f}, intrahash = {56fc5f404aea37d8e99b2ae8fa068f58}, keywords = {inf_retrieval semantic_closeness}, number = 2113, pages = {102-111}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, timestamp = {2007-12-14T02:44:08.000+0100}, title = {Flexible Comparison of Conceptual Graphs}, year = 2001 }