Input: a graph G q = (V, E) to be clustered Output: a clustering C of the vertices in V class(v i ) := i 3: Dice (u, v) 9: 10: As soon as an iteration produces no change in the clustering (line 11), the algorithm stops and outputs the final clustering (line 12).
to the best of our knowledge, with the exception of some very preliminary results (Véronis 2004;Basile, Caputo, and Semeraro 2009), this is the first time that unsupervised text understanding techniques have been shown to considerably boost an Information Retrieval task in a solid evaluation framework.