We formalize the projection task as a graph alignment problem.
we optimize alignments between dependency graphs under an objective function that takes both lexical and structural similarity into account.