The approach explores both trees in a bottom-up, postorder manner, running in time: where |T i | is the number of nodes, D i is the depth, and L i is the number of leaves, with respect to tree T i .
we show that this approach is better formulated as a (strongly indicative) feature of a larger set of answer extraction signals.