We solve both problems jointly, using a graph alignment algorithm.
we view the task of inferring annotations for new verbs as an instance of a structural matching problem and follow a graph-based formulation for pairwise global network alignment (Klau, 2009).