This algorithm has been built into an on-line demonstration where the user inputs a given seed word and can then see the cluster of related words being gradually assembled.
• The equivalence classes of the graph G under this relation are called the components of G. We are now in a position to define the senses of a word as represented by a particular graph.