For each parse p, its score Sco(p) is defined as follows: where M T (p) is the output of the tree kernel SVMs, M L (p) is the output of linear kernel SVMs, l(p) is the log-likelihood of parse p, and b(p) is the number of brackets in parse p. We noticed that the SVM systems prefers to give higher scores to the parses with less brackets.
the system has a high precision but a low recall.