Its graph structure allows for interesting exploitation opportunities, some of them addressed in this paper.
we propose a method to discover candidate translations for a given lexical entry and an algorithm to compute the confidence degree for such translations, based on the density exploration of the graph.