The latent treeỹ needed 4 We also implement the feature mapping function Φ as a hash kernel (Bohnet, 2010) and apply averaging (Collins, 2002), though for brevity we omit this from the pseudocode.
the set of all mentions that precede m j according to the linear order including the root node, or, A j = {m i | i < j}.