The boolean feature [∪±] of each node controls whether it must be flattened out or not.
infinitives in canonical position are assigned [∪+]: the above licenses the following tree of word order domains: As a consequence, Reape's theory correctly predicts scrambling (2,3) and full extraposition (4), but cannot handle the partial extraposition in (5): (2) (dass) Maria einen Mann zu lieben versucht (3) (dass) einen Mann Maria zu lieben versucht (4) (dass) Maria versucht, einen Mann zu lieben (5) (dass) Maria einen Mann versucht, zu lieben Our approach is based on dependency grammar.