Before giving the technical details of our parsing algorithm (Section 5), we first highlight some differences between our and Schabes and Shieber's approach.
we show that (i) whereas Schabes and Shieber resort to three distinct mechanisms to account for word order constraints (i.e., selective adjoining constraints, linear precedence statements on derivation trees, and a constraint on parsing), the FB-TAG approach supports a uniform treatment of word order and (ii) our approach straightforwardly accounts for mixed dependent/independent derivations that would require some additional stipulation in Schabes and Shieber's approach.