{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/dataset/ace-2005","name":"ACE 2005","full_name":"ACE 2005 Multilingual Training Corpus","description_markdown":"**ACE 2005** Multilingual Training Corpus contains the complete set of English, Arabic and Chinese training data for the 2005 Automatic Content Extraction (ACE) technology evaluation. The corpus consists of data of various types annotated for entities, relations and events by the Linguistic Data Consortium (LDC) with support from the ACE Program and additional assistance from LDC.\n\nSource: [https://catalog.ldc.upenn.edu/LDC2006T06](https://catalog.ldc.upenn.edu/LDC2006T06)\nImage Source: [https://arxiv.org/pdf/1811.06031.pdf](https://arxiv.org/pdf/1811.06031.pdf)","description_withheld":null,"homepage":"https://catalog.ldc.upenn.edu/LDC2006T06","introduced_date":null,"introduced_date_note":null,"introduced_by":null,"license":null,"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Named Entity Recognition (NER)","url":"/task/named-entity-recognition-ner","datasets_with_task":"/datasets/task/named-entity-recognition-ner"},{"name":"Relation Extraction","url":"/task/relation-extraction","datasets_with_task":"/datasets/task/relation-extraction"},{"name":"Joint Entity and Relation Extraction","url":"/task/joint-entity-and-relation-extraction","datasets_with_task":"/datasets/task/joint-entity-and-relation-extraction"},{"name":"Event Extraction","url":"/task/event-extraction","datasets_with_task":"/datasets/task/event-extraction"},{"name":"Nested Named Entity Recognition","url":"/task/nested-named-entity-recognition","datasets_with_task":"/datasets/task/nested-named-entity-recognition"},{"name":"Nested Mention Recognition","url":"/task/nested-mention-recognition","datasets_with_task":"/datasets/task/nested-mention-recognition"},{"name":"Event Argument Extraction","url":"/task/event-argument-extraction","datasets_with_task":"/datasets/task/event-argument-extraction"}],"languages":[{"name":"English","url":"/datasets/language/english"},{"name":"Mandarin Chinese","url":"/datasets/language/mandarin-chinese"},{"name":"Standard Arabic","url":"/datasets/language/standard-arabic"}],"variants":["ACE 2005","ACE2005"],"data_loaders":[],"num_papers_in_archive":65,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/relation-extraction-on-ace-2005","task":"Relation Extraction","dataset_variant":"ACE 2005","rows":30,"metrics":["RE Micro F1","RE+ Micro F1","NER Micro F1","Sentence Encoder","Relation classification F1","Cross Sentence","Relation F1"],"first_row_in_archive_order":{"model":"ITER","paper":"/paper/iter-iterative-transformer-based-entity","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"},"code_links":[{"title":"fleonce/iter","url":"https://github.com/fleonce/iter"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/nested-named-entity-recognition-on-ace-2005","task":"Nested Named Entity Recognition","dataset_variant":"ACE 2005","rows":25,"metrics":["F1"],"first_row_in_archive_order":{"model":"BINDER","paper":"/paper/optimizing-bi-encoder-for-named-entity","metrics":{"F1":"89.5"},"code_links":[{"title":"microsoft/binder","url":"https://github.com/microsoft/binder"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/named-entity-recognition-on-ace-2005","task":"Named Entity Recognition (NER)","dataset_variant":"ACE 2005","rows":20,"metrics":["F1"],"first_row_in_archive_order":{"model":"Ours: cross-sentence ALB","paper":"/paper/a-frustratingly-easy-approach-for-joint","metrics":{"F1":"90.9"},"code_links":[{"title":"princeton-nlp/PURE","url":"https://github.com/princeton-nlp/PURE"},{"title":"YaoXinZhi/BERT-for-BioNLP-OST2019-AGAC-Task2","url":"https://github.com/YaoXinZhi/BERT-for-BioNLP-OST2019-AGAC-Task2"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/nested-mention-recognition-on-ace-2005","task":"Nested Mention Recognition","dataset_variant":"ACE 2005","rows":10,"metrics":["F1"],"first_row_in_archive_order":{"model":"BoningKnife","paper":"/paper/boningknife-joint-entity-mention-detection","metrics":{"F1":"85.46"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/event-extraction-on-ace2005","task":"Event Extraction","dataset_variant":"ACE2005","rows":4,"metrics":["Argument Cl","Argument Id","Trigger Cl","Trigger Id"],"first_row_in_archive_order":{"model":"DeepStruct multi-task","paper":"/paper/deepstruct-pretraining-of-language-models-for-1","metrics":{"Argument Cl":"63.9","Argument Id":"67.5","Trigger Cl":"69.2","Trigger Id":"72.7"},"code_links":[{"title":"cgraywang/deepstruct","url":"https://github.com/cgraywang/deepstruct"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/joint-entity-and-relation-extraction-on-7","task":"Joint Entity and Relation Extraction","dataset_variant":"ACE2005","rows":3,"metrics":["Entity F1","Relation F1"],"first_row_in_archive_order":{"model":"DeepStruct multi-task","paper":"/paper/deepstruct-pretraining-of-language-models-for-1","metrics":{"Entity F1":"90.2","Relation F1":"58.9"},"code_links":[{"title":"cgraywang/deepstruct","url":"https://github.com/cgraywang/deepstruct"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/named-entity-recognition-on-ace2005","task":"Named Entity Recognition (NER)","dataset_variant":"ACE2005","rows":2,"metrics":["F1"],"first_row_in_archive_order":{"model":"DeepStruct multi-task w/ finetune","paper":"/paper/deepstruct-pretraining-of-language-models-for-1","metrics":{"F1":"86.9"},"code_links":[{"title":"cgraywang/deepstruct","url":"https://github.com/cgraywang/deepstruct"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/joint-entity-and-relation-extraction-on-ace","task":"Joint Entity and Relation Extraction","dataset_variant":"ACE 2005","rows":1,"metrics":["Relation F1"],"first_row_in_archive_order":{"model":"Ours: cross-sentence ALB","paper":"/paper/a-frustratingly-easy-approach-for-joint","metrics":{"Relation F1":"62.2"},"code_links":[{"title":"princeton-nlp/PURE","url":"https://github.com/princeton-nlp/PURE"},{"title":"YaoXinZhi/BERT-for-BioNLP-OST2019-AGAC-Task2","url":"https://github.com/YaoXinZhi/BERT-for-BioNLP-OST2019-AGAC-Task2"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":58,"of":58,"counts":{"papers_with_a_benchmark_row":58,"with_a_code_link":46,"where_syntology_ran_a_sample":14,"not_listed_spam_title":0,"listed":58,"listed_where_code_ran":14,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/iter-iterative-transformer-based-entity","slug":"iter-iterative-transformer-based-entity","title":"ITER: Iterative Transformer-based Entity Recognition and Relation Extraction","date":"2024-11-11","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/to-be-continuous-or-to-be-discrete-those-are","slug":"to-be-continuous-or-to-be-discrete-those-are","title":"To be Continuous, or to be Discrete, Those are Bits of Questions","date":"2024-06-12","arxiv_id":"2406.07812","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gollie-annotation-guidelines-improve-zero","slug":"gollie-annotation-guidelines-improve-zero","title":"GoLLIE: Annotation Guidelines improve Zero-Shot Information-Extraction","date":"2023-10-05","arxiv_id":"2310.03668","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":25,"samples_ran":18,"samples_constructed":2,"samples_ran_checked":17,"samples_ran_instrument_failed":1,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["hitz-zentroa/gollie"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":2,"n_ran_no_instrument_failure":17,"n_unverified":7,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/gollie-annotation-guidelines-improve-zero#ran","syntology_url":"https://syntology.ai/paper/2310.03668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.03668"}}}},{"paper":"/paper/universalner-targeted-distillation-from-large","slug":"universalner-targeted-distillation-from-large","title":"UniversalNER: Targeted Distillation from Large Language Models for Open Named Entity Recognition","date":"2023-08-07","arxiv_id":"2308.03279","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":4,"samples_unverified":4,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/universalner-targeted-distillation-from-large#ran","syntology_url":"https://syntology.ai/paper/2308.03279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03279"}}}},{"paper":"/paper/promptner-prompt-locating-and-typing-for","slug":"promptner-prompt-locating-and-typing-for","title":"PromptNER: Prompt Locating and Typing for Named Entity Recognition","date":"2023-05-26","arxiv_id":"2305.17104","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/diffusionner-boundary-diffusion-for-named","slug":"diffusionner-boundary-diffusion-for-named","title":"DiffusionNER: Boundary Diffusion for Named Entity Recognition","date":"2023-05-22","arxiv_id":"2305.13298","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/autoregressive-structured-prediction-with","slug":"autoregressive-structured-prediction-with","title":"Autoregressive Structured Prediction with Language Models","date":"2022-10-26","arxiv_id":"2210.14698","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-multi-gate-encoder-for-joint-entity-and","slug":"a-multi-gate-encoder-for-joint-entity-and","title":"A Multi-Gate Encoder for Joint Entity and Relation Extraction","date":"2022-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/optimizing-bi-encoder-for-named-entity","slug":"optimizing-bi-encoder-for-named-entity","title":"Optimizing Bi-Encoder for Named Entity Recognition via Contrastive Learning","date":"2022-08-30","arxiv_id":"2208.14565","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["microsoft/binder"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optimizing-bi-encoder-for-named-entity#ran","syntology_url":"https://syntology.ai/paper/2208.14565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.14565"}}}},{"paper":"/paper/an-embarrassingly-easy-but-strong-baseline","slug":"an-embarrassingly-easy-but-strong-baseline","title":"An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition","date":"2022-08-09","arxiv_id":"2208.04534","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deepstruct-pretraining-of-language-models-for-1","slug":"deepstruct-pretraining-of-language-models-for-1","title":"DeepStruct: Pretraining of Language Models for Structure Prediction","date":"2022-05-21","arxiv_id":"2205.10475","rows_on_this_dataset":7,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["cgraywang/deepstruct"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepstruct-pretraining-of-language-models-for-1#ran","syntology_url":"https://syntology.ai/paper/2205.10475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10475"}}}},{"paper":"/paper/boundary-smoothing-for-named-entity-1","slug":"boundary-smoothing-for-named-entity-1","title":"Boundary Smoothing for Named Entity Recognition","date":"2022-04-26","arxiv_id":"2204.12031","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/parallel-instance-query-network-for-named","slug":"parallel-instance-query-network-for-named","title":"Parallel Instance Query Network for Named Entity Recognition","date":"2022-03-20","arxiv_id":"2203.10545","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/unified-named-entity-recognition-as-word-word","slug":"unified-named-entity-recognition-as-word-word","title":"Unified Named Entity Recognition as Word-Word Relation Classification","date":"2021-12-19","arxiv_id":"2112.10070","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fusing-heterogeneous-factors-with-triaffine","slug":"fusing-heterogeneous-factors-with-triaffine","title":"Fusing Heterogeneous Factors with Triaffine Mechanism for Nested Named Entity Recognition","date":"2021-10-14","arxiv_id":"2110.07480","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/pack-together-entity-and-relation-extraction","slug":"pack-together-entity-and-relation-extraction","title":"Packed Levitated Marker for Entity and Relation Extraction","date":"2021-09-13","arxiv_id":"2109.06067","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["thunlp/pl-marker"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pack-together-entity-and-relation-extraction#ran","syntology_url":"https://syntology.ai/paper/2109.06067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06067"}}}},{"paper":"/paper/a-partition-filter-network-for-joint-entity","slug":"a-partition-filter-network-for-joint-entity","title":"A Partition Filter Network for Joint Entity and Relation Extraction","date":"2021-08-27","arxiv_id":"2108.12202","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["Coopercoppers/PFN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-partition-filter-network-for-joint-entity#ran","syntology_url":"https://syntology.ai/paper/2108.12202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.12202"}}}},{"paper":"/paper/nested-named-entity-recognition-via","slug":"nested-named-entity-recognition-via","title":"Nested Named Entity Recognition via Explicitly Excluding the Influence of the Best Path","date":"2021-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/boningknife-joint-entity-mention-detection","slug":"boningknife-joint-entity-mention-detection","title":"BoningKnife: Joint Entity Mention Detection and Typing for Nested NER via prior Boundary Knowledge","date":"2021-07-20","arxiv_id":"2107.09429","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/hyspa-hybrid-span-generation-for-scalable","slug":"hyspa-hybrid-span-generation-for-scalable","title":"HySPA: Hybrid Span Generation for Scalable Text-to-Graph Extraction","date":"2021-06-30","arxiv_id":"2106.15838","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["renll/HySPA"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyspa-hybrid-span-generation-for-scalable#ran","syntology_url":"https://syntology.ai/paper/2106.15838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.15838"}}}},{"paper":"/paper/text2event-controllable-sequence-to-structure","slug":"text2event-controllable-sequence-to-structure","title":"Text2Event: Controllable Sequence-to-Structure Generation for End-to-end Event Extraction","date":"2021-06-17","arxiv_id":"2106.09232","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["luyaojie/text2event"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/text2event-controllable-sequence-to-structure#ran","syntology_url":"https://syntology.ai/paper/2106.09232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09232"}}}},{"paper":"/paper/a-unified-generative-framework-for-various","slug":"a-unified-generative-framework-for-various","title":"A Unified Generative Framework for Various NER Subtasks","date":"2021-06-02","arxiv_id":"2106.01223","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-sequence-to-set-network-for-nested-named","slug":"a-sequence-to-set-network-for-nested-named","title":"A Sequence-to-Set Network for Nested Named Entity Recognition","date":"2021-05-19","arxiv_id":"2105.08901","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["zqtan1024/sequence-to-set"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-sequence-to-set-network-for-nested-named#ran","syntology_url":"https://syntology.ai/paper/2105.08901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08901"}}}},{"paper":"/paper/locate-and-label-a-two-stage-identifier-for","slug":"locate-and-label-a-two-stage-identifier-for","title":"Locate and Label: A Two-stage Identifier for Nested Named Entity Recognition","date":"2021-05-14","arxiv_id":"2105.06804","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/dual-pointer-network-for-fast-extraction-of","slug":"dual-pointer-network-for-fast-extraction-of","title":"Dual Pointer Network for Fast Extraction of Multiple Relations in a Sentence","date":"2021-03-05","arxiv_id":"2103.03509","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-trigger-sense-memory-flow-framework-for","slug":"a-trigger-sense-memory-flow-framework-for","title":"A Trigger-Sense Memory Flow Framework for Joint Entity and Relation Extraction","date":"2021-01-25","arxiv_id":"2101.10213","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/nested-named-entity-recognition-with","slug":"nested-named-entity-recognition-with","title":"Nested Named Entity Recognition with Partially-Observed TreeCRFs","date":"2020-12-15","arxiv_id":"2012.08478","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-frustratingly-easy-approach-for-joint","slug":"a-frustratingly-easy-approach-for-joint","title":"A Frustratingly Easy Approach for Entity and Relation Extraction","date":"2020-10-24","arxiv_id":"2010.12812","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["princeton-nlp/PURE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-frustratingly-easy-approach-for-joint#ran","syntology_url":"https://syntology.ai/paper/2010.12812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12812"}}}},{"paper":"/paper/named-entity-recognition-and-relation","slug":"named-entity-recognition-and-relation","title":"Named Entity Recognition and Relation Extraction using Enhanced Table Filling by Contextualized Representations","date":"2020-10-15","arxiv_id":"2010.07522","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/two-are-better-than-one-joint-entity-and","slug":"two-are-better-than-one-joint-entity-and","title":"Two are Better than One: Joint Entity and Relation Extraction with Table-Sequence Encoders","date":"2020-10-08","arxiv_id":"2010.03851","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["LorrinWWW/two-are-better-than-one"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/two-are-better-than-one-joint-entity-and#ran","syntology_url":"https://syntology.ai/paper/2010.03851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03851"}}}},{"paper":"/paper/asking-effective-and-diverse-questions-a","slug":"asking-effective-and-diverse-questions-a","title":"Asking Effective and Diverse Questions: A Machine Reading Comprehension based Framework for Joint Entity-Relation Extraction","date":"2020-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/named-entity-recognition-as-dependency","slug":"named-entity-recognition-as-dependency","title":"Named Entity Recognition as Dependency Parsing","date":"2020-05-14","arxiv_id":"2005.07150","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":4,"pointer_only_for_licence":2,"official":{"repos":["juntaoy/biaffine-ner"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/named-entity-recognition-as-dependency#ran","syntology_url":"https://syntology.ai/paper/2005.07150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07150"}}}},{"paper":"/paper/bipartite-flat-graph-network-for-nested-named","slug":"bipartite-flat-graph-network-for-nested-named","title":"Bipartite Flat-Graph Network for Nested Named Entity Recognition","date":"2020-05-01","arxiv_id":"2005.00436","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/relation-extraction-among-multiple-entities","slug":"relation-extraction-among-multiple-entities","title":"Relation Extraction among Multiple Entities Using a Dual Pointer Network with a Multi-Head Attention Mechanism","date":"2019-11-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-unified-mrc-framework-for-named-entity","slug":"a-unified-mrc-framework-for-named-entity","title":"A Unified MRC Framework for Named Entity Recognition","date":"2019-10-25","arxiv_id":"1910.11476","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["ShannonAI/mrc-for-flat-nested-ner"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-unified-mrc-framework-for-named-entity#ran","syntology_url":"https://syntology.ai/paper/1910.11476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11476"}}}},{"paper":"/paper/entity-relation-and-event-extraction-with","slug":"entity-relation-and-event-extraction-with","title":"Entity, Relation, and Event Extraction with Contextualized Span Representations","date":"2019-09-08","arxiv_id":"1909.03546","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["dwadden/dygiepp"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/entity-relation-and-event-extraction-with#ran","syntology_url":"https://syntology.ai/paper/1909.03546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03546"}}}},{"paper":"/paper/nested-named-entity-recognition-via-second","slug":"nested-named-entity-recognition-via-second","title":"Nested Named Entity Recognition via Second-best Sequence Learning and Decoding","date":"2019-09-05","arxiv_id":"1909.02250","rows_on_this_dataset":5,"code_links":3,"syntology":null},{"paper":"/paper/neural-architectures-for-nested-ner-through-1","slug":"neural-architectures-for-nested-ner-through-1","title":"Neural Architectures for Nested NER through Linearization","date":"2019-08-19","arxiv_id":"1908.06926","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/joint-type-inference-on-entities-and","slug":"joint-type-inference-on-entities-and","title":"Joint Type Inference on Entities and Relations via Graph Convolutional Networks","date":"2019-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/span-level-model-for-relation-extraction","slug":"span-level-model-for-relation-extraction","title":"Span-Level Model for Relation Extraction","date":"2019-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/merge-and-label-a-novel-neural-network","slug":"merge-and-label-a-novel-neural-network","title":"Merge and Label: A novel neural network architecture for nested NER","date":"2019-06-30","arxiv_id":"1907.00464","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/multi-grained-named-entity-recognition","slug":"multi-grained-named-entity-recognition","title":"Multi-Grained Named Entity Recognition","date":"2019-06-20","arxiv_id":"1906.08449","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/sequence-to-nuggets-nested-entity-mention","slug":"sequence-to-nuggets-nested-entity-mention","title":"Sequence-to-Nuggets: Nested Entity Mention Detection via Anchor-Region Networks","date":"2019-06-10","arxiv_id":"1906.03783","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/entity-relation-extraction-as-multi-turn","slug":"entity-relation-extraction-as-multi-turn","title":"Entity-Relation Extraction as Multi-Turn Question Answering","date":"2019-05-14","arxiv_id":"1905.05529","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-general-framework-for-information","slug":"a-general-framework-for-information","title":"A General Framework for Information Extraction using Dynamic Span Graphs","date":"2019-04-05","arxiv_id":"1904.03296","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/a-walk-based-model-on-entity-graphs-for","slug":"a-walk-based-model-on-entity-graphs-for","title":"A Walk-based Model on Entity Graphs for Relation Extraction","date":"2019-02-19","arxiv_id":"1902.07023","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-hierarchical-multi-task-approach-for","slug":"a-hierarchical-multi-task-approach-for","title":"A Hierarchical Multi-task Approach for Learning Embeddings from Semantic Tasks","date":"2018-11-14","arxiv_id":"1811.06031","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-hierarchical-multi-task-approach-for#ran","syntology_url":"https://syntology.ai/paper/1811.06031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.06031"}}}},{"paper":"/paper/a-neural-transition-based-model-for-nested","slug":"a-neural-transition-based-model-for-nested","title":"A Neural Transition-based Model for Nested Mention Recognition","date":"2018-10-03","arxiv_id":"1810.01808","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/neural-segmental-hypergraphs-for-overlapping","slug":"neural-segmental-hypergraphs-for-overlapping","title":"Neural Segmental Hypergraphs for Overlapping Mention Recognition","date":"2018-10-03","arxiv_id":"1810.01817","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/extracting-entities-and-relations-with-joint","slug":"extracting-entities-and-relations-with-joint","title":"Extracting Entities and Relations with Joint Minimum Risk Training","date":"2018-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-neural-layered-model-for-nested-named","slug":"a-neural-layered-model-for-nested-named","title":"A Neural Layered Model for Nested Named Entity Recognition","date":"2018-06-01","arxiv_id":null,"rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/end-to-end-neural-relation-extraction-with","slug":"end-to-end-neural-relation-extraction-with","title":"End-to-End Neural Relation Extraction with Global Optimization","date":"2017-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/going-out-on-a-limb-joint-extraction-of","slug":"going-out-on-a-limb-joint-extraction-of","title":"Going out on a limb: Joint Extraction of Entity Mentions and Relations without Dependency Trees","date":"2017-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/end-to-end-relation-extraction-using-lstms-on","slug":"end-to-end-relation-extraction-using-lstms-on","title":"End-to-End Relation Extraction using LSTMs on Sequences and Tree Structures","date":"2016-01-05","arxiv_id":"1601.00770","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/combining-neural-networks-and-log-linear","slug":"combining-neural-networks-and-log-linear","title":"Combining Neural Networks and Log-linear Models to Improve Relation Extraction","date":"2015-11-18","arxiv_id":"1511.05926","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/relation-extraction-perspective-from","slug":"relation-extraction-perspective-from","title":"Relation Extraction: Perspective from Convolutional Neural Networks","date":"2015-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/improved-relation-extraction-with-feature","slug":"improved-relation-extraction-with-feature","title":"Improved Relation Extraction with Feature-Rich Compositional Embedding Models","date":"2015-05-10","arxiv_id":"1505.02419","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/incremental-joint-extraction-of-entity","slug":"incremental-joint-extraction-of-entity","title":"Incremental Joint Extraction of Entity Mentions and Relations","date":"2014-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/iter-iterative-transformer-based-entity","slug":"iter-iterative-transformer-based-entity","title":"ITER: Iterative Transformer-based Entity Recognition and Relation Extraction","date":"2024-11-11","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/to-be-continuous-or-to-be-discrete-those-are","slug":"to-be-continuous-or-to-be-discrete-those-are","title":"To be Continuous, or to be Discrete, Those are Bits of Questions","date":"2024-06-12","arxiv_id":"2406.07812","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gollie-annotation-guidelines-improve-zero","slug":"gollie-annotation-guidelines-improve-zero","title":"GoLLIE: Annotation Guidelines improve Zero-Shot Information-Extraction","date":"2023-10-05","arxiv_id":"2310.03668","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":25,"samples_ran":18,"samples_constructed":2,"samples_ran_checked":17,"samples_ran_instrument_failed":1,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["hitz-zentroa/gollie"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":2,"n_ran_no_instrument_failure":17,"n_unverified":7,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/gollie-annotation-guidelines-improve-zero#ran","syntology_url":"https://syntology.ai/paper/2310.03668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.03668"}}}},{"paper":"/paper/universalner-targeted-distillation-from-large","slug":"universalner-targeted-distillation-from-large","title":"UniversalNER: Targeted Distillation from Large Language Models for Open Named Entity Recognition","date":"2023-08-07","arxiv_id":"2308.03279","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":4,"samples_unverified":4,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/universalner-targeted-distillation-from-large#ran","syntology_url":"https://syntology.ai/paper/2308.03279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03279"}}}},{"paper":"/paper/promptner-prompt-locating-and-typing-for","slug":"promptner-prompt-locating-and-typing-for","title":"PromptNER: Prompt Locating and Typing for Named Entity Recognition","date":"2023-05-26","arxiv_id":"2305.17104","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/diffusionner-boundary-diffusion-for-named","slug":"diffusionner-boundary-diffusion-for-named","title":"DiffusionNER: Boundary Diffusion for Named Entity Recognition","date":"2023-05-22","arxiv_id":"2305.13298","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/autoregressive-structured-prediction-with","slug":"autoregressive-structured-prediction-with","title":"Autoregressive Structured Prediction with Language Models","date":"2022-10-26","arxiv_id":"2210.14698","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-multi-gate-encoder-for-joint-entity-and","slug":"a-multi-gate-encoder-for-joint-entity-and","title":"A Multi-Gate Encoder for Joint Entity and Relation Extraction","date":"2022-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/optimizing-bi-encoder-for-named-entity","slug":"optimizing-bi-encoder-for-named-entity","title":"Optimizing Bi-Encoder for Named Entity Recognition via Contrastive Learning","date":"2022-08-30","arxiv_id":"2208.14565","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["microsoft/binder"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optimizing-bi-encoder-for-named-entity#ran","syntology_url":"https://syntology.ai/paper/2208.14565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.14565"}}}},{"paper":"/paper/an-embarrassingly-easy-but-strong-baseline","slug":"an-embarrassingly-easy-but-strong-baseline","title":"An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition","date":"2022-08-09","arxiv_id":"2208.04534","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deepstruct-pretraining-of-language-models-for-1","slug":"deepstruct-pretraining-of-language-models-for-1","title":"DeepStruct: Pretraining of Language Models for Structure Prediction","date":"2022-05-21","arxiv_id":"2205.10475","rows_on_this_dataset":7,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["cgraywang/deepstruct"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepstruct-pretraining-of-language-models-for-1#ran","syntology_url":"https://syntology.ai/paper/2205.10475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10475"}}}},{"paper":"/paper/boundary-smoothing-for-named-entity-1","slug":"boundary-smoothing-for-named-entity-1","title":"Boundary Smoothing for Named Entity Recognition","date":"2022-04-26","arxiv_id":"2204.12031","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/parallel-instance-query-network-for-named","slug":"parallel-instance-query-network-for-named","title":"Parallel Instance Query Network for Named Entity Recognition","date":"2022-03-20","arxiv_id":"2203.10545","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/unified-named-entity-recognition-as-word-word","slug":"unified-named-entity-recognition-as-word-word","title":"Unified Named Entity Recognition as Word-Word Relation Classification","date":"2021-12-19","arxiv_id":"2112.10070","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fusing-heterogeneous-factors-with-triaffine","slug":"fusing-heterogeneous-factors-with-triaffine","title":"Fusing Heterogeneous Factors with Triaffine Mechanism for Nested Named Entity Recognition","date":"2021-10-14","arxiv_id":"2110.07480","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/pack-together-entity-and-relation-extraction","slug":"pack-together-entity-and-relation-extraction","title":"Packed Levitated Marker for Entity and Relation Extraction","date":"2021-09-13","arxiv_id":"2109.06067","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["thunlp/pl-marker"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pack-together-entity-and-relation-extraction#ran","syntology_url":"https://syntology.ai/paper/2109.06067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06067"}}}},{"paper":"/paper/a-partition-filter-network-for-joint-entity","slug":"a-partition-filter-network-for-joint-entity","title":"A Partition Filter Network for Joint Entity and Relation Extraction","date":"2021-08-27","arxiv_id":"2108.12202","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["Coopercoppers/PFN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-partition-filter-network-for-joint-entity#ran","syntology_url":"https://syntology.ai/paper/2108.12202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.12202"}}}},{"paper":"/paper/nested-named-entity-recognition-via","slug":"nested-named-entity-recognition-via","title":"Nested Named Entity Recognition via Explicitly Excluding the Influence of the Best Path","date":"2021-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/boningknife-joint-entity-mention-detection","slug":"boningknife-joint-entity-mention-detection","title":"BoningKnife: Joint Entity Mention Detection and Typing for Nested NER via prior Boundary Knowledge","date":"2021-07-20","arxiv_id":"2107.09429","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/hyspa-hybrid-span-generation-for-scalable","slug":"hyspa-hybrid-span-generation-for-scalable","title":"HySPA: Hybrid Span Generation for Scalable Text-to-Graph Extraction","date":"2021-06-30","arxiv_id":"2106.15838","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["renll/HySPA"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyspa-hybrid-span-generation-for-scalable#ran","syntology_url":"https://syntology.ai/paper/2106.15838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.15838"}}}},{"paper":"/paper/text2event-controllable-sequence-to-structure","slug":"text2event-controllable-sequence-to-structure","title":"Text2Event: Controllable Sequence-to-Structure Generation for End-to-end Event Extraction","date":"2021-06-17","arxiv_id":"2106.09232","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["luyaojie/text2event"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/text2event-controllable-sequence-to-structure#ran","syntology_url":"https://syntology.ai/paper/2106.09232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09232"}}}},{"paper":"/paper/a-unified-generative-framework-for-various","slug":"a-unified-generative-framework-for-various","title":"A Unified Generative Framework for Various NER Subtasks","date":"2021-06-02","arxiv_id":"2106.01223","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-sequence-to-set-network-for-nested-named","slug":"a-sequence-to-set-network-for-nested-named","title":"A Sequence-to-Set Network for Nested Named Entity Recognition","date":"2021-05-19","arxiv_id":"2105.08901","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["zqtan1024/sequence-to-set"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-sequence-to-set-network-for-nested-named#ran","syntology_url":"https://syntology.ai/paper/2105.08901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08901"}}}},{"paper":"/paper/locate-and-label-a-two-stage-identifier-for","slug":"locate-and-label-a-two-stage-identifier-for","title":"Locate and Label: A Two-stage Identifier for Nested Named Entity Recognition","date":"2021-05-14","arxiv_id":"2105.06804","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/dual-pointer-network-for-fast-extraction-of","slug":"dual-pointer-network-for-fast-extraction-of","title":"Dual Pointer Network for Fast Extraction of Multiple Relations in a Sentence","date":"2021-03-05","arxiv_id":"2103.03509","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-trigger-sense-memory-flow-framework-for","slug":"a-trigger-sense-memory-flow-framework-for","title":"A Trigger-Sense Memory Flow Framework for Joint Entity and Relation Extraction","date":"2021-01-25","arxiv_id":"2101.10213","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/nested-named-entity-recognition-with","slug":"nested-named-entity-recognition-with","title":"Nested Named Entity Recognition with Partially-Observed TreeCRFs","date":"2020-12-15","arxiv_id":"2012.08478","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-frustratingly-easy-approach-for-joint","slug":"a-frustratingly-easy-approach-for-joint","title":"A Frustratingly Easy Approach for Entity and Relation Extraction","date":"2020-10-24","arxiv_id":"2010.12812","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["princeton-nlp/PURE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-frustratingly-easy-approach-for-joint#ran","syntology_url":"https://syntology.ai/paper/2010.12812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12812"}}}},{"paper":"/paper/named-entity-recognition-and-relation","slug":"named-entity-recognition-and-relation","title":"Named Entity Recognition and Relation Extraction using Enhanced Table Filling by Contextualized Representations","date":"2020-10-15","arxiv_id":"2010.07522","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/two-are-better-than-one-joint-entity-and","slug":"two-are-better-than-one-joint-entity-and","title":"Two are Better than One: Joint Entity and Relation Extraction with Table-Sequence Encoders","date":"2020-10-08","arxiv_id":"2010.03851","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["LorrinWWW/two-are-better-than-one"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/two-are-better-than-one-joint-entity-and#ran","syntology_url":"https://syntology.ai/paper/2010.03851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03851"}}}},{"paper":"/paper/asking-effective-and-diverse-questions-a","slug":"asking-effective-and-diverse-questions-a","title":"Asking Effective and Diverse Questions: A Machine Reading Comprehension based Framework for Joint Entity-Relation Extraction","date":"2020-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/named-entity-recognition-as-dependency","slug":"named-entity-recognition-as-dependency","title":"Named Entity Recognition as Dependency Parsing","date":"2020-05-14","arxiv_id":"2005.07150","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":4,"pointer_only_for_licence":2,"official":{"repos":["juntaoy/biaffine-ner"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/named-entity-recognition-as-dependency#ran","syntology_url":"https://syntology.ai/paper/2005.07150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07150"}}}},{"paper":"/paper/bipartite-flat-graph-network-for-nested-named","slug":"bipartite-flat-graph-network-for-nested-named","title":"Bipartite Flat-Graph Network for Nested Named Entity Recognition","date":"2020-05-01","arxiv_id":"2005.00436","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/relation-extraction-among-multiple-entities","slug":"relation-extraction-among-multiple-entities","title":"Relation Extraction among Multiple Entities Using a Dual Pointer Network with a Multi-Head Attention Mechanism","date":"2019-11-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-unified-mrc-framework-for-named-entity","slug":"a-unified-mrc-framework-for-named-entity","title":"A Unified MRC Framework for Named Entity Recognition","date":"2019-10-25","arxiv_id":"1910.11476","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["ShannonAI/mrc-for-flat-nested-ner"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-unified-mrc-framework-for-named-entity#ran","syntology_url":"https://syntology.ai/paper/1910.11476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11476"}}}},{"paper":"/paper/entity-relation-and-event-extraction-with","slug":"entity-relation-and-event-extraction-with","title":"Entity, Relation, and Event Extraction with Contextualized Span Representations","date":"2019-09-08","arxiv_id":"1909.03546","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["dwadden/dygiepp"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/entity-relation-and-event-extraction-with#ran","syntology_url":"https://syntology.ai/paper/1909.03546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03546"}}}},{"paper":"/paper/nested-named-entity-recognition-via-second","slug":"nested-named-entity-recognition-via-second","title":"Nested Named Entity Recognition via Second-best Sequence Learning and Decoding","date":"2019-09-05","arxiv_id":"1909.02250","rows_on_this_dataset":5,"code_links":3,"syntology":null},{"paper":"/paper/neural-architectures-for-nested-ner-through-1","slug":"neural-architectures-for-nested-ner-through-1","title":"Neural Architectures for Nested NER through Linearization","date":"2019-08-19","arxiv_id":"1908.06926","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/joint-type-inference-on-entities-and","slug":"joint-type-inference-on-entities-and","title":"Joint Type Inference on Entities and Relations via Graph Convolutional Networks","date":"2019-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/span-level-model-for-relation-extraction","slug":"span-level-model-for-relation-extraction","title":"Span-Level Model for Relation Extraction","date":"2019-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/merge-and-label-a-novel-neural-network","slug":"merge-and-label-a-novel-neural-network","title":"Merge and Label: A novel neural network architecture for nested NER","date":"2019-06-30","arxiv_id":"1907.00464","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/multi-grained-named-entity-recognition","slug":"multi-grained-named-entity-recognition","title":"Multi-Grained Named Entity Recognition","date":"2019-06-20","arxiv_id":"1906.08449","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/sequence-to-nuggets-nested-entity-mention","slug":"sequence-to-nuggets-nested-entity-mention","title":"Sequence-to-Nuggets: Nested Entity Mention Detection via Anchor-Region Networks","date":"2019-06-10","arxiv_id":"1906.03783","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/entity-relation-extraction-as-multi-turn","slug":"entity-relation-extraction-as-multi-turn","title":"Entity-Relation Extraction as Multi-Turn Question Answering","date":"2019-05-14","arxiv_id":"1905.05529","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-general-framework-for-information","slug":"a-general-framework-for-information","title":"A General Framework for Information Extraction using Dynamic Span Graphs","date":"2019-04-05","arxiv_id":"1904.03296","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/a-walk-based-model-on-entity-graphs-for","slug":"a-walk-based-model-on-entity-graphs-for","title":"A Walk-based Model on Entity Graphs for Relation Extraction","date":"2019-02-19","arxiv_id":"1902.07023","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-hierarchical-multi-task-approach-for","slug":"a-hierarchical-multi-task-approach-for","title":"A Hierarchical Multi-task Approach for Learning Embeddings from Semantic Tasks","date":"2018-11-14","arxiv_id":"1811.06031","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-hierarchical-multi-task-approach-for#ran","syntology_url":"https://syntology.ai/paper/1811.06031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.06031"}}}},{"paper":"/paper/a-neural-transition-based-model-for-nested","slug":"a-neural-transition-based-model-for-nested","title":"A Neural Transition-based Model for Nested Mention Recognition","date":"2018-10-03","arxiv_id":"1810.01808","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/neural-segmental-hypergraphs-for-overlapping","slug":"neural-segmental-hypergraphs-for-overlapping","title":"Neural Segmental Hypergraphs for Overlapping Mention Recognition","date":"2018-10-03","arxiv_id":"1810.01817","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/extracting-entities-and-relations-with-joint","slug":"extracting-entities-and-relations-with-joint","title":"Extracting Entities and Relations with Joint Minimum Risk Training","date":"2018-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-neural-layered-model-for-nested-named","slug":"a-neural-layered-model-for-nested-named","title":"A Neural Layered Model for Nested Named Entity Recognition","date":"2018-06-01","arxiv_id":null,"rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/end-to-end-neural-relation-extraction-with","slug":"end-to-end-neural-relation-extraction-with","title":"End-to-End Neural Relation Extraction with Global Optimization","date":"2017-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/going-out-on-a-limb-joint-extraction-of","slug":"going-out-on-a-limb-joint-extraction-of","title":"Going out on a limb: Joint Extraction of Entity Mentions and Relations without Dependency Trees","date":"2017-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/end-to-end-relation-extraction-using-lstms-on","slug":"end-to-end-relation-extraction-using-lstms-on","title":"End-to-End Relation Extraction using LSTMs on Sequences and Tree Structures","date":"2016-01-05","arxiv_id":"1601.00770","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/combining-neural-networks-and-log-linear","slug":"combining-neural-networks-and-log-linear","title":"Combining Neural Networks and Log-linear Models to Improve Relation Extraction","date":"2015-11-18","arxiv_id":"1511.05926","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/relation-extraction-perspective-from","slug":"relation-extraction-perspective-from","title":"Relation Extraction: Perspective from Convolutional Neural Networks","date":"2015-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/improved-relation-extraction-with-feature","slug":"improved-relation-extraction-with-feature","title":"Improved Relation Extraction with Feature-Rich Compositional Embedding Models","date":"2015-05-10","arxiv_id":"1505.02419","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/incremental-joint-extraction-of-entity","slug":"incremental-joint-extraction-of-entity","title":"Incremental Joint Extraction of Entity Mentions and Relations","date":"2014-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null}],"papers_where_code_ran":14,"papers_where_code_ran_first_page":"/dataset/ace-2005/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/ace-2005/papers/ran/1","json":"/dataset/ace-2005/papers/ran/1.json","rows":14}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":15,"samples_harvested":114,"samples_ran":83,"samples_constructed":9,"samples_ran_checked":58,"samples_ran_instrument_failed":25,"samples_unverified":31,"pointer_only_for_licence":22,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":14,"papers_with_a_run_with_no_instrument_failure":14,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"cc5ef4a85a57d65abc77f146fc7648c566bd9aafca5c983f0935f545e32252a3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}