{"url":"/sota/relation-extraction-on-semeval-2010-task-8","task":{"name":"Relation Extraction","url":"/task/relation-extraction","note":null},"dataset":{"name":"SemEval-2010 Task-8","url":"/dataset/semeval-2010-task-8"},"category":"Natural Language Processing","categories":["Natural Language Processing"],"category_note":null,"description":"**Relation Extraction** is the task of predicting attributes and relations for entities in a sentence. For example, given a sentence “Barack Obama was born in Honolulu, Hawaii.”, a relation classifier aims at predicting the relation of “bornInCity”. Relation Extraction is the key component for building relation knowledge graphs, and it is of crucial significance to natural language processing applications such as structured search, sentiment analysis, question answering, and summarization.\r\n\r\n\r\n<span class=\"description-source\">Source: [Deep Residual Learning for Weakly-Supervised Relation Extraction ](https://arxiv.org/abs/1707.08866)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["F1"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"F1":"higher"}},"counts":{"rows":31,"rows_with_code":19,"rows_with_paper_page":31,"rows_dated":30,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"SP","metrics":{"F1":"91.9"},"uses_additional_data":false,"paper_date":"2020-10-09","paper":"/paper/relation-extraction-as-two-way-span","paper_url":"https://arxiv.org/abs/2010.04829v2","paper_title":"Relation Classification as Two-way Span-Prediction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"RIFRE","metrics":{"F1":"91.3"},"uses_additional_data":false,"paper_date":"2021-05-08","paper":"/paper/representation-iterative-fusion-based-on","paper_url":"https://www.sciencedirect.com/science/article/pii/S0950705121001519","paper_title":"Representation Iterative Fusion based on Heterogeneous Graph Neural Network for Joint Entity and Relation Extraction","code":"https://github.com/zhao9797/RIFRE","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"REDN","metrics":{"F1":"91"},"uses_additional_data":false,"paper_date":"2020-04-08","paper":"/paper/downstream-model-design-of-pre-trained","paper_url":"https://arxiv.org/abs/2004.03786v1","paper_title":"Downstream Model Design of Pre-trained Language Model for Relation Extraction Task","code":"https://github.com/slczgwh/REDN","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"SPOT","metrics":{"F1":"90.6"},"uses_additional_data":false,"paper_date":"2022-08-20","paper":"/paper/representing-knowledge-by-spans-a-knowledge","paper_url":"https://arxiv.org/abs/2208.09625v2","paper_title":"SPOT: Knowledge-Enhanced Language Representations for Information Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":5,"model":"KLG","metrics":{"F1":"90.5"},"uses_additional_data":false,"paper_date":"2022-12-29","paper":"/paper/reviewing-labels-label-graph-network-with-top","paper_url":"https://arxiv.org/abs/2212.14270v1","paper_title":"Reviewing Labels: Label Graph Network with Top-k Prediction Set for Relation Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":6,"model":"RELA","metrics":{"F1":"90.4"},"uses_additional_data":false,"paper_date":"2022-12-29","paper":"/paper/sequence-generation-with-label-augmentation","paper_url":"https://arxiv.org/abs/2212.14266v2","paper_title":"Sequence Generation with Label Augmentation for Relation Extraction","code":"https://github.com/pkuserc/rela","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"Skeleton-Aware BERT","metrics":{"F1":"90.36"},"uses_additional_data":false,"paper_date":"2019-12-04","paper":"/paper/enhancing-relation-extraction-using-syntactic","paper_url":"https://arxiv.org/abs/1912.01858v1","paper_title":"Enhancing Relation Extraction Using Syntactic Indicators and Sentential Contexts","code":"https://github.com/taoqiongxing/Enhancing-Relation-Extraction-using-Syntactic-Indicators-and-Sentential-Contexts","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"KnowPrompt","metrics":{"F1":"90.3"},"uses_additional_data":false,"paper_date":"2021-04-15","paper":"/paper/adaprompt-adaptive-prompt-based-finetuning","paper_url":"https://arxiv.org/abs/2104.07650v7","paper_title":"KnowPrompt: Knowledge-aware Prompt-tuning with Synergistic Optimization for Relation Extraction","code":"https://github.com/zjunlp/KnowPrompt","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"LUKE","metrics":{"F1":"90.3"},"uses_additional_data":false,"paper_date":"2022-08-20","paper":"/paper/representing-knowledge-by-spans-a-knowledge","paper_url":"https://arxiv.org/abs/2208.09625v2","paper_title":"SPOT: Knowledge-Enhanced Language Representations for Information Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":10,"model":"EPGNN","metrics":{"F1":"90.2"},"uses_additional_data":false,"paper_date":"2019-11-17","paper":"/paper/improving-relation-classification-by-entity","paper_url":"http://proceedings.mlr.press/v101/zhao19a.html","paper_title":"Improving Relation Classification by Entity Pair Graph","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":11,"model":"RE-DMP + XLNet","metrics":{"F1":"89.90"},"uses_additional_data":false,"paper_date":null,"paper":"/paper/improving-relation-extraction-through-syntax","paper_url":"https://aclanthology.org/2022.findings-acl.147","paper_title":"Improving Relation Extraction through Syntax-induced Pre-training with Dependency Masking","code":"https://github.com/synlp/RE-DMP","n_code_links":1,"syntology":null},{"rank_in_archive_order":12,"model":"A-GCN + BERT","metrics":{"F1":"89.85"},"uses_additional_data":false,"paper_date":"2021-08-01","paper":"/paper/dependency-driven-relation-extraction-with","paper_url":"https://aclanthology.org/2021.acl-long.344","paper_title":"Dependency-driven Relation Extraction with Attentive Graph Convolutional Networks","code":"https://github.com/cuhksz-nlp/re-agcn","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"BERTEM+MTB","metrics":{"F1":"89.5"},"uses_additional_data":false,"paper_date":"2019-06-07","paper":"/paper/matching-the-blanks-distributional-similarity","paper_url":"https://arxiv.org/abs/1906.03158v1","paper_title":"Matching the Blanks: Distributional Similarity for Relation Learning","code":"https://github.com/plkmo/BERT-Relation-Extraction","n_code_links":13,"syntology":{"n_ran":9,"n_unverified":5,"n_samples":14,"n_pointer_only_licence":1}},{"rank_in_archive_order":14,"model":"BERT","metrics":{"F1":"89.4"},"uses_additional_data":false,"paper_date":"2022-08-20","paper":"/paper/representing-knowledge-by-spans-a-knowledge","paper_url":"https://arxiv.org/abs/2208.09625v2","paper_title":"SPOT: Knowledge-Enhanced Language Representations for Information Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":15,"model":"R-BERT","metrics":{"F1":"89.25"},"uses_additional_data":false,"paper_date":"2019-05-20","paper":"/paper/enriching-pre-trained-language-model-with","paper_url":"https://arxiv.org/abs/1905.08284v1","paper_title":"Enriching Pre-trained Language Model with Entity Information for Relation Classification","code":"https://github.com/monologg/R-BERT","n_code_links":6,"syntology":{"n_ran":6,"n_unverified":2,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":16,"model":"CorefBERT","metrics":{"F1":"89.2"},"uses_additional_data":false,"paper_date":"2022-08-20","paper":"/paper/representing-knowledge-by-spans-a-knowledge","paper_url":"https://arxiv.org/abs/2208.09625v2","paper_title":"SPOT: Knowledge-Enhanced Language Representations for Information Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":17,"model":"KnowBert-W+W","metrics":{"F1":"89.1"},"uses_additional_data":false,"paper_date":"2019-09-09","paper":"/paper/knowledge-enhanced-contextual-word","paper_url":"https://arxiv.org/abs/1909.04164v2","paper_title":"Knowledge Enhanced Contextual Word Representations","code":"https://github.com/allenai/kb","n_code_links":1,"syntology":null},{"rank_in_archive_order":18,"model":"KnowBERT","metrics":{"F1":"89.1"},"uses_additional_data":false,"paper_date":"2022-08-20","paper":"/paper/representing-knowledge-by-spans-a-knowledge","paper_url":"https://arxiv.org/abs/2208.09625v2","paper_title":"SPOT: Knowledge-Enhanced Language Representations for Information Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":19,"model":"Entity-Aware BERT","metrics":{"F1":"89.0"},"uses_additional_data":false,"paper_date":"2019-02-04","paper":"/paper/extracting-multiple-relations-in-one-pass","paper_url":"https://arxiv.org/abs/1902.01030v2","paper_title":"Extracting Multiple-Relations in One-Pass with Pre-Trained Transformers","code":"https://github.com/helloeve/mre-in-one-pass","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":3,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":20,"model":"SpanBERT","metrics":{"F1":"88.8"},"uses_additional_data":false,"paper_date":"2022-08-20","paper":"/paper/representing-knowledge-by-spans-a-knowledge","paper_url":"https://arxiv.org/abs/2208.09625v2","paper_title":"SPOT: Knowledge-Enhanced Language Representations for Information Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":21,"model":"RoBERTa","metrics":{"F1":"88.7"},"uses_additional_data":false,"paper_date":"2022-08-20","paper":"/paper/representing-knowledge-by-spans-a-knowledge","paper_url":"https://arxiv.org/abs/2208.09625v2","paper_title":"SPOT: Knowledge-Enhanced Language Representations for Information Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":22,"model":"Att-Pooling-CNN","metrics":{"F1":"88.0"},"uses_additional_data":false,"paper_date":"2016-08-01","paper":"/paper/relation-classification-via-multi-level","paper_url":"https://aclanthology.org/P16-1123","paper_title":"Relation Classification via Multi-Level Attention CNNs","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":23,"model":"SpanRel","metrics":{"F1":"87.4"},"uses_additional_data":false,"paper_date":"2019-11-10","paper":"/paper/generalizing-natural-language-analysis-1","paper_url":"https://arxiv.org/abs/1911.03822v2","paper_title":"Generalizing Natural Language Analysis through Span-relation Representations","code":"https://github.com/jzbjyb/SpanRel","n_code_links":3,"syntology":null},{"rank_in_archive_order":24,"model":"TRE","metrics":{"F1":"87.1"},"uses_additional_data":false,"paper_date":"2019-06-07","paper":"/paper/improving-relation-extraction-by-pre-trained-1","paper_url":"https://arxiv.org/abs/1906.03088v1","paper_title":"Improving Relation Extraction by Pre-trained Language Representations","code":"https://github.com/DFKI-NLP/TRE","n_code_links":1,"syntology":null},{"rank_in_archive_order":25,"model":"Entity Attention Bi-LSTM","metrics":{"F1":"85.2"},"uses_additional_data":false,"paper_date":"2019-01-23","paper":"/paper/semantic-relation-classification-via-1","paper_url":"http://arxiv.org/abs/1901.08163v1","paper_title":"Semantic Relation Classification via Bidirectional LSTM Networks with Entity-aware Attention using Latent Entity Typing","code":"https://github.com/roomylee/entity-aware-relation-classification","n_code_links":3,"syntology":null},{"rank_in_archive_order":26,"model":"Attention CNN","metrics":{"F1":"84.3"},"uses_additional_data":false,"paper_date":"2016-12-01","paper":"/paper/attention-based-convolutional-neural-network-2","paper_url":"https://aclanthology.org/C16-1238","paper_title":"Attention-Based Convolutional Neural Network for Semantic Relation Extraction","code":"https://github.com/onehaitao/Attention-CNN-relation-extraction","n_code_links":1,"syntology":null},{"rank_in_archive_order":27,"model":"CR-CNN","metrics":{"F1":"84.1"},"uses_additional_data":false,"paper_date":"2015-04-24","paper":"/paper/classifying-relations-by-ranking-with","paper_url":"http://arxiv.org/abs/1504.06580v2","paper_title":"Classifying Relations by Ranking with Convolutional Neural Networks","code":"https://github.com/onehaitao/CR-CNN-relation-extraction","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":28,"model":"Attention Bi-LSTM","metrics":{"F1":"84.0"},"uses_additional_data":false,"paper_date":"2016-08-01","paper":"/paper/attention-based-bidirectional-long-short-term","paper_url":"https://aclanthology.org/P16-2034","paper_title":"Attention-Based Bidirectional Long Short-Term Memory Networks for Relation Classification","code":"https://github.com/onehaitao/Att-BLSTM-relation-extraction","n_code_links":1,"syntology":null},{"rank_in_archive_order":29,"model":"CNN","metrics":{"F1":"82.7"},"uses_additional_data":false,"paper_date":"2014-08-01","paper":"/paper/relation-classification-via-convolutional","paper_url":"https://aclanthology.org/C14-1220","paper_title":"Relation Classification via Convolutional Deep Neural Network","code":"https://github.com/onehaitao/CNN-relation-extraction","n_code_links":2,"syntology":null},{"rank_in_archive_order":30,"model":"Bi-LSTM","metrics":{"F1":"82.7"},"uses_additional_data":false,"paper_date":"2015-10-01","paper":"/paper/bidirectional-long-short-term-memory-networks","paper_url":"https://aclanthology.org/Y15-1009","paper_title":"Bidirectional Long Short-Term Memory Networks for Relation Classification","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":31,"model":"TRE","metrics":{"F1":"87:1"},"uses_additional_data":false,"paper_date":"2019-06-07","paper":"/paper/improving-relation-extraction-by-pre-trained-1","paper_url":"https://arxiv.org/abs/1906.03088v1","paper_title":"Improving Relation Extraction by Pre-trained Language Representations","code":"https://github.com/DFKI-NLP/TRE","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":4,"rows_with_any_sample_ran":4,"distinct_papers_with_graph_line":4,"distinct_papers_with_any_sample_ran":4,"samples_over_distinct_papers":{"n_ran":19,"n_unverified":10,"n_samples":29,"n_pointer_only_licence":1,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":19,"n_unverified":10,"n_samples":29,"n_pointer_only_licence":1,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}