{"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/left-to-right-dependency-parsing-with-pointer","title":"Left-to-Right Dependency Parsing with Pointer Networks","arxiv_id":"1903.08445","date":"2019-03-20","proceeding":null,"authors":["Daniel Fernández-González","Carlos Gómez-Rodríguez"],"abstract":"We propose a novel transition-based algorithm that straightforwardly parses\nsentences from left to right by building $n$ attachments, with $n$ being the\nlength of the input sentence. Similarly to the recent stack-pointer parser by\nMa et al. (2018), we use the pointer network framework that, given a word, can\ndirectly point to a position from the sentence. However, our left-to-right\napproach is simpler than the original top-down stack-pointer parser (not\nrequiring a stack) and reduces transition sequence length in half, from 2$n$-1\nactions to $n$. This results in a quadratic non-projective parser that runs\ntwice as fast as the original while achieving the best accuracy to date on the\nEnglish PTB dataset (96.04% UAS, 94.43% LAS) among fully-supervised\nsingle-model dependency parsers, and improves over the former top-down\ntransition system in the majority of languages tested.","url_abs":"http://arxiv.org/abs/1903.08445v1","url_pdf":"http://arxiv.org/pdf/1903.08445v1.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":"left-to-right-dependency-parsing-with-pointer","repo_url":"https://github.com/danifg/Left2Right-Pointer-Parser","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"left-to-right-dependency-parsing-with-pointer","repo_url":"https://github.com/danifg/SyntacticPointer","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"dependency-parsing","task_name":"Dependency Parsing"},{"task_slug":"sentence","task_name":"Sentence"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"pointer-net","method_name":"Pointer Network"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/dependency-parsing-on-penn-treebank","task":"Dependency Parsing","dataset":"Penn Treebank","model":"Left-to-Right Pointer Network","rank_in_archive_order":11,"of":22,"metrics":{"LAS":"94.43","UAS":"96.04"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.08445","atlas_url":"https://app.syntology.ai/?focus=1903.08445","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":"1903.08445"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.08445\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.08445"},"call":"get_concepts_for_paper(arxiv_id=\"1903.08445\")"}],"by_repo":[{"repo":"danifg/Left2Right-Pointer-Parser","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"danifg/SyntacticPointer","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":"d1b49c855e5da02efa4723526f2a27886ce996f505326ab7457bfddd0704a880","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}