We formalize the detection of similar sentences and the projection of role annotations in graph-theoretic terms by conceptualizing the similarity between labeled and unlabeled sentences as a graph alignment problem.
we represent sentences as dependency graphs and seek an optimal (structural) alignment between them.