{"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/dragnn-a-transition-based-framework-for","title":"DRAGNN: A Transition-based Framework for Dynamically Connected Neural Networks","arxiv_id":"1703.04474","date":"2017-03-13","proceeding":null,"authors":["Lingpeng Kong","Chris Alberti","Daniel Andor","Ivan Bogatyy","David Weiss"],"abstract":"In this work, we present a compact, modular framework for constructing novel\nrecurrent neural architectures. Our basic module is a new generic unit, the\nTransition Based Recurrent Unit (TBRU). In addition to hidden layer\nactivations, TBRUs have discrete state dynamics that allow network connections\nto be built dynamically as a function of intermediate activations. By\nconnecting multiple TBRUs, we can extend and combine commonly used\narchitectures such as sequence-to-sequence, attention mechanisms, and\nre-cursive tree-structured models. A TBRU can also serve as both an encoder for\ndownstream tasks and as a decoder for its own task simultaneously, resulting in\nmore accurate multi-task learning. We call our approach Dynamic Recurrent\nAcyclic Graphical Neural Networks, or DRAGNN. We show that DRAGNN is\nsignificantly more accurate and efficient than seq2seq with attention for\nsyntactic dependency parsing and yields more accurate multi-task learning for\nextractive summarization tasks.","url_abs":"http://arxiv.org/abs/1703.04474v1","url_pdf":"http://arxiv.org/pdf/1703.04474v1.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":"dragnn-a-transition-based-framework-for","repo_url":"https://github.com/tensorflow/models/tree/master/research/syntaxnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"dependency-parsing","task_name":"Dependency Parsing"},{"task_slug":"extractive-summarization","task_name":"Extractive Summarization"},{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"seq2seq","method_name":"Seq2Seq"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.04474","atlas_url":"https://app.syntology.ai/?focus=1703.04474","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":"1703.04474"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.04474\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.04474"},"call":"get_concepts_for_paper(arxiv_id=\"1703.04474\")"}],"by_repo":[{"repo":"tensorflow/models","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1502.03167","1512.03385","1605.07146","1704.04861"],"harvested_for_calls":[{"arxiv_id":"1502.03167","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1502.03167"},"call":"get_harvested_code_for_paper(arxiv_id=\"1502.03167\")"},{"arxiv_id":"1512.03385","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1512.03385"},"call":"get_harvested_code_for_paper(arxiv_id=\"1512.03385\")"},{"arxiv_id":"1605.07146","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1605.07146"},"call":"get_harvested_code_for_paper(arxiv_id=\"1605.07146\")"},{"arxiv_id":"1704.04861","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.04861"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.04861\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"cd42338e694e28508b0987076ecbdf524a5cf138b1ce237537ed02598e0016a5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}