The proposed algorithm simulates the established unification mechanism in FB-TAG without affecting the representation and the stipulations (e.g., null adjunction at the foot node and the bounded feature structures) of the grammar itself.
("No adjunction") unify the top and the bottom feature structures of nodes where no adjunction occurs, and Type 4(b) rules ("Start root of adjunction") unify the top feature (η.T) of the node (η) being adjoined to with the top feature structure (η r .T) of the root node (η r ) of the auxiliary tree being adjoined: 4 As shown in Figure 10, this approach can incorrectly lead to derivation failures in the case of an independent multiple adjunction.