The maximum depth of T P is D P (or D S of T S ).
p is more similar to Q compared with S. we have The lemma tells us that the similarity ordering between candidates in WordNet depends on the integration of the shortest path and the maximum depth of the taxonomy.