In the name of efficiency, we apply several rules to limit the number of pairs of mentions that our algorithm considers.
(we run our Kruskal's-like algorithm on a sparse graph rather than a complete graph with O(n 2 ) edges.)