To build the DTs effectively, a common assumption is that they are binary trees (Soricut and Marcu, 2003;duVerle and Prendinger, 2009).
multi-nuclear relations (e.g., LIST, JOINT, SEQUENCE) involving more than two EDUs are mapped to a hierarchical right-branching binary tree.