{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T18:32:36Z","timestamp":1774117956748,"version":"3.50.1"},"reference-count":2,"publisher":"MIT Press - Journals","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["TACL"],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p> This paper proposes a discriminative forest reranking algorithm for dependency parsing that can be seen as a form of efficient stacked parsing. A dynamic programming shift-reduce parser produces a packed derivation forest which is then scored by a discriminative reranker, using the 1-best tree output by the shift-reduce parser as guide features in addition to third-order graph-based features. To improve efficiency and accuracy, this paper also proposes a novel shift-reduce parser that eliminates the spurious ambiguity of arc-standard transition systems. Testing on the English Penn Treebank data, forest reranking gave a state-of-the-art unlabeled dependency accuracy of 93.12. <\/jats:p>","DOI":"10.1162\/tacl_a_00216","type":"journal-article","created":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T15:42:12Z","timestamp":1546011732000},"page":"139-150","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Stacked Dependency Parsing by Forest                     Reranking"],"prefix":"10.1162","volume":"1","author":[{"given":"Katsuhiko","family":"Hayashi","sequence":"first","affiliation":[{"name":"Graduate School of Information Science Nara Institute of Science and                         Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhei","family":"Kondo","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science Nara Institute of Science and                         Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuji","family":"Matsumoto","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science Nara Institute of Science and                         Technology, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan,"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"281","reference":[{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1162\/coli.07-056-R1-07-027"},{"issue":"1","key":"p_30","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0743-1066(95)00035-I","volume":"24","author":"Shieber S. M.","year":"1995","journal-title":"J. Log. Program."}],"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_00216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:39:07Z","timestamp":1615585147000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/tacl\/article\/43200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":2,"alternative-id":["10.1162\/tacl_a_00216"],"URL":"https:\/\/doi.org\/10.1162\/tacl_a_00216","relation":{},"ISSN":["2307-387X"],"issn-type":[{"value":"2307-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}