{"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/unlexicalized-transition-based-discontinuous","title":"Unlexicalized Transition-based Discontinuous Constituency Parsing","arxiv_id":"1902.08912","date":"2019-02-24","proceeding":"TACL 2019 3","authors":["Maximin Coavoux","Benoît Crabbé","Shay B. Cohen"],"abstract":"Lexicalized parsing models are based on the assumptions that (i) constituents\nare organized around a lexical head (ii) bilexical statistics are crucial to\nsolve ambiguities. In this paper, we introduce an unlexicalized\ntransition-based parser for discontinuous constituency structures, based on a\nstructure-label transition system and a bi-LSTM scoring system. We compare it\nto lexicalized parsing models in order to address the question of\nlexicalization in the context of discontinuous constituency parsing. Our\nexperiments show that unlexicalized models systematically achieve higher\nresults than lexicalized models, and provide additional empirical evidence that\nlexicalization is not necessary to achieve strong parsing results. Our best\nunlexicalized model sets a new state of the art on English and German\ndiscontinuous constituency treebanks. We further provide a per-phenomenon\nanalysis of its errors on discontinuous constituents.","url_abs":"http://arxiv.org/abs/1902.08912v1","url_pdf":"http://arxiv.org/pdf/1902.08912v1.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":"unlexicalized-transition-based-discontinuous","repo_url":"https://github.com/mcoavoux/mtg_TACL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"constituency-parsing","task_name":"Constituency Parsing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.08912","atlas_url":"https://app.syntology.ai/?focus=1902.08912","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":"1902.08912"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.08912\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.08912"},"call":"get_concepts_for_paper(arxiv_id=\"1902.08912\")"}],"by_repo":[{"repo":"mcoavoux/mtg_TACL","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":"bcedf41c5ca3b46ad756e0d55b207184945bc8ad3bdbc05aed13e9162663ee5d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}