In both figures, we observe that HRGs outperform the CWU baseline under all parameter combinations.
a number of NLP problems can be cast into a graphbased framework, in which entities are represented as vertices in a graph and relations between them are depicted by weighted or unweighted edges.