S-Match

S-Match is a semantic matching framework.

S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another.

S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms.

S-Match applies as a solution in many fields, including: information integration, ontology evolution and alignment, peer-to-peer information sharing, digital libraries integration, web service composition, agent communication, and query answering on the web.

S-Match is extendable to host new algorithms.