We conceptualize the similarity between subgraphs representing predicate-argument structures as an alignment problem.
we seek to find an optimal alignment between the alignment domain M of a labeled graph and the alignment range N of an unlabeled sentence.