We therefore propose a parsing algorithm that, given several auxiliary trees β 1 , .
as shown in Section 2.2, however, non-intersective modifiers arguably license a dependent derivation while some cases of multiple adjunction may involve both a dependent and an independent derivation.