{"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":"/paper/bipartite-flat-graph-network-for-nested-named","title":"Bipartite Flat-Graph Network for Nested Named Entity Recognition","arxiv_id":"2005.00436","date":"2020-05-01","proceeding":"ACL 2020 6","authors":["Ying Luo","Hai Zhao"],"abstract":"In this paper, we propose a novel bipartite flat-graph network (BiFlaG) for nested named entity recognition (NER), which contains two subgraph modules: a flat NER module for outermost entities and a graph module for all the entities located in inner layers. Bidirectional LSTM (BiLSTM) and graph convolutional network (GCN) are adopted to jointly learn flat entities and their inner dependencies. Different from previous models, which only consider the unidirectional delivery of information from innermost layers to outer ones (or outside-to-inside), our model effectively captures the bidirectional interaction between them. We first use the entities recognized by the flat NER module to construct an entity graph, which is fed to the next graph module. The richer representation learned from graph module carries the dependencies of inner entities and can be exploited to improve outermost entity predictions. Experimental results on three standard nested NER datasets demonstrate that our BiFlaG outperforms previous state-of-the-art models.","url_abs":"https://arxiv.org/abs/2005.00436v1","url_pdf":"https://arxiv.org/pdf/2005.00436v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"bipartite-flat-graph-network-for-nested-named","repo_url":"https://github.com/cslydia/BiFlaG","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"cg","task_name":"NER"},{"task_slug":"named-entity-recognition-1","task_name":"Named Entity Recognition"},{"task_slug":"named-entity-recognition-ner","task_name":"Named Entity Recognition (NER)"},{"task_slug":"nested-mention-recognition","task_name":"Nested Mention Recognition"},{"task_slug":"nested-named-entity-recognition","task_name":"Nested Named Entity Recognition"},{"task_slug":"named-entity-recognition","task_name":"named-entity-recognition"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/named-entity-recognition-on-ace-2005","task":"Named Entity Recognition (NER)","dataset":"ACE 2005","model":"BiFlaG","rank_in_archive_order":16,"of":20,"metrics":{"F1":"75.1"},"uses_additional_data":false},{"leaderboard":"/sota/named-entity-recognition-on-genia","task":"Named Entity Recognition (NER)","dataset":"GENIA","model":"BiFlaG","rank_in_archive_order":8,"of":14,"metrics":{"F1":"76.0"},"uses_additional_data":false},{"leaderboard":"/sota/nested-mention-recognition-on-ace-2005","task":"Nested Mention Recognition","dataset":"ACE 2005","model":"BiFlaG","rank_in_archive_order":6,"of":10,"metrics":{"F1":"75.1"},"uses_additional_data":false},{"leaderboard":"/sota/nested-named-entity-recognition-on-ace-2005","task":"Nested Named Entity Recognition","dataset":"ACE 2005","model":"BiFlaG","rank_in_archive_order":22,"of":25,"metrics":{"F1":"75.1"},"uses_additional_data":false},{"leaderboard":"/sota/nested-named-entity-recognition-on-genia","task":"Nested Named Entity Recognition","dataset":"GENIA","model":"BiFlaG","rank_in_archive_order":21,"of":26,"metrics":{"F1":"76.0"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2005.00436","atlas_url":"https://app.syntology.ai/?focus=2005.00436","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2005.00436"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2005.00436\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2005.00436"},"call":"get_concepts_for_paper(arxiv_id=\"2005.00436\")"}],"by_repo":[{"repo":"cslydia/BiFlaG","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"111245dc638f05a286b38abf903dd418145cffe5a5b1b92a51e0f7977d15018e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}