Finally, we know that w 1 and w 2 are in a sentence together but cannot assume that there is a dependency relation between them.
we can choose to think of each sentence as a fully connected graph, with an edge going from every lemma to every other lemma in the same sentence.