Traditionally, syntactic information from parse trees is represented as a set of flat features.
the new composite kernel K c , defined as the multiplier of normalized K t and K n , will return a value close to 1 only if both the structured features and the normal features from the two vectors have high similarity under their respective kernels.