In contrast, partial patterns, such as those provided by PTK applied to constituency (or dependency) trees, prove to be effective.
sTK has been considered as the best kernel for exploiting syntactic information in constituency trees, e.g.