The dynamic programming approach requires the feature vector of a tree to be decomposable into a sum over parts of the tree.
this is impossible with the TOP and Fisher kernels derived from the SSN model.