{"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/in-order-transition-based-constituent-parsing","title":"In-Order Transition-based Constituent Parsing","arxiv_id":"1707.05000","date":"2017-07-17","proceeding":"TACL 2017 1","authors":["Jiangming Liu","Yue Zhang"],"abstract":"Both bottom-up and top-down strategies have been used for neural\ntransition-based constituent parsing. The parsing strategies differ in terms of\nthe order in which they recognize productions in the derivation tree, where\nbottom-up strategies and top-down strategies take post-order and pre-order\ntraversal over trees, respectively. Bottom-up parsers benefit from rich\nfeatures from readily built partial parses, but lack lookahead guidance in the\nparsing process; top-down parsers benefit from non-local guidance for local\ndecisions, but rely on a strong encoder over the input to predict a constituent\nhierarchy before its construction.To mitigate both issues, we propose a novel\nparsing system based on in-order traversal over syntactic trees, designing a\nset of transition actions to find a compromise between bottom-up constituent\ninformation and top-down lookahead information. Based on stack-LSTM, our\npsycholinguistically motivated constituent parsing system achieves 91.8 F1 on\nWSJ benchmark. Furthermore, the system achieves 93.6 F1 with supervised\nreranking and 94.2 F1 with semi-supervised reranking, which are the best\nresults on the WSJ benchmark.","url_abs":"http://arxiv.org/abs/1707.05000v1","url_pdf":"http://arxiv.org/pdf/1707.05000v1.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":"in-order-transition-based-constituent-parsing","repo_url":"https://github.com/LeonCrashCode/InOrderParser","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"in-order-transition-based-constituent-parsing","repo_url":"https://github.com/hantek/distance-parser","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"reranking","task_name":"Reranking"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/constituency-parsing-on-penn-treebank","task":"Constituency Parsing","dataset":"Penn Treebank","model":"In-order","rank_in_archive_order":19,"of":27,"metrics":{"F1 score":"94.2"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1707.05000","atlas_url":"https://app.syntology.ai/?focus=1707.05000","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":"1707.05000"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1707.05000\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1707.05000"},"call":"get_concepts_for_paper(arxiv_id=\"1707.05000\")"}],"by_repo":[{"repo":"LeonCrashCode/InOrderParser","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"hantek/distance-parser","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":"158987068419a073f50e1e7588f88c75c0bc9bd1bf538988d023c333dbc29559","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}