{"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/top-down-tree-long-short-term-memory-networks","title":"Top-down Tree Long Short-Term Memory Networks","arxiv_id":"1511.00060","date":"2015-10-31","proceeding":"NAACL 2016 6","authors":["Xingxing Zhang","Liang Lu","Mirella Lapata"],"abstract":"Long Short-Term Memory (LSTM) networks, a type of recurrent neural network\nwith a more complex computational unit, have been successfully applied to a\nvariety of sequence modeling tasks. In this paper we develop Tree Long\nShort-Term Memory (TreeLSTM), a neural network model based on LSTM, which is\ndesigned to predict a tree rather than a linear sequence. TreeLSTM defines the\nprobability of a sentence by estimating the generation probability of its\ndependency tree. At each time step, a node is generated based on the\nrepresentation of the generated sub-tree. We further enhance the modeling power\nof TreeLSTM by explicitly representing the correlations between left and right\ndependents. Application of our model to the MSR sentence completion challenge\nachieves results beyond the current state of the art. We also report results on\ndependency parsing reranking achieving competitive performance.","url_abs":"http://arxiv.org/abs/1511.00060v3","url_pdf":"http://arxiv.org/pdf/1511.00060v3.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":"top-down-tree-long-short-term-memory-networks","repo_url":"https://github.com/XingxingZhang/td-treelstm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"torch","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"dependency-parsing","task_name":"Dependency Parsing"},{"task_slug":"reranking","task_name":"Reranking"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"sentence-completion","task_name":"Sentence Completion"}],"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":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1511.00060","atlas_url":"https://app.syntology.ai/?focus=1511.00060","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":"1511.00060"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1511.00060\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1511.00060"},"call":"get_concepts_for_paper(arxiv_id=\"1511.00060\")"}],"by_repo":[{"repo":"XingxingZhang/td-treelstm","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":"7a48a8af095fc837ab36058c7f07c3b5c44795f5c74440b671e57b1d84edecce","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}