S-Match is a framework for semantic matching algorithms. To learn more about S-Match visit: semanticmatching.eu
S-Match is written in Java and runs in a Java Virtual Machine version 6 or later. You can get started by downloading S-Match release, building S-Match binary release, or by downloading S-Match examples.
You can run S-Match command-line interface: bin/match-manager
or bin\match-manager.bat
.
You can run the matching of provided sample trees by running bin\all-cw.bat
or
bin/all-cw.sh
. This will execute the following steps:
- convert sample trees in
test-data/cw/c.txt
andtest-data/cw/w.txt
from text files to internal XML format. - enrich the trees with logical formulas ("offline" steps of the algorithm)
- match the trees ("online" steps of the algorithm)
- match the trees with the minimal matching algorithm
The script will render the results of the
- step c) into:
test-data/cw/result-cw.txt
- step d) into:
test-data/cw/result-minimal-cw.txt
Run bin\s-match-gui.bat
or bin/s-match-gui
.
S-Match Examples demonstrates the use of S-Match API.
S-Match is accompanied by S-Match Javadocs and S-Match Wiki.