The disambiguation graph G D is then just the union of the vertices and edges of the shortest paths, The disambiguation graph G D is thus a subgraph of the original G KB graph obtained by computing the shortest paths between the concepts of the words co-occurring in the context.
we hypothesize that it captures the most relevant concepts and relations in the knowledge base for the particular input context.