Schema matching
Updated: 10/02/2017 by Computer Hope
In computer science, schema matching is the comparison of two objects on the basis of their semantics. If two objects (such as a mathematical equation or a snippet of code) can be matched schematically, they are said to be mappable. That is, you can draw a direct comparison between each of their syntactical components.