the shortest path distance or distance measures that take information beyond the graph structure into account.
experimental Setting To showcase how our approach can be be used inside a graph-based algorithm, we employ word sense disambiguation (WSD) task, reproducing the approach of (Sinha and Mihalcea, 2007).