In this case, we need to (1) compute the similarity of their flat features and the similarity of their tree-based features separately, and then (2) employ a composite kernel, K c , to combine the two similarity values.
we define K c as follows: where F 1 and F 2 are the full set of features (containing both flat and structured features) that represent the two instances under consideration.