Each instance-class pair (i, C) extracted in the first phase (Section 2) is represented as a weighted edge in a graph G = (V, E, W ), where V is the set of nodes, E is the set of edges and W : E → R + is the weight function which assigns positive weight to each edge.
for each (i, C, w) triple from the set of base extractions, i and C are added to V and (i, C) is added to E, 2 with W (i, C) = w. The weight w represents the total score of all extractions with that instance and class.