(Heilman and Smith, 2010) develop an improved Tree Edit Distance (TED) model for learning tree transformations in a q/a pair.
we rely on the shallow tree representation, where text spans identified by a shallow syntactic parser serve as a source of candidate answers.