{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T20:33:01Z","timestamp":1780950781948,"version":"3.54.1"},"reference-count":3,"publisher":"MIT Press - Journals","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["TACL"],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p> Head splitting techniques have been successfully exploited to improve the asymptotic runtime of parsing algorithms for projective dependency trees, under the arc-factored model. In this article we extend these techniques to a class of non-projective dependency trees, called well-nested dependency trees with block-degree at most 2, which has been previously investigated in the literature. We define a structural property that allows head splitting for these trees, and present two algorithms that improve over the runtime of existing algorithms at no significant loss in coverage. <\/jats:p>","DOI":"10.1162\/tacl_a_00226","type":"journal-article","created":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T15:42:12Z","timestamp":1546011732000},"page":"267-278","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Parsing for Head-Split Dependency Trees"],"prefix":"10.1162","volume":"1","author":[{"given":"Giorgio","family":"Satta","sequence":"first","affiliation":[{"name":"Dept. of Information Engineering, University of Padua, Italy,"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Kuhlmann","sequence":"additional","affiliation":[{"name":"Dept. of Linguistics and Philology, Uppsala University, Sweden,"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"281","reference":[{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1162\/COLI_a_00060"},{"key":"p_16","author":"Pitler Emily","year":"2013","journal-title":"Transactions of the Association for Computational Linguistics."},{"issue":"1","key":"p_18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0743-1066(95)00035-I","volume":"24","author":"Shieber Stuart M.","year":"1995","journal-title":"Journal of Logic Programming"}],"container-title":["Transactions of the Association for Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/tacl_a_00226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:39:10Z","timestamp":1615585150000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/tacl\/article\/43212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":3,"alternative-id":["10.1162\/tacl_a_00226"],"URL":"https:\/\/doi.org\/10.1162\/tacl_a_00226","relation":{},"ISSN":["2307-387X"],"issn-type":[{"value":"2307-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}