Current algorithms cannot be used optimally in (semi)automatic ontology matching tasks as envisioned by the Semantic Web community, mainly because of the inherent dependency between algorithms and ontology properties. As one possible solution we suggest a metadata-based ontology matching framework that takes into account the difficulties of current matching algorithms. It uses additional data concerning different matchers to set the rules for the methods and their characteristics in relation with the ontologies to exploit the advantages of these approaches.