(c) The use of fast tree kernels (Moschitti 2006a) along with the proposed tree representations makes the learning and classification much faster, so that the overall running time is comparable with polynomial kernels.
when used with SVMs their running time on very large data sets (e. g., millions of instances) becomes prohibitive.