Chunking with support vector machines
2001pp. 1–8
Citations Over TimeTop 1% of 2001 papers
Abstract
We apply Support Vector Machines (SVMs) to identify English base phrases (chunks). SVMs are known to achieve high generalization performance even with input data of high dimensional feature spaces. Furthermore, by the Kernel principle, SVMs can carry out training with smaller computational overhead independent of their dimensionality. We apply weighted voting of 8 SVMsbased systems trained with distinct chunk representations. Experimental results show that our approach achieves higher accuracy than previous approaches.
Related Papers
- → Input space versus feature space in kernel-based methods(1999)1,168 cited
- → On the separability of kernel functions(2004)2 cited
- → Kernel Function Studies on the Support Vector Machine in Lower Limb Motion Pattern Recognition of Stoke Patients(2013)2 cited
- → Tutorial I: Neural networks and support vector machines(2011)
- → Improving the Performance of Support Vector Machines by Learning Feature Maps(2006)