We use the latter approach, obtaining DCS trees by rule-based conversion from universal dependency (UD) trees (McDonald et al., 2013).
nodes in a DCS tree are content words in a UD tree, which are in the form of lemma-POS pairs (Figure 3).