Databases Reference
In-Depth Information
3
Existing Tools
Researchers have developed a number of tools that enable users to find matching
correspondences between ontologies. For example, Euzenat et al. discuss more than
20 different algorithms and tools [
Euzenat et al. 2004b
]. In this section, we focus our
discussion on semiautomatic tools that follow an iterative process that is similar to
the one shown in Fig.
2.1
. The user selects the ontologies to be mapped, an algorithm
runs to compute an initial set of correspondences, the user interacts with the tool to
validate the matching correspondences, and the tool uses this information to provide
other possible matches. Some of the projects that we discuss in this chapter are
no longer under active development; and some of the projects are still in the early
research prototype phase and are not available for public use. However, each system
provides an interesting example of the variety of approaches available for supporting
semiautomatic ontology matching.
COMA
[
Do 2006
] automatically generates matchings between source and
target schemas (XML or OWL), and draws lines between potentially matching
terms (see Fig.
2.2
). Users can define their own term matches by interacting with
the schema trees. Hovering over a potential correspondence displays a confidence
level about the match as a numerical value between zero and one. COMA
CC
CC
CC
Fig. 2.2
Screenshot of COMA
interface
