{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:42:35Z","timestamp":1648896155194},"reference-count":7,"publisher":"MIT Press - Journals","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["TACL"],"published-print":{"date-parts":[[2017,12]]},"abstract":"<jats:p> General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible enough to cover almost all treebank structures, while still admitting efficient learning and inference. In particular, we consider directed, acyclic, one-endpoint-crossing graph structures, which cover most long-distance dislocation, shared argumentation, and similar tree-violating linguistic phenomena. We describe how to convert phrase structure parses, including traces, to our new representation in a reversible manner. Our dynamic program uniquely decomposes structures, is sound and complete, and covers 97.3% of the Penn English Treebank. We also implement a proof-of-concept parser that recovers a range of null elements and trace types. <\/jats:p>","DOI":"10.1162\/tacl_a_00072","type":"journal-article","created":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T15:42:50Z","timestamp":1546011770000},"page":"441-454","source":"Crossref","is-referenced-by-count":1,"title":["Parsing with Traces: An <i>O<\/i>(<i>n<\/i><sup>4<\/sup>) Algorithm and a Structural                     Representation"],"prefix":"10.1162","volume":"5","author":[{"given":"Jonathan K.","family":"Kummerfeld","sequence":"first","affiliation":[{"name":"Computer Science Division, University of California, Berkeley, Berkeley, CA                         94720, USA,"}]},{"given":"Dan","family":"Klein","sequence":"additional","affiliation":[{"name":"Computer Science Division, University of California, Berkeley, Berkeley, CA                         94720, USA,"}]}],"member":"281","reference":[{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1162\/coli.2007.33.2.201"},{"key":"p_33","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00186"},{"issue":"2","key":"p_34","first-page":"313","volume":"19","author":"Marcus Mitchell P.","year":"1993","journal-title":"Computational Linguistics"},{"key":"p_37","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00164"},{"key":"p_38","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00206"},{"issue":"1","key":"p_42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10579-007-9043-7","volume":"42","author":"Shen Libin","year":"2007","journal-title":"Language Resources and Evaluation"},{"issue":"2","key":"p_44","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","volume":"10","author":"Younger Daniel H.","year":"1967","journal-title":"Information and Control"}],"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_00072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:38:15Z","timestamp":1615585095000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/tacl\/article\/43414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":7,"alternative-id":["10.1162\/tacl_a_00072"],"URL":"https:\/\/doi.org\/10.1162\/tacl_a_00072","relation":{},"ISSN":["2307-387X"],"issn-type":[{"value":"2307-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}