(2005), it was recently elucidated by Tiedemann (2014), whose implementation we follow here.
to our approach, DCA projects trees on a source-target sentence pair basis, relying on heuristics and spurious nodes or edges to maintain the tree structure.