{"url":"/sota/nested-mention-recognition-on-ace-2005","task":{"name":"Nested Mention Recognition","url":"/task/nested-mention-recognition","note":null},"dataset":{"name":"ACE 2005","url":"/dataset/ace-2005"},"category":"Natural Language Processing","categories":["Natural Language Processing"],"category_note":null,"description":"Nested mention recognition is the task of correctly modeling the nested structure of mentions.","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":10,"rows_with_code":9,"rows_with_paper_page":10,"rows_dated":10,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"BoningKnife","metrics":{"F1":"85.46"},"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":2,"model":"Second-best learning and decoding","metrics":{"F1":"84.34"},"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":3,"model":"seq2seq+BERT+Flair","metrics":{"F1":"84.33"},"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":4,"model":"Merge and Label","metrics":{"F1":"82.4"},"uses_additional_data":false,"paper_date":"2019-06-30","paper":"/paper/merge-and-label-a-novel-neural-network","paper_url":"https://arxiv.org/abs/1907.00464v1","paper_title":"Merge and Label: A novel neural network architecture for nested NER","code":"https://github.com/fishjh2/merge_label","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"MGNER","metrics":{"F1":"78.2"},"uses_additional_data":false,"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":6,"model":"BiFlaG","metrics":{"F1":"75.1"},"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":7,"model":"Anchor-Region Networks","metrics":{"F1":"74.9"},"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":8,"model":"Neural segmental hypergraphs","metrics":{"F1":"74.5"},"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":9,"model":"Neural transition-based model","metrics":{"F1":"73.0"},"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},{"rank_in_archive_order":10,"model":"Neural layered model","metrics":{"F1":"72.2"},"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}],"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,264 of the 9,581 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":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"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":0,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":0,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"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"}}}