As usual, a tree kernel, although written in a recursive way, computes the following general equation: (1) In our case, the basic similarity K F (t i , t j ) is defined to take into account the syntactic structure and the distributional semantic part.
productions of the initial subtrees are complete.