getMinPathLength(GermaNetObject gno, ArrayList, ArrayList)
using the Dijkstra Algorithm, starting from start and target and determining when the paths meet
get the minimum pathlength between two Synsets,
adding edge weights (relations in ArrayList value, values in HashMap tableMap)
from already computed shortest (edge count!) paths
Class, that provides methods for comparing different path weights;
store paths of word pairs in a hashtable and serialize it,
deserialize the hashtable and compute new pathlengths for changed path weights (table.txt)
and write them in a .csv file
An instance of this class compares a SlimDiscourse (profile) to a corpus
of other SlimDiscourses (descriptions) and computes a ranking represented
in RelatednessResult.
Set wether this PseudoGlossComparator returns relatedness values
that are normalized by the number of all comparisons that
are made to count the overlaps.