S-Match is an open source semantic matching framework. Several persons from our research group worked with it for several years, actively using it for research experiments. I've been working on and maintaining S-Match during my PhD studies.
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
- query answering on the web
S-Match is extendable to host new algorithms.
S-Match is an open source software licensed under LGPL license and hosted on SourceForge.