Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 318-329
- https://doi.org/10.1007/11871842_32
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Speeding up training with tree kernels for node relation labelingPublished by Association for Computational Linguistics (ACL) ,2005
- Boosting-based parse reranking with subtree featuresPublished by Association for Computational Linguistics (ACL) ,2005
- Introduction to the CoNLL-2005 shared taskPublished by Association for Computational Linguistics (ACL) ,2005
- Kernel Methods for Pattern AnalysisPublished by Cambridge University Press (CUP) ,2004
- Dependency tree kernels for relation extractionPublished by Association for Computational Linguistics (ACL) ,2004
- A study on convolution kernels for shallow semantic parsingPublished by Association for Computational Linguistics (ACL) ,2004
- Convolution kernels with feature selection for natural language processing tasksPublished by Association for Computational Linguistics (ACL) ,2004
- Question classification using support vector machinesPublished by Association for Computing Machinery (ACM) ,2003
- Fast methods for kernel-based text analysisPublished by Association for Computational Linguistics (ACL) ,2003
- Building a Large Annotated Corpus of English: The Penn TreebankPublished by Defense Technical Information Center (DTIC) ,1993