This suggests that the algorithm is highly dependent on the quality of the semantic network used as input.
hRGs are known to be more appropriate for so-called small-world networks, graphs composed of densely-connected subgraphs with relatively sparse connections between (Klapaftis and Manandhar, 2010).