Making Tree Kernels Practical for Natural Language Learning

Abstract

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 (b) a lower accuracy than traditional attribute/value methods. In this paper, we show that tree kernels are very helpful in the processing of natural language as (a) we provide a simple algorithm to compute tree kernels in linear average running time and (b) our study on the classification properties of diverse tree kernels show that kernel combinations always improve the traditional methods. Experiments with Support Vector Machines on the predicate argument classification task provide empirical support to our thesis.

Extracted Key Phrases

10 Figures and Tables

02040'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

307 Citations

Semantic Scholar estimates that this publication has 307 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Moschitti2006MakingTK, title={Making Tree Kernels Practical for Natural Language Learning}, author={Alessandro Moschitti}, booktitle={EACL}, year={2006} }