16430 search results - page 184 / 3286 » On Computable Tree Functions |
147
click to vote
ECML
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Ensemble methods are popular learning methods that usually increase the predictive accuracy of a classifier though at the cost of interpretability and insight in the deci...
156
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
138
Voted
AAAI
2008
15 years 6 months ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
153
click to vote
COLING
2008
15 years 5 months ago
2008
In contrast to LFG and HPSG, there is to date no large scale Tree Adjoining Grammar (TAG) equiped with a compositional semantics. In this paper, we report on the integration of a ...
143
click to vote
EACL
2006
ACL Anthology
15 years 5 months ago
2006
ACL Anthology
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...