Although clustering proves to be an alternative to lists, it seeks a global, possibly nested partition in which clusters represent sets of indistinguishable objects regarding the cluster criterion.
to this, we present cohesion trees (CT) as a data structure, in which single objects are hierarchically ordered on the basis of lexical cohesion.