To render learning tractable, the key idea is to augment the local event and argument states so that they contain sufficient information for evaluating φ K (z).
the semantic state z(n i ) needs to represent not only the semantic assignment to n i (e.g., a NEG-REG event trigger), but also the set of (possibly incomplete) sub-events in the subtree under n i .