We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes . The matching process is essentially divided into two steps: element level and structure level. Element level matchers consider only labels of nodes, while structure level matchers start from this information to consider the full graph. In this paper we present various element level semantic matchers, and discuss their implementation within the S-Match system. The main novelty of our approach is in that element level semantic matchers return semantic relations (=, , , ^) between concepts rather than similarity coefficients between labels in the [0, 1] range.