A new paradigm in Semantic Web research focuses on the
development of a new generation of knowledge-based problem solvers,
which can exploit the massive amounts of formally specied information
available on the Web, to produce novel intelligent functionalities. An
important example of this paradigm can be found in the area of Ontol-
ogy Matching, where new algorithms, which derive mappings from an
exploration of multiple and heterogeneous online ontologies, have been
proposed. While these algorithms exhibit very good performance, they
rely on merely syntactical techniques to anchor the terms to be matched
to those found on the Semantic Web. As a result, their precision can
be aected by ambiguous words. In this paper, we aim to solve these
problems by introducing techniques from Word Sense Disambiguation,
which validate the mappings by exploring the semantics of the ontolog-
ical terms involved in the matching process. Specically we discuss how
two techniques, which exploit the ontological context of the matched and
anchor terms, and the information provided by WordNet, can be used to
lter out mappings resulting from the incorrect anchoring of ambiguous
terms. Our experiments show that each of the proposed disambiguation
techniques, and even more their combination, can lead to an important
increase in precision, without having too negative an impact on recall.
(C) Copyright 2003-2006 by Digital Enterprise Research Institute (DERI) and WETI & Main Library Gdansk University of Technology, Poland and Sebastian Ryszard Kruk.
All rights reserved