The proposed technique works on lightweight ontologies, namely, tree structures where each node is labeled by a natural language sentence, for example in English.
[3] These sentences are translated into a formal logical formula (according to an unambiguous, artificial language).
The output of matching is a mapping, namely a set of semantic correspondences between the two graphs.
Notice that this is a rather important feature because the number of possible mappings can reach n × m with n and m the size of the two input ontologies.
Many systems and corresponding interfaces, mostly graphical, have been provided for the management of mappings but all of them scale poorly with the number of nodes.