Then, a maximum spanning tree T q of the graph is calculated starting from vertex q (see the bold edges in Figure 4(e)).
this experiment corroborates the findings obtained from our extrinsic experiments: Curvature is the worst-ranking system (probably because of the low number of induced senses), whereas HyperLex and B-MSt are more apt to discriminate between the meanings of an input query.