Matcher Metadata
The MOMA-A Matcher Metadata captures information about existing ontology matchers.
For the classification of the algorithms we rely (in the first version) on the work of Rahm & Bernstein
who make the distinction between individual and combining matchers. |
Ontology Metadata The matcher inputs (i.e. ontologies) are described using the metadata model see "Using Context Information to Improve Ontology Reuse", pdf), which can be applied to describe ontologies in various phases of their life-cycle. Accounting for the fact that matching algorithms cannot be applied with the same success expectations regardless of any dimension of the ontology metadata model, we have identified the following ontology features as relevant for matching tasks:
|
Rules In order to automatically infer which
algorithms suit to certain inputs, it needs explicit knowledge regarding the
dependencies between these algorithms and the structures on which they
operate. We formalize this knowledge into dependency rules—statements
that determine which elements (in this case which matchers) are to be used or excluded.
|
Selection Engine For a given pair of ontologies
to be matched, the MOMA selection engine has
to decide which matching algorithms should be applied to obtain the desired outputs. |