Information retrieval with conceptual graph matching

49Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The use of conceptual graphs for the representation of text contents in information retrieval is discussed. A method for measuring the similarity be¬tween two texts represented as conceptual graphs is presented. 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 the representation and comparison of the phrases are given. The structure of an information retrieval system using two-level docu¬ment representation, traditional keywords and conceptual graphs, is presented.

Cite

CITATION STYLE

APA

Montes-y-Gómez, M., López-López, A., & Gelbukh, A. (2000). Information retrieval with conceptual graph matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1873, pp. 312–321). Springer Verlag. https://doi.org/10.1007/3-540-44469-6_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free