The algorithm finishes when no more pending words remain in P. Algorithm 1 SSI-Dijkstra Algorithm SSI (T: list of terms) for each {t ∈ T } do Initially, the list I of interpreted words should include the senses of the monosemous words in W, or a fixed set of word senses 5 .
when dis-ambiguating a TS of a word sense s (for instance party#n#1), the list I already includes s. In order to measure the proximity of one synset to the rest of synsets of I, we use part of the knowledge already available to build a very large connected graph with 99,635 nodes (synsets) and 636,077 edges.