Given an ex- isting sentence tree, an auxiliary tree can be applied in a three-step process called "adjunction".
we must have at least one Algorithm 4 calcReward (Algorithm 2, line 13) score −= C 4 |S.sentence| score /= C 5 |B| 11: end if 12: return score valid binding, as this indicates that our partial sentence is factual (with respect to the world); however, more than one binding means that the sentence is ambiguous, so a penalty is applied.