Convolution Kernels for Natural Language
Michael Collins, Nigel Duffy · The MIT Press eBooks · 2002
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discrete structures which require some mechanism to convert them into feature vectors. We describe kernels for various natural language structures, allowing rich, high dimensional representations of these structures. We show how a kernel over trees can be applied to parsing using the voted perceptron algorithm, and we give experimental results on the ATIS corpus of parse trees. 1
Cited by 808 works. doi:10.7551/mitpress/1120.003.0085
Authors
References
- Support-Vector Networks
- Building a Large Annotated Corpus of English: The Penn Treebank
- Theoretical Foundations of the Potential Function Method in Pattern Recognition Learning
- Large margin classification using the perceptron algorithm
- Discriminative Reranking for Natural Language Parsing
- Convolution kernels on discrete structures
- Estimators for stochastic "Unification-Based" grammars
- Text Classification using String Kernels
- Dynamic Alignment Kernels
- Kernel principal component analysis