Given a pair of words (i, j) and associated word vectors , we compute the similarity between two words by their vector similarity.
we encode this similarity in a weighted adjacency matrix A: nodes are only connected to their knearest neighbors (Section 6.2 examines the sensitivity to k); all other edges become zero.