The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Kernel methods for relation extraction
Open accessAbstract
We present an application of kernel methods to extracting relations from unstructured natural language sources. We introduce kernels defined over shallow parse representations of text, and design efficient algorithms for computing the kernels. We use the devised kernels in conjunction with Support Vector Machine and Voted Perceptron learning algorithms for the task of extracting person-affiliation and organization-location relations from text. We experimentally evaluate the proposed methods and compare them with feature-based learning algorithms, with promising results.
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
A maximum entropy approach to natural language processing
Berger, A. L., Pietra, V. J. D., & Pietra, S. A. D. (1996) · doi:10.5555/234285.234289 · Cited by 3,065
Furey, T. S., Cristianini, N., Duffy, N., Bednarski, D. W., Schummer, M., & Haussler, D. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.10.906 · Cited by 2,443
Statistical Methods for Speech Recognition
Sun, D. X., & Jelinek, F. (1999) · Journal of the American Statistical Association · doi:10.2307/2670189 · Cited by 1,946
Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanisms
White, B. W., & Rosenblatt, F. (1963) · The American Journal of Psychology · doi:10.2307/1419730 · Cited by 1,792
Maximum Entropy Markov Models for Information Extraction and Segmentation
McCallum, A., Freitag, D., & Pereira, F. C. N. (2000) · Cited by 1,315
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
Learning to Classify Text Using Support Vector Machines: Methods, Theory and Algorithms
Joachims, T. (2002) · Cited by 932
Abney, S. P. (1991) · Studies in Linguistics and Philosophy · doi:10.1007/978-94-011-3474-3_10 · Cited by 882
Convolution Kernels for Natural Language
Collins, M., & Duffy, N. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0085 · Cited by 808
An Algorithm that Learns What's in a Name
Bikel, D. M., Schwartz, R., & Weischedel, R. M. (1999) · Machine Learning · doi:10.1023/a:1007558221122 · Cited by 776
Collins, M., & Duffy, N. (2001) · Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02 · doi:10.3115/1073083.1073128 · Cited by 506
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
A generalized kernel approach to dissimilarity-based classification
Pękalska, E., Paclı́k, P., & Duin, R. P. W. (2002) · doi:10.5555/944790.944810 · Cited by 350
Information Extraction with HMM Structures Learned by Stochastic Optimization
Freitag, D., & McCallum, A. (2000) · Cited by 282
Watkins, C. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0006 · Cited by 244
Time Warps, String Edits, and Macromolecules
Sankhoff, D., & Kruskal, J. B. (1999) · University of Groningen research database (University of Groningen / Centre for Information Technology) · Cited by 213
Relational learning via propositional algorithms: an information extraction case study
Roth, D., & Yih, W.-T. (2001) · Cited by 83
A Learning Approach to Shallow ParsingPreprint
Muñoz, M., Punyakanok, V., Roth, D., & Zimak, D. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0008022 · Cited by 82
Learning in natural language: theory and algorithmic approaches
Roth, D. (2000) · Conference on Computational Natural Language Learning · doi:10.3115/1117601.1117603 · Cited by 53
Cited by
End-to-End Relation Extraction using LSTMs on Sequences and Tree Structures
Miwa, M., & Bansal, M. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1105 · Cited by 1,322
Distant Supervision for Relation Extraction via Piecewise Convolutional Neural Networks
Zeng, D., Liu, K., Chen, Y., & Zhao, J. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1203 · Cited by 1,149
A shortest path dependency kernel for relation extraction
Bunescu, R. C., & Mooney, R. J. (2005) · Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05 · doi:10.3115/1220575.1220666 · Cited by 955
Graph Convolution over Pruned Dependency Trees Improves Relation Extraction
Zhang, Y., Qi, P., & Manning, C. D. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1244 · Cited by 847
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
Metadata
- Authors
- Zelenko, D., Aone, C., & Richardella, A.
- Venue
- Proceedings of the ACL-02 conference on Empirical methods in natural language processing - EMNLP '02
- Published
- 2002
- Volume
- 10
- Pages
- 71-78
- OpenAlex
- W2162590473
- Cited by
- 573
- References
- 28
- FWCI
- 5.71
- Type
- conference paper
- Language
- en
- Open access
- gold
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.