K 2 is a convolution tree kernel (Collins and Duffy, 2001), which operates on the tree-based features.
k 2 computes the similarity of two parse trees by efficiently enumerating the number of common substructures in them.