Returns a HashSet that includes each synset seen on the different ways
from this synset to the root exactly once, including the starting synset
and the root.
getAllPaths() -
Method in class de.tuebingen.uni.sfs.germanet.relatedness.Path
Returns all possible paths from the root to this synset.
Finds the maximum possible 'distance' (sum of information content values)
used in the Jiang & Conrath relatedness measure, which is
the IC of 2 leaf nodes with the highest IC (information content), with the
root as their LCS (least common subsumer): max_IC + max_IC - 2*0.0 = 2*max_IC
Assuming that a leaf has the assigned default minimal frequency of 1,
max_IC = -log(1/rootFreq), which is approx.