The algorithm procedes as follows:

1. locate node cp, the common parent of the two lemmas, if one exists, by checking each sense of each lemma; if one is not found, return 1.0
2. calculate minDistToCommonParent, the shortest path from either lemma to cp
3. calculate distFromCommonParentToRoot, the length of the path from cp to the root of ontology
4. calculate and return the normalizedDistToCommonParent as:
   (minDistToCommonParent / (distFromCommonParentToRoot + minDistToCommonParent))

getDistance(lemma1, lemma2, pos);