{"url":"/sota/relation-extraction-on-ace-2005","task":{"name":"Relation Extraction","url":"/task/relation-extraction","note":null},"dataset":{"name":"ACE 2005","url":"/dataset/ace-2005"},"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 Micro F1","RE+ Micro F1","NER Micro F1","Sentence Encoder","Relation classification F1","Cross Sentence","Relation 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 Micro F1":"higher","RE+ Micro F1":"higher","NER Micro F1":"higher","Sentence Encoder":null,"Relation classification F1":"higher","Cross Sentence":null,"Relation F1":"higher"}},"counts":{"rows":30,"rows_with_code":19,"rows_with_paper_page":30,"rows_dated":29,"rows_using_additional_data":4},"rows":[{"rank_in_archive_order":1,"model":"ITER","metrics":{"Cross Sentence":"Yes","NER Micro F1":"91.6 ± 0.12","RE Micro F1":"75.1 ± 0.49","RE+ Micro F1":"71.9 ± 0.56","Sentence Encoder":"FLAN T5 3B"},"uses_additional_data":false,"paper_date":"2024-11-11","paper":"/paper/iter-iterative-transformer-based-entity","paper_url":"https://aclanthology.org/2024.findings-emnlp.655/","paper_title":"ITER: Iterative Transformer-based Entity Recognition and Relation Extraction","code":"https://github.com/fleonce/iter","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"PL-Marker","metrics":{"Cross Sentence":"Yes","NER Micro F1":"91.1","RE Micro F1":"73.0","RE+ Micro F1":"71.1","Sentence Encoder":"ALBERT"},"uses_additional_data":false,"paper_date":"2021-09-13","paper":"/paper/pack-together-entity-and-relation-extraction","paper_url":"https://arxiv.org/abs/2109.06067v5","paper_title":"Packed Levitated Marker for Entity and Relation Extraction","code":"https://github.com/tomaarsen/spanmarkerner","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":6,"n_samples":9,"n_pointer_only_licence":1}},{"rank_in_archive_order":3,"model":"ASP+T5-3B","metrics":{"Cross Sentence":"Yes","NER Micro F1":"91.3","RE Micro F1":"72.7","RE+ Micro F1":"70.5","Sentence Encoder":"T5-3B"},"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":4,"model":"GoLLIE","metrics":{"RE Micro F1":"70.1"},"uses_additional_data":true,"paper_date":"2023-10-05","paper":"/paper/gollie-annotation-guidelines-improve-zero","paper_url":"https://arxiv.org/abs/2310.03668v5","paper_title":"GoLLIE: Annotation Guidelines improve Zero-Shot Information-Extraction","code":"https://github.com/hitz-zentroa/gollie","n_code_links":1,"syntology":{"n_ran":18,"n_unverified":7,"n_samples":25,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"Ours: cross-sentence ALB","metrics":{"Cross Sentence":"Yes","NER Micro F1":"90.9","RE Micro F1":"69.4","Sentence Encoder":"ALBERT"},"uses_additional_data":false,"paper_date":"2020-10-24","paper":"/paper/a-frustratingly-easy-approach-for-joint","paper_url":"https://arxiv.org/abs/2010.12812v2","paper_title":"A Frustratingly Easy Approach for Entity and Relation Extraction","code":"https://github.com/princeton-nlp/PURE","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":1}},{"rank_in_archive_order":6,"model":"Table-Sequence","metrics":{"Cross Sentence":"No","NER Micro F1":"89.5","RE Micro F1":"67.6","RE+ Micro F1":"64.3","Sentence Encoder":"ALBERT"},"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":7,"model":"TriMF","metrics":{"Cross Sentence":"Yes","NER Micro F1":"87.61","RE Micro F1":"66.49","RE+ Micro F1":"62.77","Sentence Encoder":"BERT base"},"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":8,"model":"TablERT","metrics":{"Cross Sentence":"No","NER Micro F1":"88.0","RE Micro F1":"66.1","RE+ Micro F1":"62.4","Sentence Encoder":"BERT base"},"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":9,"model":"DYGIE++","metrics":{"Cross Sentence":"Yes","NER Micro F1":"88.6","RE Micro F1":"63.4","Sentence Encoder":"BERT base"},"uses_additional_data":true,"paper_date":"2019-09-08","paper":"/paper/entity-relation-and-event-extraction-with","paper_url":"https://arxiv.org/abs/1909.03546v2","paper_title":"Entity, Relation, and Event Extraction with Contextualized Span Representations","code":"https://github.com/dwadden/dygiepp","n_code_links":4,"syntology":{"n_ran":0,"n_unverified":7,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"DyGIE","metrics":{"Cross Sentence":"Yes","NER Micro F1":"88.4","RE Micro F1":"63.2","Sentence Encoder":"ELMo"},"uses_additional_data":true,"paper_date":"2019-04-05","paper":"/paper/a-general-framework-for-information","paper_url":"http://arxiv.org/abs/1904.03296v1","paper_title":"A General Framework for Information Extraction using Dynamic Span Graphs","code":"https://github.com/luanyi/DyGIE","n_code_links":3,"syntology":null},{"rank_in_archive_order":11,"model":"Hierarchical Multi-task","metrics":{"Cross Sentence":"No","NER Micro F1":"87.5","RE Micro F1":"62.7","Sentence Encoder":"ELMo"},"uses_additional_data":true,"paper_date":"2018-11-14","paper":"/paper/a-hierarchical-multi-task-approach-for","paper_url":"http://arxiv.org/abs/1811.06031v2","paper_title":"A Hierarchical Multi-task Approach for Learning Embeddings from Semantic Tasks","code":"https://github.com/huggingface/hmtl","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"Attention","metrics":{"Cross Sentence":"No","NER Micro F1":"82.6","RE Micro F1":"55.9","RE+ Micro F1":"53.6","Sentence Encoder":"biLSTM"},"uses_additional_data":false,"paper_date":"2017-07-01","paper":"/paper/going-out-on-a-limb-joint-extraction-of","paper_url":"https://aclanthology.org/P17-1085","paper_title":"Going out on a limb: Joint Extraction of Entity Mentions and Relations without Dependency Trees","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":13,"model":"Joint w/ Global","metrics":{"Cross Sentence":"No","NER Micro F1":"80.8","RE Micro F1":"52.1","RE+ Micro F1":"49.5","Sentence Encoder":"-"},"uses_additional_data":false,"paper_date":"2014-06-01","paper":"/paper/incremental-joint-extraction-of-entity","paper_url":"https://aclanthology.org/P14-1038","paper_title":"Incremental Joint Extraction of Entity Mentions and Relations","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":14,"model":"MGE","metrics":{"Cross Sentence":"No","NER Micro F1":"89.7","RE+ Micro F1":"68.2","Sentence Encoder":"ALBERT"},"uses_additional_data":false,"paper_date":null,"paper":"/paper/a-multi-gate-encoder-for-joint-entity-and","paper_url":"https://aclanthology.org/2022.ccl-1.75","paper_title":"A Multi-Gate Encoder for Joint Entity and Relation Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":15,"model":"PFN","metrics":{"Cross Sentence":"No","NER Micro F1":"89.0","RE+ Micro F1":"66.8","Sentence Encoder":"ALBERT"},"uses_additional_data":false,"paper_date":"2021-08-27","paper":"/paper/a-partition-filter-network-for-joint-entity","paper_url":"https://arxiv.org/abs/2108.12202v8","paper_title":"A Partition Filter Network for Joint Entity and Relation Extraction","code":"https://github.com/Coopercoppers/PFN","n_code_links":1,"syntology":{"n_ran":5,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":16,"model":"MRC4ERE++","metrics":{"Cross Sentence":"No","NER Micro F1":"85.5","RE+ Micro F1":"62.1","Sentence Encoder":"BERT base"},"uses_additional_data":false,"paper_date":"2020-07-01","paper":"/paper/asking-effective-and-diverse-questions-a","paper_url":"https://www.ijcai.org/Proceedings/2020/0546.pdf","paper_title":"Asking Effective and Diverse Questions: A Machine Reading Comprehension based Framework for Joint Entity-Relation Extraction","code":"https://github.com/TanyaZhao/MRC4ERE","n_code_links":1,"syntology":null},{"rank_in_archive_order":17,"model":"Multi-turn QA","metrics":{"Cross Sentence":"No","NER Micro F1":"84.8","RE+ Micro F1":"60.2","Sentence Encoder":"BERT base"},"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":18,"model":"MRT","metrics":{"Cross Sentence":"No","NER Micro F1":"83.6","RE+ Micro F1":"59.6","Sentence Encoder":"biLSTM"},"uses_additional_data":false,"paper_date":"2018-10-01","paper":"/paper/extracting-entities-and-relations-with-joint","paper_url":"https://aclanthology.org/D18-1249","paper_title":"Extracting Entities and Relations with Joint Minimum Risk Training","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":19,"model":"GCN","metrics":{"Cross Sentence":"No","NER Micro F1":"84.2","RE+ Micro F1":"59.1","Sentence Encoder":"biLSTM"},"uses_additional_data":false,"paper_date":"2019-07-01","paper":"/paper/joint-type-inference-on-entities-and","paper_url":"https://aclanthology.org/P19-1131","paper_title":"Joint Type Inference on Entities and Relations via Graph Convolutional Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":20,"model":"Global","metrics":{"Cross Sentence":"No","NER Micro F1":"83.6","RE+ Micro F1":"57.5","Sentence Encoder":"biLSTM"},"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":21,"model":"SPTree","metrics":{"Cross Sentence":"No","NER Micro F1":"83.4","RE+ Micro F1":"55.6","Sentence Encoder":"biLSTM"},"uses_additional_data":false,"paper_date":"2016-01-05","paper":"/paper/end-to-end-relation-extraction-using-lstms-on","paper_url":"http://arxiv.org/abs/1601.00770v3","paper_title":"End-to-End Relation Extraction using LSTMs on Sequences and Tree Structures","code":"https://github.com/tticoin/LSTM-ER","n_code_links":2,"syntology":null},{"rank_in_archive_order":22,"model":"Span-level","metrics":{"Cross Sentence":"No","NER Micro F1":"85.98","Sentence Encoder":"ELMo"},"uses_additional_data":false,"paper_date":"2019-07-01","paper":"/paper/span-level-model-for-relation-extraction","paper_url":"https://aclanthology.org/P19-1525","paper_title":"Span-Level Model for Relation Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":23,"model":"Dual Pointer Network(multi-head)","metrics":{"Cross Sentence":"No","Relation classification F1":"80.8"},"uses_additional_data":false,"paper_date":"2021-03-05","paper":"/paper/dual-pointer-network-for-fast-extraction-of","paper_url":"https://arxiv.org/abs/2103.03509v1","paper_title":"Dual Pointer Network for Fast Extraction of Multiple Relations in a Sentence","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":24,"model":"Dual Pointer Network","metrics":{"Cross Sentence":"No","Relation classification F1":"80.5"},"uses_additional_data":false,"paper_date":"2019-11-01","paper":"/paper/relation-extraction-among-multiple-entities","paper_url":"https://aclanthology.org/D19-6608","paper_title":"Relation Extraction among Multiple Entities Using a Dual Pointer Network with a Multi-Head Attention Mechanism","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":25,"model":"RNN+CNN","metrics":{"Cross Sentence":"No","Relation classification F1":"67.7"},"uses_additional_data":false,"paper_date":"2015-11-18","paper":"/paper/combining-neural-networks-and-log-linear","paper_url":"http://arxiv.org/abs/1511.05926v1","paper_title":"Combining Neural Networks and Log-linear Models to Improve Relation Extraction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":26,"model":"Walk-based model","metrics":{"Cross Sentence":"No","Relation classification F1":"64.2"},"uses_additional_data":false,"paper_date":"2019-02-19","paper":"/paper/a-walk-based-model-on-entity-graphs-for","paper_url":"https://arxiv.org/abs/1902.07023v2","paper_title":"A Walk-based Model on Entity Graphs for Relation Extraction","code":"https://github.com/fenchri/walk-based-re","n_code_links":1,"syntology":null},{"rank_in_archive_order":27,"model":"CNN","metrics":{"Cross Sentence":"No","Relation classification F1":"61.3"},"uses_additional_data":false,"paper_date":"2015-06-01","paper":"/paper/relation-extraction-perspective-from","paper_url":"https://aclanthology.org/W15-1506","paper_title":"Relation Extraction: Perspective from Convolutional Neural Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":28,"model":"FCM","metrics":{"Cross Sentence":"No","Relation classification F1":"58.2"},"uses_additional_data":false,"paper_date":"2015-05-10","paper":"/paper/improved-relation-extraction-with-feature","paper_url":"http://arxiv.org/abs/1505.02419v3","paper_title":"Improved Relation Extraction with Feature-Rich Compositional Embedding Models","code":"https://github.com/mgormley/pacaya","n_code_links":1,"syntology":null},{"rank_in_archive_order":29,"model":"HySPA (ours) w/ RoBERTa","metrics":{"Relation F1":"68.2"},"uses_additional_data":false,"paper_date":"2021-06-30","paper":"/paper/hyspa-hybrid-span-generation-for-scalable","paper_url":"https://arxiv.org/abs/2106.15838v1","paper_title":"HySPA: Hybrid Span Generation for Scalable Text-to-Graph Extraction","code":"https://github.com/renll/HySPA","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":30,"model":"HySPA","metrics":{"Cross Sentence":"No","Sentence Encoder":"ALBERT"},"uses_additional_data":false,"paper_date":"2021-06-30","paper":"/paper/hyspa-hybrid-span-generation-for-scalable","paper_url":"https://arxiv.org/abs/2106.15838v1","paper_title":"HySPA: Hybrid Span Generation for Scalable Text-to-Graph Extraction","code":"https://github.com/renll/HySPA","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+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":9,"rows_with_any_sample_ran":4,"distinct_papers_with_graph_line":8,"distinct_papers_with_any_sample_ran":4,"samples_over_distinct_papers":{"n_ran":29,"n_unverified":32,"n_samples":61,"n_pointer_only_licence":5,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":29,"n_unverified":37,"n_samples":66,"n_pointer_only_licence":5,"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"}}}