Denote by T syn(kl) a nontrivial (supports some compression) subtree of T syn that is completely contained in an EDU (i, j).
we build the following combined compression tree, which we refer to as the augmentation of T rst with T syn(kl) : we maintain the existing tree structure except for the EDU (i, j), which is broken into three parts: the outer two depend on each other (is a claims adjuster and .