Matching algorithms are implemented with two levels of abstraction, a fine grain implementation of matching algorithms and a coarse grain aggregation of family of matching algorithms based on utilization. Individual algorithms are classified into three categories; Primary, Secondary, and Complimentary algorithms.

Primary family instantiates a set of algorithms that are executed for every matching request that currently are; StringBased, LabelBased, and ChildBased.

Secondary family instantiates a set of algorithms that are executed by request to dig deeper into ontologies for higher accuracy, this set currently includes, PropertyBased, Synonym, and Hyponym algorithms.

Complementary family instantiates a set of algorithms that are executed by request in context with domain; for example, two ontologies from medical domain have higher chances of matchable concepts, so by executing complimentary set of algorithms might contribute in the accuracy. These algorithms currently are Overlap and Polysemous.