{"url":"/sota/nested-named-entity-recognition-on-genia","task":{"name":"Nested Named Entity Recognition","url":"/task/nested-named-entity-recognition","note":null},"dataset":{"name":"GENIA","url":"/dataset/genia"},"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":26,"rows_with_code":26,"rows_with_paper_page":26,"rows_dated":26,"rows_using_additional_data":3},"rows":[{"rank_in_archive_order":1,"model":"PIQN","metrics":{"F1":"81.77"},"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":2,"model":"DiffusionNER","metrics":{"F1":"81.53"},"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":3,"model":"CNN-NER","metrics":{"F1":"81.40"},"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":4,"model":"W2NER","metrics":{"F1":"81.39"},"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":5,"model":"Triaffine + BioBERT","metrics":{"F1":"81.23"},"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":6,"model":"Locate and Label","metrics":{"F1":"80.54"},"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":7,"model":"Hashing","metrics":{"F1":"80.54"},"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":8,"model":"BINDER","metrics":{"F1":"80.5"},"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":9,"model":"Sequence-to-Set","metrics":{"F1":"80.44"},"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":10,"model":"BioBART","metrics":{"F1":"79.93"},"uses_additional_data":false,"paper_date":"2022-04-08","paper":"/paper/biobart-pretraining-and-evaluation-of-a","paper_url":"https://arxiv.org/abs/2204.03905v2","paper_title":"BioBART: Pretraining and Evaluation of A Biomedical Generative Language Model","code":"https://github.com/GanjinZero/BioBART","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"BARTNER","metrics":{"F1":"79.23"},"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":12,"model":"Pyramid + BERT","metrics":{"F1":"79.19"},"uses_additional_data":true,"paper_date":"2020-07-01","paper":"/paper/pyramid-a-layered-model-for-nested-named","paper_url":"https://aclanthology.org/2020.acl-main.525","paper_title":"Pyramid: A Layered Model for Nested Named Entity Recognition","code":"https://github.com/LorrinWWW/Pyramid","n_code_links":2,"syntology":null},{"rank_in_archive_order":13,"model":"LogSumExpDecoder","metrics":{"F1":"78.93"},"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":14,"model":"seq2seq+BERT+Flair","metrics":{"F1":"78.31"},"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":15,"model":"SpanModel + SequenceLabelingModel","metrics":{"F1":"78.3"},"uses_additional_data":false,"paper_date":"2023-05-30","paper":"/paper/comparing-and-combining-some-popular-ner","paper_url":"https://arxiv.org/abs/2305.19120v1","paper_title":"Comparing and combining some popular NER approaches on Biomedical tasks","code":"https://github.com/flyingmothman/bionlp","n_code_links":1,"syntology":null},{"rank_in_archive_order":16,"model":"PO-TreeCRFs","metrics":{"F1":"78.2"},"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":17,"model":"Pyramid","metrics":{"F1":"77.78"},"uses_additional_data":false,"paper_date":"2020-07-01","paper":"/paper/pyramid-a-layered-model-for-nested-named","paper_url":"https://aclanthology.org/2020.acl-main.525","paper_title":"Pyramid: A Layered Model for Nested Named Entity Recognition","code":"https://github.com/LorrinWWW/Pyramid","n_code_links":2,"syntology":null},{"rank_in_archive_order":18,"model":"Second-best learning and decoding + BERT + Flair","metrics":{"F1":"77.36"},"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","metrics":{"F1":"77.19"},"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":20,"model":"Second-best learning and decoding + BERT","metrics":{"F1":"77.05"},"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":21,"model":"BiFlaG","metrics":{"F1":"76.0"},"uses_additional_data":false,"paper_date":"2020-05-01","paper":"/paper/bipartite-flat-graph-network-for-nested-named","paper_url":"https://arxiv.org/abs/2005.00436v1","paper_title":"Bipartite Flat-Graph Network for Nested Named Entity Recognition","code":"https://github.com/cslydia/BiFlaG","n_code_links":1,"syntology":null},{"rank_in_archive_order":22,"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":23,"model":"Anchor-Region Networks","metrics":{"F1":"74.8"},"uses_additional_data":false,"paper_date":"2019-06-10","paper":"/paper/sequence-to-nuggets-nested-entity-mention","paper_url":"https://arxiv.org/abs/1906.03783v1","paper_title":"Sequence-to-Nuggets: Nested Entity Mention Detection via Anchor-Region Networks","code":"https://github.com/sanmusunrise/ARNs","n_code_links":1,"syntology":null},{"rank_in_archive_order":24,"model":"Neural layered model","metrics":{"F1":"74.7"},"uses_additional_data":false,"paper_date":"2018-06-01","paper":"/paper/a-neural-layered-model-for-nested-named","paper_url":"https://aclanthology.org/N18-1131","paper_title":"A Neural Layered Model for Nested Named Entity Recognition","code":"https://github.com/meizhiju/layered-bilstm-crf","n_code_links":1,"syntology":null},{"rank_in_archive_order":25,"model":"Boundary-aware neural model","metrics":{"F1":"74.7"},"uses_additional_data":false,"paper_date":"2019-11-01","paper":"/paper/a-boundary-aware-neural-model-for-nested","paper_url":"https://aclanthology.org/D19-1034","paper_title":"A Boundary-aware Neural Model for Nested Named Entity Recognition","code":"https://github.com/thecharm/boundary-aware-nested-ner","n_code_links":1,"syntology":null},{"rank_in_archive_order":26,"model":"Neural transition-based model","metrics":{"F1":"73.9"},"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":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":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"}}}