{"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/a-non-projective-greedy-dependency-parser","title":"A non-projective greedy dependency parser with bidirectional LSTMs","arxiv_id":"1707.03228","date":"2017-07-11","proceeding":"CONLL 2017 8","authors":["David Vilares","Carlos Gómez-Rodríguez"],"abstract":"The LyS-FASTPARSE team presents BIST-COVINGTON, a neural implementation of\nthe Covington (2001) algorithm for non-projective dependency parsing. The\nbidirectional LSTM approach by Kipperwasser and Goldberg (2016) is used to\ntrain a greedy parser with a dynamic oracle to mitigate error propagation. The\nmodel participated in the CoNLL 2017 UD Shared Task. In spite of not using any\nensemble methods and using the baseline segmentation and PoS tagging, the\nparser obtained good results on both macro-average LAS and UAS in the big\ntreebanks category (55 languages), ranking 7th out of 33 teams. In the all\ntreebanks category (LAS and UAS) we ranked 16th and 12th. The gap between the\nall and big categories is mainly due to the poor performance on four parallel\nPUD treebanks, suggesting that some `suffixed' treebanks (e.g. Spanish-AnCora)\nperform poorly on cross-treebank settings, which does not occur with the\ncorresponding `unsuffixed' treebank (e.g. Spanish). By changing that, we obtain\nthe 11th best LAS among all runs (official and unofficial). The code is made\navailable at https://github.com/CoNLL-UD-2017/LyS-FASTPARSE","url_abs":"http://arxiv.org/abs/1707.03228v1","url_pdf":"http://arxiv.org/pdf/1707.03228v1.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":"a-non-projective-greedy-dependency-parser","repo_url":"https://github.com/CoNLL-UD-2017/LyS-FASTPARSE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"dependency-parsing","task_name":"Dependency Parsing"},{"task_slug":"pos","task_name":"POS"},{"task_slug":"pos-tagging","task_name":"POS Tagging"}],"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":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"CoNLL-UD-2017/LyS-FASTPARSE","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":"987791ad501217e8af8bfc06231b8388c6c6f08cce1dbe94cf90da4a48cac952","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}