{"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/a-general-framework-for-information","title":"A General Framework for Information Extraction using Dynamic Span Graphs","arxiv_id":"1904.03296","date":"2019-04-05","proceeding":"NAACL 2019 6","authors":["Yi Luan","Dave Wadden","Luheng He","Amy Shah","Mari Ostendorf","Hannaneh Hajishirzi"],"abstract":"We introduce a general framework for several information extraction tasks\nthat share span representations using dynamically constructed span graphs. The\ngraphs are constructed by selecting the most confident entity spans and linking\nthese nodes with confidence-weighted relation types and coreferences. The\ndynamic span graph allows coreference and relation type confidences to\npropagate through the graph to iteratively refine the span representations.\nThis is unlike previous multi-task frameworks for information extraction in\nwhich the only interaction between tasks is in the shared first-layer LSTM. Our\nframework significantly outperforms the state-of-the-art on multiple\ninformation extraction tasks across multiple datasets reflecting different\ndomains. We further observe that the span enumeration approach is good at\ndetecting nested span entities, with significant F1 score improvement on the\nACE dataset.","url_abs":"http://arxiv.org/abs/1904.03296v1","url_pdf":"http://arxiv.org/pdf/1904.03296v1.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":"a-general-framework-for-information","repo_url":"https://github.com/luanyi/DyGIE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"a-general-framework-for-information","repo_url":"https://github.com/AndrewSukhobok95/DL_GraphEntity_project","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"a-general-framework-for-information","repo_url":"https://github.com/tricktreat/trimf","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"joint-entity-and-relation-extraction","task_name":"Joint Entity and Relation Extraction"},{"task_slug":"named-entity-recognition-ner","task_name":"Named Entity Recognition (NER)"},{"task_slug":null,"task_name":"Relation"},{"task_slug":"relation-extraction","task_name":"Relation Extraction"}],"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/joint-entity-and-relation-extraction-on","task":"Joint Entity and Relation Extraction","dataset":"SciERC","model":"DyGIE","rank_in_archive_order":7,"of":11,"metrics":{"Cross Sentence":"Yes","Entity F1":"65.2","Relation F1":"41.6"},"uses_additional_data":false},{"leaderboard":"/sota/named-entity-recognition-on-wlpc","task":"Named Entity Recognition (NER)","dataset":"WLPC","model":"DyGIE","rank_in_archive_order":1,"of":2,"metrics":{"F1":"79.5"},"uses_additional_data":false},{"leaderboard":"/sota/relation-extraction-on-ace-2004","task":"Relation Extraction","dataset":"ACE 2004","model":"DyGIE","rank_in_archive_order":11,"of":11,"metrics":{"Cross Sentence":"Yes","NER Micro F1":"87.4","RE Micro F1":"59.7"},"uses_additional_data":false},{"leaderboard":"/sota/relation-extraction-on-ace-2005","task":"Relation Extraction","dataset":"ACE 2005","model":"DyGIE","rank_in_archive_order":10,"of":30,"metrics":{"Cross Sentence":"Yes","NER Micro F1":"88.4","RE Micro F1":"63.2","Sentence Encoder":"ELMo"},"uses_additional_data":true},{"leaderboard":"/sota/relation-extraction-on-wlpc","task":"Relation Extraction","dataset":"WLPC","model":"DyGIE","rank_in_archive_order":2,"of":2,"metrics":{"F1":"64.1"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.03296","atlas_url":"https://app.syntology.ai/?focus=1904.03296","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":"1904.03296"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.03296\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.03296"},"call":"get_concepts_for_paper(arxiv_id=\"1904.03296\")"}],"by_repo":[{"repo":"luanyi/DyGIE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"AndrewSukhobok95/DL_GraphEntity_project","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tricktreat/trimf","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":"b0eacc85cc016122274afda796c4058d372542280d9cdf59f9489f746a9d89c3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}