Tech Report

An Ontology-Driven Similarity Algorithm

This paper presents our similarity algorithm between relations in a user query written in FOL (first order logic) and ontological relations. Our similarity algorithm takes two graphs and produces a mapping between elements of the two graphs (i.e. graphs associated to the query, a subsection of ontology relevant to the query). The algorithm assesses structural similarity and concept similarity. An evaluation of our algorithm using the KMi Planet ontology is presented. We also carried out an experiment to test the human judgment about similarity using context and without context. Our similarity algorithm has been mainly used in AQUA, our question answering system, in the query reformulation process.

ID: kmi-04-16

Date: 2004

Author(s): Maria Vargas-Vera, Enrico Motta

Resources:
Download PDF

View By

Other Publications

CONTACT US

Knowledge Media Institute
The Open University
Walton Hall
Milton Keynes
MK7 6AA
United Kingdom

Tel: +44 (0)1908 653800

Fax: +44 (0)1908 653169

Email: KMi Support

COMMENT

If you have any comments, suggestions or general feedback regarding our website, please email us at the address below.

Email: KMi Development Team