Maths

Document 1:

<root>
  <a> test 1 </a>
  <b> test 2 </a>
</root>

Document 2:

<root>
  <a> test 1 </a>
  <b> test 2 </a>
  <c> test 3 </c>
</root>

E = {e1, e2}
V = {v1, v2, v3}
w = E → R
D = (V, E, w)

E' = {e1, e2, e3}
V' = {v1, v2, v3, v4}
w' = E' → R'
D' = (V', E', w')

V x V = { (v1, v2), (v1, v3), (v2, v1), (v2, v3), (v3, v1), (v3, v2) }

V' x V' = { (v1, v2), (v1, v3), (v1, v4), (v2, v1), (v2, v3), (v2, v4), (v3, v1), (v3, v2), (v3, v4), ... }

E \setof V x V

E' \setof V' x V'

S = nodeset correspondence

S = {(v, v') \suchthat v \memberof V \and v' \memberof V'}

The maximal correspondence is :

S_1 \propersubset