All candidate entities for the different NE textual mentions in the document are represented as an undirected graph G = (V, D) where V is the node set of all possible candidate entities for different NE textual mentions in the input document and D is the set of edges between nodes.
the popularity score dominates the final rank score.