As mentioned previously, all the graph embedding methods of the previous section exploit the semantic similarity between words but for an entry, this similarity is not linearly correlated with the rank of its relevant neighbors in the thesaurus.
the relevance of the semantic neighbors of an entry strongly decreases as their rank increases and the first neighbors are particularly important.