{"url":"/sota/nested-named-entity-recognition-on-ace-2004","task":{"name":"Nested Named Entity Recognition","url":"/task/nested-named-entity-recognition","note":null},"dataset":{"name":"ACE 2004","url":"/dataset/ace-2004"},"category":"Natural Language Processing","categories":["Natural Language Processing"],"category_note":null,"description":"Nested named entity recognition is a subtask of information extraction that seeks to locate and classify nested named entities (i.e., hierarchically structured entities) mentioned in unstructured text (Source: Adapted from Wikipedia).","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["F1"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"F1":"higher"}},"counts":{"rows":24,"rows_with_code":23,"rows_with_paper_page":24,"rows_dated":24,"rows_using_additional_data":3},"rows":[{"rank_in_archive_order":1,"model":"PromptNER [RoBERTa-large]","metrics":{"F1":"88.72"},"uses_additional_data":false,"paper_date":"2023-05-26","paper":"/paper/promptner-prompt-locating-and-typing-for","paper_url":"https://arxiv.org/abs/2305.17104v1","paper_title":"PromptNER: Prompt Locating and Typing for Named Entity Recognition","code":"https://github.com/tricktreat/promptner","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"BINDER","metrics":{"F1":"88.7"},"uses_additional_data":false,"paper_date":"2022-08-30","paper":"/paper/optimizing-bi-encoder-for-named-entity","paper_url":"https://arxiv.org/abs/2208.14565v2","paper_title":"Optimizing Bi-Encoder for Named Entity Recognition via Contrastive Learning","code":"https://github.com/microsoft/binder","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"Triaffine + ALBERT","metrics":{"F1":"88.56"},"uses_additional_data":false,"paper_date":"2021-10-14","paper":"/paper/fusing-heterogeneous-factors-with-triaffine","paper_url":"https://arxiv.org/abs/2110.07480v3","paper_title":"Fusing Heterogeneous Factors with Triaffine Mechanism for Nested Named Entity Recognition","code":"https://github.com/GanjinZero/Triaffine-nested-ner","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"DiffusionNER","metrics":{"F1":"88.39"},"uses_additional_data":false,"paper_date":"2023-05-22","paper":"/paper/diffusionner-boundary-diffusion-for-named","paper_url":"https://arxiv.org/abs/2305.13298v1","paper_title":"DiffusionNER: Boundary Diffusion for Named Entity Recognition","code":"https://github.com/tricktreat/diffusionner","n_code_links":3,"syntology":null},{"rank_in_archive_order":5,"model":"PromptNER [BERT-large]","metrics":{"F1":"88.16"},"uses_additional_data":false,"paper_date":"2023-05-26","paper":"/paper/promptner-prompt-locating-and-typing-for","paper_url":"https://arxiv.org/abs/2305.17104v1","paper_title":"PromptNER: Prompt Locating and Typing for Named Entity Recognition","code":"https://github.com/tricktreat/promptner","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"PIQN","metrics":{"F1":"88.14"},"uses_additional_data":false,"paper_date":"2022-03-20","paper":"/paper/parallel-instance-query-network-for-named","paper_url":"https://arxiv.org/abs/2203.10545v1","paper_title":"Parallel Instance Query Network for Named Entity Recognition","code":"https://github.com/tricktreat/piqn","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"CNN-NER","metrics":{"F1":"88.03"},"uses_additional_data":false,"paper_date":"2022-08-09","paper":"/paper/an-embarrassingly-easy-but-strong-baseline","paper_url":"https://arxiv.org/abs/2208.04534v3","paper_title":"An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition","code":"https://github.com/yhcc/cnn_nested_ner","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"Baseline + BS","metrics":{"F1":"87.98"},"uses_additional_data":false,"paper_date":"2022-04-26","paper":"/paper/boundary-smoothing-for-named-entity-1","paper_url":"https://arxiv.org/abs/2204.12031v1","paper_title":"Boundary Smoothing for Named Entity Recognition","code":"https://github.com/syuoni/eznlp","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"Hashing","metrics":{"F1":"87.93"},"uses_additional_data":false,"paper_date":"2024-06-12","paper":"/paper/to-be-continuous-or-to-be-discrete-those-are","paper_url":"https://arxiv.org/abs/2406.07812v1","paper_title":"To be Continuous, or to be Discrete, Those are Bits of Questions","code":"https://github.com/speedcell4/parserker","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"W2NER","metrics":{"F1":"87.52"},"uses_additional_data":false,"paper_date":"2021-12-19","paper":"/paper/unified-named-entity-recognition-as-word-word","paper_url":"https://arxiv.org/abs/2112.10070v1","paper_title":"Unified Named Entity Recognition as Word-Word Relation Classification","code":"https://github.com/ljynlp/w2ner","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"Locate and Label","metrics":{"F1":"87.41"},"uses_additional_data":false,"paper_date":"2021-05-14","paper":"/paper/locate-and-label-a-two-stage-identifier-for","paper_url":"https://arxiv.org/abs/2105.06804v2","paper_title":"Locate and Label: A Two-stage Identifier for Nested Named Entity Recognition","code":"https://github.com/tricktreat/locate-and-label","n_code_links":1,"syntology":null},{"rank_in_archive_order":12,"model":"Triaffine + BioBERT","metrics":{"F1":"87.40"},"uses_additional_data":false,"paper_date":"2021-10-14","paper":"/paper/fusing-heterogeneous-factors-with-triaffine","paper_url":"https://arxiv.org/abs/2110.07480v3","paper_title":"Fusing Heterogeneous Factors with Triaffine Mechanism for Nested Named Entity Recognition","code":"https://github.com/GanjinZero/Triaffine-nested-ner","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"Sequence-to-Set","metrics":{"F1":"87.26"},"uses_additional_data":false,"paper_date":"2021-05-19","paper":"/paper/a-sequence-to-set-network-for-nested-named","paper_url":"https://arxiv.org/abs/2105.08901v2","paper_title":"A Sequence-to-Set Network for Nested Named Entity Recognition","code":"https://github.com/zqtan1024/sequence-to-set","n_code_links":1,"syntology":{"n_ran":5,"n_unverified":0,"n_samples":5,"n_pointer_only_licence":5}},{"rank_in_archive_order":14,"model":"BARTNER","metrics":{"F1":"86.84"},"uses_additional_data":false,"paper_date":"2021-06-02","paper":"/paper/a-unified-generative-framework-for-various","paper_url":"https://arxiv.org/abs/2106.01223v1","paper_title":"A Unified Generative Framework for Various NER Subtasks","code":"https://github.com/yhcc/BARTNER","n_code_links":1,"syntology":null},{"rank_in_archive_order":15,"model":"PO-TreeCRFs","metrics":{"F1":"86.6"},"uses_additional_data":false,"paper_date":"2020-12-15","paper":"/paper/nested-named-entity-recognition-with","paper_url":"https://arxiv.org/abs/2012.08478v1","paper_title":"Nested Named Entity Recognition with Partially-Observed TreeCRFs","code":"https://github.com/FranxYao/Partially-Observed-TreeCRFs","n_code_links":1,"syntology":null},{"rank_in_archive_order":16,"model":"LogSumExpDecoder","metrics":{"F1":"86.42"},"uses_additional_data":false,"paper_date":"2021-08-01","paper":"/paper/nested-named-entity-recognition-via","paper_url":"https://aclanthology.org/2021.acl-long.275","paper_title":"Nested Named Entity Recognition via Explicitly Excluding the Influence of the Best Path","code":"https://github.com/speedcell4/nersted","n_code_links":1,"syntology":null},{"rank_in_archive_order":17,"model":"BoningKnife","metrics":{"F1":"86.41"},"uses_additional_data":false,"paper_date":"2021-07-20","paper":"/paper/boningknife-joint-entity-mention-detection","paper_url":"https://arxiv.org/abs/2107.09429v1","paper_title":"BoningKnife: Joint Entity Mention Detection and Typing for Nested NER via prior Boundary Knowledge","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":18,"model":"Second-best learning and decoding + BERT + Flair","metrics":{"F1":"85.82"},"uses_additional_data":true,"paper_date":"2019-09-05","paper":"/paper/nested-named-entity-recognition-via-second","paper_url":"https://arxiv.org/abs/1909.02250v3","paper_title":"Nested Named Entity Recognition via Second-best Sequence Learning and Decoding","code":"https://github.com/yahshibu/nested-ner-tacl2020-transformers","n_code_links":3,"syntology":null},{"rank_in_archive_order":19,"model":"Second-best learning and decoding + BERT","metrics":{"F1":"84.97"},"uses_additional_data":true,"paper_date":"2019-09-05","paper":"/paper/nested-named-entity-recognition-via-second","paper_url":"https://arxiv.org/abs/1909.02250v3","paper_title":"Nested Named Entity Recognition via Second-best Sequence Learning and Decoding","code":"https://github.com/yahshibu/nested-ner-tacl2020-transformers","n_code_links":3,"syntology":null},{"rank_in_archive_order":20,"model":"seq2seq+BERT+Flair","metrics":{"F1":"84.40"},"uses_additional_data":false,"paper_date":"2019-08-19","paper":"/paper/neural-architectures-for-nested-ner-through-1","paper_url":"https://arxiv.org/abs/1908.06926v1","paper_title":"Neural Architectures for Nested NER through Linearization","code":"https://github.com/ufal/acl2019_nested_ner","n_code_links":1,"syntology":null},{"rank_in_archive_order":21,"model":"MGNER","metrics":{"F1":"79.5"},"uses_additional_data":true,"paper_date":"2019-06-20","paper":"/paper/multi-grained-named-entity-recognition","paper_url":"https://arxiv.org/abs/1906.08449v1","paper_title":"Multi-Grained Named Entity Recognition","code":"https://github.com/congyingxia/Multi-Grained-NER","n_code_links":1,"syntology":null},{"rank_in_archive_order":22,"model":"Second-best learning and decoding","metrics":{"F1":"77.44"},"uses_additional_data":false,"paper_date":"2019-09-05","paper":"/paper/nested-named-entity-recognition-via-second","paper_url":"https://arxiv.org/abs/1909.02250v3","paper_title":"Nested Named Entity Recognition via Second-best Sequence Learning and Decoding","code":"https://github.com/yahshibu/nested-ner-tacl2020-transformers","n_code_links":3,"syntology":null},{"rank_in_archive_order":23,"model":"Neural segmental hypergraphs","metrics":{"F1":"75.1"},"uses_additional_data":false,"paper_date":"2018-10-03","paper":"/paper/neural-segmental-hypergraphs-for-overlapping","paper_url":"http://arxiv.org/abs/1810.01817v1","paper_title":"Neural Segmental Hypergraphs for Overlapping Mention Recognition","code":"https://github.com/berlino/overlapping-ner-em18","n_code_links":1,"syntology":null},{"rank_in_archive_order":24,"model":"Neural transition-based model","metrics":{"F1":"73.3"},"uses_additional_data":false,"paper_date":"2018-10-03","paper":"/paper/a-neural-transition-based-model-for-nested","paper_url":"http://arxiv.org/abs/1810.01808v1","paper_title":"A Neural Transition-based Model for Nested Mention Recognition","code":"https://github.com/berlino/nest-trans-em18","n_code_links":1,"syntology":null}],"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":2,"rows_with_any_sample_ran":2,"distinct_papers_with_graph_line":2,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":9,"n_unverified":0,"n_samples":9,"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":9,"n_unverified":0,"n_samples":9,"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"}}}