The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Incremental Joint Extraction of Entity Mentions and Relations
Open accessAbstract
We present an incremental joint framework to simultaneously extract entity mentions and relations using structured perceptron with efficient beam-search.A segment-based decoder based on the idea of semi-Markov chain is adopted to the new framework as opposed to traditional token-based tagging.In addition, by virtue of the inexact search, we developed a number of new and effective global features as soft constraints to capture the interdependency among entity mentions and relations.Experiments on Automatic Content Extraction (ACE) 1 corpora demonstrate that our joint model significantly outperforms a strong pipelined baseline, which attains better performance than the best-reported end-to-end system.
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
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
Generating Typed Dependency Parses from Phrase Structure Parses
de Marneffe, M.-C., MacCartney, B., & Manning, C. D. (2006) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/3wtkaidk6ea8 · Cited by 2,258
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
Design challenges and misconceptions in named entity recognition
Ratinov, L., & Roth, D. (2009) · Proceedings of the Thirteenth Conference on Computational Natural Language Learning - CoNLL '09 · doi:10.3115/1596374.1596399 · Cited by 1,448
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
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
Exploring various knowledge in relation extraction
GuoDong, Z., Jian, S., Jie, Z., & Min, Z. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219893 · Cited by 764
(2004) · Cited by 610
Joint Event Extraction via Structured Prediction with Global Features
Li, Q., Ji, H., & Huang, L. (2013) · Cited by 479
Self-citationA Linear Programming Formulation for Global Inference in Natural Language Tasks
Roth, D., & Yih, W.-T. (2004) · Cited by 441
Incremental parsing with the perceptron algorithm
Collins, M., & Roark, B. (2004) · Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04 · doi:10.3115/1218955.1218970 · Cited by 373
Extracting relations with integrated information using kernel methods
Zhao, S., & Grishman, R. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219892 · Cited by 313
Exploiting Syntactico-Semantic Structures for Relation Extraction
Chan, Y. S., & Roth, D. (2011) · Cited by 223
Joint Inference for Fine-grained Opinion Extraction
Yang, B., & Cardie, C. (2013) · Cited by 222
Dynamic Programming for Linear-Time Incremental Parsing
Huang, L., & Sagae, K. (2010) · Cited by 208
Tree Kernel-Based Relation Extraction with Context-Sensitive Structured Parse Tree Information
Zhou, G., Zhang, M., Ji, D., & Zhu, Q. (2007) · Cited by 189
A Statistical Model for Multilingual Entity Detection and Tracking
Florian, R., Hassan, H., Ittycheriah, A., Jing, H., Kambhatla, N., Luo, X., Nicolov, H., & Roukos, S. (2004) · doi:10.21236/ada460245 · Cited by 180
A Systematic Exploration of the Feature Space for Relation Extraction
Jiang, J., & Zhai, C. (2007) · Cited by 168
Structured Perceptron with Inexact Search
Huang, L., Fayong, S., & Guo, Y. (2012) · Cited by 151
Embedding Semantic Similarity in Tree Kernels for Domain Adaptation of Relation Extraction
Plank, B., & Moschitti, A. (2013) · Cited by 122
Kambhatla, N. (2004) · Cited by 116
Yu, X., & Lam, W. P. (2010) · Cited by 110
Semi-supervised Relation Extraction with Large-scale Word Clustering
Sun, A., Grishman, R., & Sekine, S. (2011) · Cited by 107
Joint inference of entities, relations, and coreference
Singh, S., Riedel, S., Martin, B., Zheng, J., & McCallum, A. (2013) · Automated Knowledge Base Construction · doi:10.1145/2509558.2509559 · Cited by 104
Exploiting Background Knowledge for Relation Extraction
Chan, Y. S., & Roth, D. (2010) · Cited by 88
Joint Entity and Relation Extraction Using Card-Pyramid Parsing
Kate, R. J., & Mooney, R. J. (2010) · Cited by 82
Open-domain Anatomical Entity Mention Detection
Ohta, T., Pyysalo, S., Tsujii, J., & Ananiadou, S. (2012) · Cited by 56
Mention detection crossing the language barrier
Zitouni, I., & Florian, R. (2008) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/1613715.1613789 · Cited by 53
Florian, R., Jing, H., Kambhatla, N., & Zitouni, I. (2006) · International Conference on Computational Linguistics · doi:10.3115/1220175.1220235 · Cited by 38
Improving Mention Detection Robustness to Noisy Input
Florian, R., Pitrelli, J. F., Roukos, S., & Zitouni, I. (2010) · Cited by 29
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
Joint Extraction of Entities and Relations Based on a Novel Tagging Scheme
Zheng, S., Wang, F., Bao, H., Hao, Y., Zhou, P., & Xu, B. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1113 · Cited by 787
A Novel Cascade Binary Tagging Framework for Relational Triple Extraction
Wei, Z., Su, J., Wang, Y., Tian, Y., & Chang, Y. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.136 · Cited by 649
Entity, Relation, and Event Extraction with Contextualized Span Representations
Wadden, D., Wennberg, U., Luan, Y., & Hajishirzi, H. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1585 · Cited by 564
A Frustratingly Easy Approach for Entity and Relation Extraction
Zhong, Z., & Chen, D. (2020) · arXiv · doi:10.48550/arxiv.2010.12812 · Cited by 531
Metadata
- Authors
- Li, Q., & Ji, H.
- Venue
- Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
- Published
- 2014
- Pages
- 402-412
- OpenAlex
- W2134033474
- Cited by
- 535
- References
- 30
- FWCI
- 15.22
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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.