In general, we can represent a parse tree by a vector of integer counts of each sub-tree type (regardless of its ancestors): This results in a very high dimensionality since the number of different sub-trees is exponential in its size.
it is computational infeasible to directly use the feature vector ∅( ).