{"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/recursive-subtree-composition-in-lstm-based","title":"Recursive Subtree Composition in LSTM-Based Dependency Parsing","arxiv_id":"1902.09781","date":"2019-02-26","proceeding":"NAACL 2019 6","authors":["Miryam de Lhoneux","Miguel Ballesteros","Joakim Nivre"],"abstract":"The need for tree structure modelling on top of sequence modelling is an open\nissue in neural dependency parsing. We investigate the impact of adding a tree\nlayer on top of a sequential model by recursively composing subtree\nrepresentations (composition) in a transition-based parser that uses features\nextracted by a BiLSTM. Composition seems superfluous with such a model,\nsuggesting that BiLSTMs capture information about subtrees. We perform model\nablations to tease out the conditions under which composition helps. When\nablating the backward LSTM, performance drops and composition does not recover\nmuch of the gap. When ablating the forward LSTM, performance drops less\ndramatically and composition recovers a substantial part of the gap, indicating\nthat a forward LSTM and composition capture similar information. We take the\nbackward LSTM to be related to lookahead features and the forward LSTM to the\nrich history-based features both crucial for transition-based parsers. To\ncapture history-based information, composition is better than a forward LSTM on\nits own, but it is even better to have a forward LSTM as part of a BiLSTM. We\ncorrelate results with language properties, showing that the improved lookahead\nof a backward LSTM is especially important for head-final languages.","url_abs":"http://arxiv.org/abs/1902.09781v1","url_pdf":"http://arxiv.org/pdf/1902.09781v1.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":"recursive-subtree-composition-in-lstm-based","repo_url":"https://github.com/mdelhoneux/uuparser-composition","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"dependency-parsing","task_name":"Dependency Parsing"}],"methods":[{"method_slug":"bilstm","method_name":"BiLSTM"},{"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":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.09781","atlas_url":"https://app.syntology.ai/?focus=1902.09781","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":"1902.09781"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.09781\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.09781"},"call":"get_concepts_for_paper(arxiv_id=\"1902.09781\")"}],"by_repo":[{"repo":"mdelhoneux/uuparser-composition","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":"40eebc88dc48aea8973181b03712b1b64afd74e83be0276f1261a62322b71a7c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}