Information retrieval with conceptual graph matching

Manuel Montes-y-Gómez, Aurelio López-López, Alexander Gelbukh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

49 Scopus citations

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.

Original languageEnglish
Title of host publicationDatabase and Expert Systems Applications - 11th International Conference, DEXA 2000, Proceedings
EditorsMohamed Ibrahim, Josef Kung, Norman Revell
PublisherSpringer Verlag
Pages312-321
Number of pages10
ISBN (Print)9783540679783
DOIs
StatePublished - 2000
Event11th International Conference on Database and Expert Systems Applications, DEXA 2000 - London, United Kingdom
Duration: 4 Sep 20008 Sep 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1873
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Database and Expert Systems Applications, DEXA 2000
Country/TerritoryUnited Kingdom
CityLondon
Period4/09/008/09/00

Fingerprint

Dive into the research topics of 'Information retrieval with conceptual graph matching'. Together they form a unique fingerprint.

Cite this