{"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/learning-to-ignore-long-document-coreference","title":"Learning to Ignore: Long Document Coreference with Bounded Memory Neural Networks","arxiv_id":"2010.02807","date":"2020-10-06","proceeding":"EMNLP 2020 11","authors":["Shubham Toshniwal","Sam Wiseman","Allyson Ettinger","Karen Livescu","Kevin Gimpel"],"abstract":"Long document coreference resolution remains a challenging task due to the large memory and runtime requirements of current models. Recent work doing incremental coreference resolution using just the global representation of entities shows practical benefits but requires keeping all entities in memory, which can be impractical for long documents. We argue that keeping all entities in memory is unnecessary, and we propose a memory-augmented neural network that tracks only a small bounded number of entities at a time, thus guaranteeing a linear runtime in length of document. We show that (a) the model remains competitive with models with high memory and computational requirements on OntoNotes and LitBank, and (b) the model learns an efficient memory management strategy easily outperforming a rule-based strategy.","url_abs":"https://arxiv.org/abs/2010.02807v3","url_pdf":"https://arxiv.org/pdf/2010.02807v3.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":"learning-to-ignore-long-document-coreference","repo_url":"https://github.com/shtoshni92/long-doc-coref","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-to-ignore-long-document-coreference","repo_url":"https://github.com/shtoshni/fast-coref","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-to-ignore-long-document-coreference","repo_url":"https://github.com/shtoshni92/fast-coref","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"coreference-resolution","task_name":"Coreference Resolution"},{"task_slug":"management","task_name":"Management"}],"methods":[{"method_slug":"memory-network","method_name":"Memory Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/coreference-resolution-on-conll-2012","task":"Coreference Resolution","dataset":"CoNLL 2012","model":"U-MEM* + SpanBERT-large","rank_in_archive_order":10,"of":18,"metrics":{"Avg F1":"79.6"},"uses_additional_data":false},{"leaderboard":"/sota/coreference-resolution-on-ontonotes","task":"Coreference Resolution","dataset":"OntoNotes","model":"U-MEM* + SpanBERT","rank_in_archive_order":12,"of":26,"metrics":{"F1":"79.6"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2010.02807","atlas_url":"https://app.syntology.ai/?focus=2010.02807","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":"2010.02807"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2010.02807\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2010.02807"},"call":"get_concepts_for_paper(arxiv_id=\"2010.02807\")"}],"by_repo":[{"repo":"shtoshni92/long-doc-coref","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"shtoshni/fast-coref","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"shtoshni92/fast-coref","kind":"listed","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":"b184435864b69f53df185c908b4fc773242269704623d5cd360bfde39ad716be","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}