The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
Open accessOverview
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
Building a Large Annotated Corpus of English: The Penn Treebank
Marcus, M. (1993) · doi:10.21236/ada273556 · Cited by 7,405
Kernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
Automatic Labeling of Semantic Roles
Gildea, D., & Jurafsky, D. (2002) · Computational Linguistics · doi:10.1162/089120102760275983 · Cited by 1,626
Convolution kernels on discrete structures
Haussler, D. H. (1999) · Cited by 1,089
Dependency tree kernels for relation extraction
Culotta, A., & Sorensen, J. (2004) · Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04 · doi:10.3115/1218955.1219009 · Cited by 814
Three generative, lexicalised models for statistical parsing
Collins, M. (1997) · Proceedings of the 35th annual meeting on Association for Computational Linguistics - · doi:10.3115/976909.979620 · Cited by 743
Fast Exact Inference with a Factored Model for Natural Language Parsing
Klein, D., & Manning, C. D. (2002) · Cited by 735
Introduction to the CoNLL-2005 shared task: semantic role labeling
Carreras, X., & Màrquez, L. (2005) · Proceedings of the Ninth Conference on Computational Natural Language Learning - CONLL '05 · doi:10.3115/1706543.1706571 · Cited by 642
Question classification using support vector machines
Zhang, D., & Lee, W. S. (2003) · Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval · doi:10.1145/860435.860443 · Cited by 582
Cited by
Detect Rumors in Microblog Posts Using Propagation Structure via Kernel Learning
Ma, J., Gao, W., & Wong, K.-F. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1066 · Cited by 637
Semantic Sentiment Analysis of Twitter
Saif, H., He, Y., & Alani, H. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35176-1_32 · Cited by 521
Combating Fake News: A Survey on Identification and Mitigation Techniques
Sharma, K., Qian, F., Jiang, H., Ruchansky, N., Zhang, M., & Liu, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3305260 · Cited by 514
Argumentation Mining: State of the Art and Emerging Trends
Lippi, M., & Torroni, P. (2016) · ACM Transactions on Internet Technology · doi:10.1145/2850417 · Cited by 363
Evolution of Semantic Similarity—A Survey
Chandrasekaran, D., & Mago, V. (2022) · ACM Computing Surveys · doi:10.1145/3440755 · Cited by 303
Combining Gameplay Data with Monte Carlo Tree Search to Emulate Human Play
Devlin, S., Anspoka, A., Sephton, N., Cowling, P., & Rollason, J. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v12i1.12858 · Cited by 28
“Specifically, we generated decision tree (Breiman et al. 1984) models of each individual player’s behaviour and then clustered these models using K-medoids (Park and Jun 2009) and a partial tree kernel (Moschitti 2006).”
Method
Metadata
- Authors
- Moschitti, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 318-329
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1587871245
- Cited by
- 452
- References
- 18
- FWCI
- 13.93
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.