{"url":"/sota/relation-extraction-on-conll04","task":{"name":"Relation Extraction","url":"/task/relation-extraction","note":null},"dataset":{"name":"CoNLL04","url":"/dataset/conll04"},"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":["RE+ Macro F1 ","RE+ Micro F1","NER Macro F1","NER Micro F1","RE+ Macro F1"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"RE+ Macro F1 ":"higher","RE+ Micro F1":"higher","NER Macro F1":"higher","NER Micro F1":"higher","RE+ Macro F1":"higher"}},"counts":{"rows":16,"rows_with_code":13,"rows_with_paper_page":16,"rows_dated":16,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"REBEL","metrics":{"RE+ Macro F1 ":"76.65","RE+ Micro F1":"75.4"},"uses_additional_data":true,"paper_date":"2021-10-29","paper":"/paper/rebel-relation-extraction-by-end-to-end","paper_url":"https://github.com/Babelscape/rebel","paper_title":"REBEL: Relation Extraction By End-to-end Language generation","code":"https://github.com/Babelscape/rebel","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"Table-Sequence","metrics":{"NER Macro F1":"86.9","NER Micro F1":"90.1","RE+ Macro F1 ":"75.4","RE+ Micro F1":"73.6"},"uses_additional_data":false,"paper_date":"2020-10-08","paper":"/paper/two-are-better-than-one-joint-entity-and","paper_url":"https://arxiv.org/abs/2010.03851v1","paper_title":"Two are Better than One: Joint Entity and Relation Extraction with Table-Sequence Encoders","code":"https://github.com/LorrinWWW/two-are-better-than-one","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":3,"model":"SpERT","metrics":{"NER Macro F1":"86.25","NER Micro F1":"88.94","RE+ Macro F1 ":"72.87","RE+ Micro F1":"71.47"},"uses_additional_data":false,"paper_date":"2019-09-17","paper":"/paper/span-based-joint-entity-and-relation","paper_url":"https://arxiv.org/abs/1909.07755v4","paper_title":"Span-based Joint Entity and Relation Extraction with Transformer Pre-training","code":"https://github.com/markus-eberts/spert","n_code_links":3,"syntology":null},{"rank_in_archive_order":4,"model":"Deeper","metrics":{"NER Macro F1":"87","NER Micro F1":"89.78","RE+ Macro F1 ":"72.63","RE+ Micro F1":"71.08"},"uses_additional_data":false,"paper_date":"2020-02-15","paper":"/paper/deeper-task-specificity-improves-joint-entity","paper_url":"https://arxiv.org/abs/2002.06424v1","paper_title":"Deeper Task-Specificity Improves Joint Entity and Relation Extraction","code":"https://github.com/vedantc6/mtl-dts","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"Biaffine attention","metrics":{"NER Macro F1":"86.2","RE+ Macro F1 ":"64.4"},"uses_additional_data":false,"paper_date":"2018-12-29","paper":"/paper/end-to-end-neural-relation-extraction-using","paper_url":"http://arxiv.org/abs/1812.11275v1","paper_title":"End-to-end neural relation extraction using deep biaffine attention","code":"https://github.com/datquocnguyen/jointRE","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"Relation-Metric with AT","metrics":{"NER Macro F1":"84.15","RE+ Macro F1 ":"62.29"},"uses_additional_data":false,"paper_date":"2019-05-17","paper":"/paper/neural-metric-learning-for-fast-end-to-end","paper_url":"https://arxiv.org/abs/1905.07458v4","paper_title":"Neural Metric Learning for Fast End-to-End Relation Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":7,"model":"multi-head","metrics":{"NER Macro F1":"83.9","RE+ Macro F1 ":"62.04"},"uses_additional_data":false,"paper_date":"2018-04-20","paper":"/paper/joint-entity-recognition-and-relation","paper_url":"http://arxiv.org/abs/1804.07847v3","paper_title":"Joint entity recognition and relation extraction as a multi-head selection problem","code":"https://github.com/bekou/multihead_joint_entity_relation_extraction","n_code_links":6,"syntology":null},{"rank_in_archive_order":8,"model":"multi-head + AT","metrics":{"NER Macro F1":"83.6","RE+ Macro F1 ":"61.95"},"uses_additional_data":false,"paper_date":"2018-08-21","paper":"/paper/adversarial-training-for-multi-context-joint","paper_url":"http://arxiv.org/abs/1808.06876v3","paper_title":"Adversarial training for multi-context joint entity and relation extraction","code":"https://github.com/bekou/multihead_joint_entity_relation_extraction","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"ReLiK-Large","metrics":{"RE+ Micro F1":"78.1"},"uses_additional_data":false,"paper_date":"2024-07-31","paper":"/paper/2408-00103","paper_url":"https://arxiv.org/abs/2408.00103v3","paper_title":"ReLiK: Retrieve and LinK, Fast and Accurate Entity Linking and Relation Extraction on an Academic Budget","code":"https://github.com/SapienzaNLP/relik","n_code_links":2,"syntology":null},{"rank_in_archive_order":10,"model":"ASP+T0-3B","metrics":{"NER Micro F1":"90.3","RE+ Micro F1":"76.3"},"uses_additional_data":false,"paper_date":"2022-10-26","paper":"/paper/autoregressive-structured-prediction-with","paper_url":"https://arxiv.org/abs/2210.14698v2","paper_title":"Autoregressive Structured Prediction with Language Models","code":"https://github.com/lyutyuh/asp","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"TablERT","metrics":{"NER Micro F1":"90.2","RE+ Micro F1":"72.6"},"uses_additional_data":false,"paper_date":"2020-10-15","paper":"/paper/named-entity-recognition-and-relation","paper_url":"https://arxiv.org/abs/2010.07522v2","paper_title":"Named Entity Recognition and Relation Extraction using Enhanced Table Filling by Contextualized Representations","code":"https://github.com/YoumiMa/TablERT","n_code_links":1,"syntology":null},{"rank_in_archive_order":12,"model":"TANL","metrics":{"RE+ Micro F1":"72.6"},"uses_additional_data":false,"paper_date":"2021-01-14","paper":"/paper/structured-prediction-as-translation-between-1","paper_url":"https://arxiv.org/abs/2101.05779v3","paper_title":"Structured Prediction as Translation between Augmented Natural Languages","code":"https://github.com/amazon-science/tanl","n_code_links":2,"syntology":null},{"rank_in_archive_order":13,"model":"TriMF","metrics":{"NER Micro F1":"90.3","RE+ Micro F1":"72.35"},"uses_additional_data":false,"paper_date":"2021-01-25","paper":"/paper/a-trigger-sense-memory-flow-framework-for","paper_url":"https://arxiv.org/abs/2101.10213v3","paper_title":"A Trigger-Sense Memory Flow Framework for Joint Entity and Relation Extraction","code":"https://github.com/tricktreat/trimf","n_code_links":1,"syntology":null},{"rank_in_archive_order":14,"model":"Multi-turn QA","metrics":{"NER Micro F1":"87.8","RE+ Micro F1":"68.9"},"uses_additional_data":false,"paper_date":"2019-05-14","paper":"/paper/entity-relation-extraction-as-multi-turn","paper_url":"https://arxiv.org/abs/1905.05529v4","paper_title":"Entity-Relation Extraction as Multi-Turn Question Answering","code":"https://github.com/ShannonAI/Entity-Relation-As-Multi-Turn-QA","n_code_links":1,"syntology":null},{"rank_in_archive_order":15,"model":"Global","metrics":{"NER Micro F1":"85.6","RE+ Micro F1":"67.8"},"uses_additional_data":false,"paper_date":"2017-09-01","paper":"/paper/end-to-end-neural-relation-extraction-with","paper_url":"https://aclanthology.org/D17-1182","paper_title":"End-to-End Neural Relation Extraction with Global Optimization","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":16,"model":"Table Representation","metrics":{"NER Micro F1":"80.7","RE+ Micro F1":"61"},"uses_additional_data":false,"paper_date":"2014-10-01","paper":"/paper/modeling-joint-entity-and-relation-extraction","paper_url":"https://aclanthology.org/D14-1200","paper_title":"Modeling Joint Entity and Relation Extraction with Table Representation","code":null,"n_code_links":0,"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":1,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":1,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":3,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":3,"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"}}}