Therefore, we report all further results on the basis of the sim weights.
output: clusters C. Cluster the open neighborhood of u 7: Global Step: Sense Graph Construction 13: C ← Cluster Global (G) Global Step: Sense Graph Clustering 14: Remove the sense labels 15: return C Given a pair {u, v} ∈ E, we reuse the sense information from Table 2 to determine which context of a senseû ∈ V contains v. We denote this as senses , that is, the fact that node v is connected to the node u in the specified sense u senses[u] [v] .