In fact, a co-occurrence graph G q = (V, E) for a query q contains: (i) vertices w ∈ V corresponding to words highly related to q, and (ii) edges e ∈ E representing co-occurrence relations between vertices (i.e., words) in V. The key idea behind graph-based WSI is to obtain a partition contains structurally (i.e., semantically) related vertices (i.e., words).
each vertex set V i is intended to contain only words related to a specific sense of q.