Their kernel is defined on lexical dependency tree by the convolution of similarities between all possible subtrees.
if the convolution containing too many irrelevant subtrees, over-fitting may occur and decreases the performance of the classifier.