{"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/universal-dependency-parsing-from-scratch","title":"Universal Dependency Parsing from Scratch","arxiv_id":"1901.10457","date":"2019-01-29","proceeding":"CONLL 2018 10","authors":["Peng Qi","Timothy Dozat","Yuhao Zhang","Christopher D. Manning"],"abstract":"This paper describes Stanford's system at the CoNLL 2018 UD Shared Task. We\nintroduce a complete neural pipeline system that takes raw text as input, and\nperforms all tasks required by the shared task, ranging from tokenization and\nsentence segmentation, to POS tagging and dependency parsing. Our single system\nsubmission achieved very competitive performance on big treebanks. Moreover,\nafter fixing an unfortunate bug, our corrected system would have placed the\n2nd, 1st, and 3rd on the official evaluation metrics LAS,MLAS, and BLEX, and\nwould have outperformed all submission systems on low-resource treebank\ncategories on all metrics by a large margin. We further show the effectiveness\nof different model components through extensive ablation studies.","url_abs":"http://arxiv.org/abs/1901.10457v1","url_pdf":"http://arxiv.org/pdf/1901.10457v1.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":"universal-dependency-parsing-from-scratch","repo_url":"https://github.com/stanfordnlp/stanfordnlp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"all","task_name":"All"},{"task_slug":"dependency-parsing","task_name":"Dependency Parsing"},{"task_slug":"pos","task_name":"POS"},{"task_slug":"pos-tagging","task_name":"POS Tagging"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"sentence-segmentation","task_name":"Sentence segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/dependency-parsing-on-universal-dependencies","task":"Dependency Parsing","dataset":"Universal Dependencies","model":"Stanford+","rank_in_archive_order":4,"of":6,"metrics":{"BLEX":"65.28","LAS":"74.16","UAS":"62.08"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.10457","atlas_url":"https://app.syntology.ai/?focus=1901.10457","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":"1901.10457"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.10457\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.10457"},"call":"get_concepts_for_paper(arxiv_id=\"1901.10457\")"}],"by_repo":[{"repo":"stanfordnlp/stanfordnlp","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":"6ed29549532cedb3cdeeb8d22df331d940675e7bf1ddbfa0c75ddd7f6481d21f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}