{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T13:10:13Z","timestamp":1762607413079},"reference-count":5,"publisher":"MIT Press - Journals","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["TACL"],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p> Dependency parsing algorithms capable of producing the types of crossing dependencies seen in natural language sentences have traditionally been orders of magnitude slower than algorithms for projective trees. For 95.8\u201399.8% of dependency parses in various natural language treebanks, whenever an edge is crossed, the edges that cross it all have a common vertex. The optimal dependency tree that satisfies this 1-Endpoint-Crossing property can be found with an O( n<jats:sup>4<\/jats:sup>) parsing algorithm that recursively combines forests over intervals with one exterior point. 1-Endpoint-Crossing trees also have natural connections to linguistics and another class of graphs that has been studied in NLP. <\/jats:p>","DOI":"10.1162\/tacl_a_00206","type":"journal-article","created":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T15:42:12Z","timestamp":1546011732000},"page":"13-24","source":"Crossref","is-referenced-by-count":15,"title":["Finding Optimal 1-Endpoint-Crossing Trees"],"prefix":"10.1162","volume":"1","author":[{"given":"Emily","family":"Pitler","sequence":"first","affiliation":[{"name":"Computer and Information Science, University of Pennsylvania, Philadelphia,                         PA 19104,"}]},{"given":"Sampath","family":"Kannan","sequence":"additional","affiliation":[{"name":"Computer and Information Science, University of Pennsylvania, Philadelphia,                         PA 19104,"}]},{"given":"Mitchell","family":"Marcus","sequence":"additional","affiliation":[{"name":"Computer and Information Science, University of Pennsylvania, Philadelphia,                         PA 19104,"}]}],"member":"281","reference":[{"issue":"4","key":"p_1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1080\/01690968608404677","volume":"1","author":"Bach E.","year":"1986","journal-title":"Language and Cognitive Processes"},{"issue":"3","key":"p_2","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"Bernhart F.","year":"1979","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"p_7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"Chung F.","year":"1987","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1162\/COLI_a_00060"},{"issue":"3","key":"p_23","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00630917","volume":"8","author":"Shieber S.M.","year":"1985","journal-title":"Linguistics and Philosophy"}],"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_00206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:39:03Z","timestamp":1615585143000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/tacl\/article\/43197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":5,"alternative-id":["10.1162\/tacl_a_00206"],"URL":"https:\/\/doi.org\/10.1162\/tacl_a_00206","relation":{},"ISSN":["2307-387X"],"issn-type":[{"value":"2307-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}