To overcome this time bottleneck, we compute features only for those analyses of every input sentence prefix that belongs to the kbest analyses at the end of the sentence.
π n is the set of only those prefix trees that are used by the k-best analyses at the end of the sentence.