Using the T O metric, a hierarchy H 1 with edges would yield a score of T O(H 1 , H 2 ) = 1 (a perfect match), which contradicts our notion of a hierarchy branching from general to specific information.
we propose our new modification called the hierarchy overlap which is the weighted sum of T O, the superset overlap SupO, and the subset overlap SubO score.