The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Convolution Kernels for Natural Language
Abstract
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
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Building a Large Annotated Corpus of English: The Penn Treebank
Marcus, M. (1993) · doi:10.21236/ada273556 · Cited by 7,405
Theoretical Foundations of the Potential Function Method in Pattern Recognition Learning
Айзерман, М. А. (1964) · Automation and Remote Control · Cited by 1,485
Convolution kernels on discrete structures
Haussler, D. H. (1999) · Cited by 1,089
Large margin classification using the perceptron algorithm
Freund, Y., & Schapire, R. E. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279985 · Cited by 1,071
Discriminative Reranking for Natural Language Parsing
Collins, M., & Koo, T. (2005) · Computational Linguistics · doi:10.1162/0891201053630273 · Cited by 710
Self-citationText Classification using String Kernels
Lodhi, H. M., Shawe-Taylor, J. S., Cristianini, N., & Watkins, C. J. C. H. (2000) · Bristol Research (University of Bristol) · Cited by 620
Kernel principal component analysis
Schölkopf, B., Smola, A. J., & Müller, K. (1999) · International Conference on Neural Information Processing · doi:10.5555/299094.299113 · Cited by 390
(1998) · MPG.PuRe (Max Planck Society) · Cited by 293
Watkins, C. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0006 · Cited by 244
Statistical Techniques for Natural Language Parsing
Eugene Charniak, D. (1997) · doi:10.1609/aimag.v18i4.1320 · Cited by 232
The DOP Estimation Method Is Biased and Inconsistent
Johnson, M. (2002) · Computational Linguistics · doi:10.1162/089120102317341783 · Cited by 97
Cited by
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
“by looking at matches of subtrees [Collins and Duffy, 2002].”
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582
Collins, M. (2002) · Proceedings of the ACL-02 conference on Empirical methods in natural language processing - EMNLP '02 · doi:10.3115/1118693.1118694 · Cited by 1,862
Self-citationKernel methods in machine learning
Hofmann, T., Schölkopf, B., & Smola, A. J. (2008) · The Annals of Statistics · doi:10.1214/009053607000000677 · Cited by 1,651
On Graph Kernels: Hardness Results and Efficient Alternatives
Gärtner, T., Flach, P., & Wrobel, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_11 · Cited by 879
Metadata
- Authors
- Collins, M., & Duffy, N.
- Venue
- Advances in Neural Information Processing Systems 14
- Publisher
- The MIT Press
- Published
- 2002-11-08
- Pages
- 625-632
- OpenAlex
- W2127713198
- Cited by
- 808
- References
- 12
- FWCI
- 56.80
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.