{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T13:21:59Z","timestamp":1778592119106,"version":"3.51.4"},"reference-count":61,"publisher":"MIT Press","license":[{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"vor","delay-in-days":554,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["direct.mit.edu"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,4,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Lexicalized parsing models are based on the assumptions that (i) constituents are organized around a lexical head and (ii) bilexical statistics are crucial to solve ambiguities. In this paper, we introduce an unlexicalized transition-based parser for discontinuous constituency structures, based on a structure-label transition system and a bi-LSTM scoring system. We compare it with lexicalized parsing models in order to address the question of lexicalization in the context of discontinuous constituency parsing. Our experiments show that unlexicalized models systematically achieve higher results than lexicalized models, and provide additional empirical evidence that lexicalization is not necessary to achieve strong parsing results. Our best unlexicalized model sets a new state of the art on English and German discontinuous constituency treebanks. We further provide a per-phenomenon analysis of its errors on discontinuous constituents.<\/jats:p>","DOI":"10.1162\/tacl_a_00255","type":"journal-article","created":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T19:33:41Z","timestamp":1555443221000},"page":"73-89","update-policy":"https:\/\/doi.org\/10.1162\/mitpressjournals.corrections.policy","source":"Crossref","is-referenced-by-count":4,"title":["Unlexicalized Transition-based Discontinuous Constituency Parsing"],"prefix":"10.1162","volume":"7","author":[{"given":"Maximin","family":"Coavoux","sequence":"first","affiliation":[{"name":"University of Edinburgh, ILCC, United Kingdom. mcoavoux@inf.ed.ac.uk"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beno\u00eet","family":"Crabb\u00e9","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Diderot, Universit\u00e9 Sorbonne Paris Cit\u00e9, LLF, France"},{"name":"Institut Universitaire de France (IUF), France. bcrabbe@linguist.univ-paris-diderot.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shay B.","family":"Cohen","sequence":"additional","affiliation":[{"name":"University of Edinburgh, ILCC, United Kingdom. scohen@inf.ed.ac.uk"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"281","published-online":{"date-parts":[[2019,4,1]]},"reference":[{"key":"2021060823285262300_bib1","unstructured":"Daniel M. Bikel . 2004. A distributional analysis of a lexicalized statistical parsing model. In Proceedings of EMNLP 2004, pages 182\u2013189. Association for Computational Linguistics."},{"key":"2021060823285262300_bib2","unstructured":"Anders Bj\u00f6rkelund , OzlemCetinoglu, Rich\u00e1rdFarkas, ThomasMueller, and WolfgangSeeker.2013. (Re)ranking meets morphosyntax: State- of-the-art results from the SPMRL 2013 shared task. In Proceedings of the Fourth Workshop on Statistical Parsing of Morphologically- Rich Languages, pages 135\u2013145, Seattle, Washington, USA. Association for Computational Linguistics."},{"key":"2021060823285262300_bib3","doi-asserted-by":"crossref","unstructured":"L\u00e9on Bottou . 2010. Large-scale machine learning with stochastic gradient descent. In Proceedings of the 19th International Conference on Computational Statistics (COMPSTAT\u20192010), pages 177\u2013187, Paris, France. Springer.","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"2021060823285262300_bib4","unstructured":"Sabine Brants , StefanieDipper, SilviaHansen, WolfgangLezius, and GeorgeSmith.2002. Tiger treebank. In Proceedings of the Workshop on Treebanks and Linguistic Theories, September 20-21 (TLT02). Sozopol, Bulgaria."},{"key":"2021060823285262300_bib5","unstructured":"Eugene Charniak . 1997. Statistical parsing with a context-free grammar and word statistics. In Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Conference on Innovative Applications of Artificial Intelligence, AAAI\u201997\/IAAI\u201997, pages 598\u2013603. AAAI Press."},{"key":"2021060823285262300_bib6","doi-asserted-by":"crossref","unstructured":"Do Kook Choe and EugeneCharniak.2016. Parsing as language modeling. In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pages 2331\u20132336, Austin, Texas. Association for Computational Linguistics.","DOI":"10.18653\/v1\/D16-1257"},{"key":"2021060823285262300_bib7","doi-asserted-by":"crossref","unstructured":"Maximin Coavoux and BenoitCrabb\u00e9.2017a. Incremental discontinuous phrase structure parsing with the gap transition. In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers, pages 1259\u20131270, Valencia, Spain. Association for Computational Linguistics.","DOI":"10.18653\/v1\/E17-1118"},{"key":"2021060823285262300_bib8","doi-asserted-by":"crossref","unstructured":"Maximin Coavoux and BenoitCrabb\u00e9.2017b. Multilingual lexicalized constituency parsing with word-level auxiliary tasks. In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 2, Short Papers, pages 331\u2013336, Valencia, Spain. Association for Computational Linguistics.","DOI":"10.18653\/v1\/E17-2053"},{"key":"2021060823285262300_bib9","doi-asserted-by":"crossref","unstructured":"Michael Collins . 1997. Three generative, lexicalised models for statistical parsing. In Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics, pages 16\u201323, Madrid, Spain. Association for Computational Linguistics.","DOI":"10.3115\/976909.979620"},{"key":"2021060823285262300_bib10","doi-asserted-by":"crossref","unstructured":"Caio Corro , Joseph LeRoux, and MathieuLacroix.2017. Efficient discontinuous phrase-structure parsing via the generalized maximum spanning arborescence. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pages 1645\u20131655, Copenhagen, Denmark. Association for Computational Linguistics.","DOI":"10.18653\/v1\/D17-1172"},{"key":"2021060823285262300_bib11","unstructured":"Benoit Crabb\u00e9 . 2014. An LR-inspired generalized lexicalized phrase structure parser. In Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers, pages 541\u2013552, Dublin, Ireland. Dublin City University and Association for Computational Linguistics."},{"key":"2021060823285262300_bib12","unstructured":"Andreas van Cranenburgh and RensBod.2013. Discontinuous parsing with an efficient and accurate DOP model. In Proceedings of IWPT, pages 7\u201316."},{"key":"2021060823285262300_bib13","doi-asserted-by":"crossref","unstructured":"Andreas van Cranenburgh , RemkoScha, and RensBod.2016. Data-oriented parsing with discontinuous constituents and function tags. Journal of Language Modelling, 4(1):57\u2013111.","DOI":"10.15398\/jlm.v4i1.100"},{"key":"2021060823285262300_bib14","doi-asserted-by":"crossref","unstructured":"James Cross and LiangHuang.2016a. Incremental parsing with minimal features using bi-directional LSTM. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), pages 32\u201337, Berlin, Germany. Association for Computational Linguistics.","DOI":"10.18653\/v1\/P16-2006"},{"key":"2021060823285262300_bib15","doi-asserted-by":"crossref","unstructured":"James Cross and LiangHuang.2016b. Span-based constituency parsing with a structure-label system and provably optimal dynamic oracles. In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pages 1\u201311, Austin, Texas. Association for Computational Linguistics.","DOI":"10.18653\/v1\/D16-1001"},{"key":"2021060823285262300_bib16","doi-asserted-by":"crossref","unstructured":"Amit Dubey and FrankKeller.2003. Probabilistic parsing for german using sister-head dependencies. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, pages 96\u2013103, Sapporo, Japan. Association for Computational Linguistics.","DOI":"10.3115\/1075096.1075109"},{"key":"2021060823285262300_bib17","doi-asserted-by":"crossref","unstructured":"Greg Durrett and DanKlein.2015. Neural CRF parsing. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 302\u2013312, Beijing, China. Association for Computational Linguistics.","DOI":"10.3115\/v1\/P15-1030"},{"key":"2021060823285262300_bib18","doi-asserted-by":"crossref","unstructured":"Chris Dyer , AdhigunaKuncoro, MiguelBallesteros, and Noah A.Smith.2016. Recurrent neural network grammars. In Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 199\u2013209, San Diego, California. Association for Computational Linguistics.","DOI":"10.18653\/v1\/N16-1024"},{"key":"2021060823285262300_bib19","unstructured":"Kilian Evang . 2011. Parsing discontinuous constituents in English. Ph.D. thesis, Masters thesis, University of T\u00fcbingen."},{"key":"2021060823285262300_bib20","unstructured":"Kilian Evang and LauraKallmeyer.2011. PLCFRS parsing of english discontinuous constituents. In Proceedings of the 12th International Conference on Parsing Technologies, pages 104\u2013116, Dublin, Ireland. Association for Computational Linguistics."},{"key":"2021060823285262300_bib21","doi-asserted-by":"crossref","unstructured":"Daniel Fern\u00e1ndez-Gonz\u00e1lez and Andr\u00e9 F. T.Martins.2015. Parsing as reduction. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 1523\u20131533, Beijing, China. Association for Computational Linguistics.","DOI":"10.3115\/v1\/P15-1147"},{"key":"2021060823285262300_bib22","doi-asserted-by":"crossref","unstructured":"David Gaddy , MitchellStern, and DanKlein.2018. What\u2019s going on in neural constituency parsers? an analysis. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers), pages 999\u20131010, New Orleans, Louisiana. Association for Computational Linguistics.","DOI":"10.18653\/v1\/N18-1091"},{"key":"2021060823285262300_bib23","unstructured":"Kilian Gebhardt . 2018. Generic refinement of expressive grammar formalisms with an application to discontinuous constituent parsing. In Proceedings of the 27th International Conference on Computational Linguistics, pages 3049\u20133063, Santa Fe, New Mexico, USA. Association for Computational Linguistics."},{"key":"2021060823285262300_bib24","unstructured":"Daniel Gildea . 2001. Corpus variation and parser performance. In Proceedings of the 2001 Conference on Empirical Methods in Natural Language Processing, pages 167\u2013202."},{"key":"2021060823285262300_bib25","unstructured":"Ga\u00ebl Guennebaud and Beno\u00eetJacob.2010. Eigen v3. http:\/\/eigen.tuxfamily.org."},{"key":"2021060823285262300_bib26","doi-asserted-by":"crossref","unstructured":"David Hall , GregDurrett, and DanKlein. 2014. Less grammar, more features. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 228\u2013237, Baltimore, Maryland. Association for Computational Linguistics.","DOI":"10.3115\/v1\/P14-1022"},{"key":"2021060823285262300_bib27","doi-asserted-by":"crossref","unstructured":"Johan Hall and JoakimNivre. 2008. Parsing Discontinuous Phrase Structure with Grammatical Functions, Springer Berlin Heidelberg, Berlin, Heidelberg.","DOI":"10.1007\/978-3-540-85287-2_17"},{"key":"2021060823285262300_bib28","unstructured":"Laura Kallmeyer and WolfgangMaier.2010. Data-driven parsing with probabilistic linear context-free rewriting systems. In Proceedings of the 23rd International Conference on Computational Linguistics (Coling 2010), pages 537\u2013545, Beijing, China. Coling 2010 Organizing Committee."},{"key":"2021060823285262300_bib29","doi-asserted-by":"crossref","unstructured":"Eliyahu Kiperwasser and YoavGoldberg. 2016. Simple and accurate dependency parsing using bidirectional LSTM feature representations. Transactions of the Association for Computational Linguistics, 4:313\u2013327.","DOI":"10.1162\/tacl_a_00101"},{"key":"2021060823285262300_bib30","doi-asserted-by":"crossref","unstructured":"Nikita Kitaev and DanKlein.2018. Constituency parsing with a self-attentive encoder. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 2676\u20132686, Melbourne, Australia. Association for Computational Linguistics.","DOI":"10.18653\/v1\/P18-1249"},{"key":"2021060823285262300_bib31","doi-asserted-by":"crossref","unstructured":"Dan Klein and Christopher D.Manning.2003. Accurate unlexicalized parsing. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, pages 423\u2013430, Sapporo, Japan. Association for Computational Linguistics.","DOI":"10.3115\/1075096.1075150"},{"key":"2021060823285262300_bib32","unstructured":"Jonathan K. Kummerfeld , DavidHall, James R.Curran, and DanKlein. 2012. Parser showdown at the wall street corral: An empirical investigation of error types in parser output. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pages 1048\u20131059, Jeju Island, Korea. Association for Computational Linguistics."},{"key":"2021060823285262300_bib33","doi-asserted-by":"crossref","unstructured":"Adhiguna Kuncoro , MiguelBallesteros, LingpengKong, ChrisDyer, GrahamNeubig, and Noah A.Smith.2017. What do recurrent neural network grammars learn about syntax? In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers, pages 1249\u20131258, Valencia, Spain. Association for Computational Linguistics.","DOI":"10.18653\/v1\/E17-1117"},{"key":"2021060823285262300_bib34","doi-asserted-by":"crossref","unstructured":"Tal Linzen , EmmanuelDupoux, and YoavGoldberg.2016. Assessing the ability of lstms to learn syntax-sensitive dependencies. Transactions of the Association of Computational Linguistics, 4:521\u2013535.","DOI":"10.1162\/tacl_a_00115"},{"key":"2021060823285262300_bib35","doi-asserted-by":"crossref","unstructured":"Jiangming Liu and YueZhang. 2017. In-order transition-based constituent parsing. Transactions of the Association for Computational Linguistics, 5:413\u2013424.","DOI":"10.1162\/tacl_a_00070"},{"key":"2021060823285262300_bib36","doi-asserted-by":"crossref","unstructured":"Wolfgang Maier . 2015. Discontinuous incremental shift-reduce parsing. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 1202\u20131212, Beijing, China. Association for Computational Linguistics.","DOI":"10.3115\/v1\/P15-1116"},{"key":"2021060823285262300_bib37","doi-asserted-by":"crossref","unstructured":"Wolfgang Maier and TimmLichte.2016. Discontinuous parsing with continuous trees. In Proceedings of the Workshop on Discontinuous Structures in Natural Language Processing, pages 47\u201357, San Diego, California. Association for Computational Linguistics.","DOI":"10.18653\/v1\/W16-0906"},{"key":"2021060823285262300_bib38","doi-asserted-by":"crossref","unstructured":"Mitchell Marcus , BeatriceSantorini, and Mary AnnMarcinkiewicz. 1993. Building a large annotated corpus of English: The Penn treebank. Computational Linguistics, Volume 19, Number 2, June 1993, Special Issue on Using Large Corpora: II.","DOI":"10.21236\/ADA273556"},{"key":"2021060823285262300_bib39","unstructured":"Marie-Catherine de Marneffe , BillMacCartney, and Christopher D.Manning. 2006. Generating typed dependency parses from phrase structure parses. In Proceedings of the Fifth International Conference on Language Resources and Evaluation (LREC\u201906). European Language Resources Association (ELRA)."},{"key":"2021060823285262300_bib40","doi-asserted-by":"crossref","unstructured":"Takuya Matsuzaki , YusukeMiyao, and Jun\u2019ichiTsujii. 2005. Probabilistic CFG with latent annotations. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL\u201905), pages 75\u201382, Ann Arbor, Michigan. Association for Computational Linguistics.","DOI":"10.3115\/1219840.1219850"},{"key":"2021060823285262300_bib41","unstructured":"Thomas Mueller , HelmutSchmid, and HinrichSch\u00fctze. 2013. Efficient higher-order CRFs for morphological tagging. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, pages 322\u2013332, Seattle, Washington, USA. Association for Computational Linguistics."},{"key":"2021060823285262300_bib42","doi-asserted-by":"crossref","unstructured":"Shashi Narayan and Shay B.Cohen. 2016. Optimizing spectral learning for parsing. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1546\u20131556, Berlin, Germany. Association for Computational Linguistics.","DOI":"10.18653\/v1\/P16-1146"},{"key":"2021060823285262300_bib43","doi-asserted-by":"crossref","unstructured":"Joakim Nivre . 2004. Incrementality in deterministic dependency parsing. In Proceedings of the ACL Workshop Incremental Parsing: Bringing Engineering and Cognition Together, pages 50\u201357, Barcelona, Spain. Association for Computational Linguistics.","DOI":"10.3115\/1613148.1613156"},{"key":"2021060823285262300_bib44","doi-asserted-by":"crossref","unstructured":"Joakim Nivre . 2009. Non-projective dependency parsing in expected linear time. In Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, pages 351\u2013359. Association for Computational Linguistics.","DOI":"10.3115\/1687878.1687929"},{"key":"2021060823285262300_bib45","doi-asserted-by":"crossref","unstructured":"Slav Petrov , LeonBarrett, RomainThibaux, and DanKlein. 2006. Learning accurate, compact, and interpretable tree annotation. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 433\u2013440. Association for Computational Linguistics.","DOI":"10.3115\/1220175.1220230"},{"key":"2021060823285262300_bib46","doi-asserted-by":"crossref","unstructured":"Barbara Plank , AndersS\u00f8gaard, and YoavGoldberg. 2016. Multilingual part-of-speech tagging with bidirectional long short-term memory models and auxiliary loss. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), pages 412\u2013418, Berlin, Germany. Association for Computational Linguistics.","DOI":"10.18653\/v1\/P16-2067"},{"key":"2021060823285262300_bib47","doi-asserted-by":"crossref","unstructured":"Boris T. Polyak and Anatoli B.Juditsky. 1992. Acceleration of stochastic approximation by averaging. SIAM Journal on Control and Optimization, 30(4):838\u2013855.","DOI":"10.1137\/0330046"},{"key":"2021060823285262300_bib48","doi-asserted-by":"crossref","unstructured":"Kenji Sagae and AlonLavie. 2005. A classifier-based parser with linear run-time complexity. In Proceedings of the Ninth International Workshop on Parsing Technology, pages 125\u2013132, Vancouver, British Columbia. Association for Computational Linguistics.","DOI":"10.3115\/1654494.1654507"},{"key":"2021060823285262300_bib49","unstructured":"Djam\u00e9 Seddah , ReutTsarfaty, SandraK\u00fcbler, MarieCandito, Jinho D.Choi, Rich\u00e1rdFarkas, JenniferFoster, IakesGoenaga, Koldo GojenolaGalletebeitia, YoavGoldberg, SpenceGreen, NizarHabash, MarcoKuhlmann, WolfgangMaier, JoakimNivre, AdamPrzepi\u00f3rkowski, RyanRoth, WolfgangSeeker, YannickVersley, VeronikaVincze, MarcinWoli\u0144ski, AlinaWr\u00f3blewska, and EricVillemonte de la Clergerie. 2013. Overview of the SPMRL 2013 shared task: A cross-framework evaluation of parsing mor phologically rich languages. In Proceedings of the Fourth Workshop on Statistical Parsing of Morphologically-Rich Languages, pages 146\u2013182, Seattle, Washington, USA. Association for Computational Linguistics."},{"key":"2021060823285262300_bib50","doi-asserted-by":"crossref","unstructured":"Wojciech Skut , BrigitteKrenn, ThorstenBrants, and HansUszkoreit. 1997. An annotation scheme for free word order languages. In Proceedings of the Fifth Conference on Applied Natural Language Processing, pages 88\u2013pages 95, Washington, DC, USA. Association for Computational Linguistics.","DOI":"10.3115\/974557.974571"},{"key":"2021060823285262300_bib51","doi-asserted-by":"crossref","unstructured":"Anders S\u00f8gaard and YoavGoldberg. 2016. Deep multi-task learning with low level tasks supervised at lower layers. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), pages 231\u2013235, Berlin, Germany. Association for Computational Linguistics.","DOI":"10.18653\/v1\/P16-2038"},{"key":"2021060823285262300_bib52","doi-asserted-by":"crossref","unstructured":"Milo\u0161 Stanojevi\u0107 and Raquel GarridoAlhama. 2017. Neural discontinuous constituency parsing. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pages 1667\u20131677, Copenhagen, Denmark. Association for Computational Linguistics.","DOI":"10.18653\/v1\/D17-1174"},{"key":"2021060823285262300_bib53","doi-asserted-by":"crossref","unstructured":"Mitchell Stern , JacobAndreas, and DanKlein. 2017. A minimal span-based neural constituency parser. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 818\u2013827, Vancouver, Canada. Association for Computational Linguistics.","DOI":"10.18653\/v1\/P17-1076"},{"key":"2021060823285262300_bib54","unstructured":"Yannick Versley . 2014a. Experiments with easy-first nonprojective constituent parsing. In Proceedings of the First Joint Workshop on Statistical Parsing of Morphologically Rich Languages and Syntactic Analysis of Non-Canonical Languages, pages 39\u201353, Dublin, Ireland. Dublin City University."},{"key":"2021060823285262300_bib55","unstructured":"Yannick Versley . 2014b. Incorporating semi- supervised features into discontinuous easy-first constituent parsing. CoRR, abs\/1409. 3813v1."},{"key":"2021060823285262300_bib56","doi-asserted-by":"crossref","unstructured":"Yannick Versley . 2016. Discontinuity (re)2visited: A minimalist approach to pseudoprojective constituent parsing. In Proceedings of the Workshop on Discontinuous Structures in Natural Language Processing, pages 58\u201369, San Diego, California. Association for Computational Linguistics.","DOI":"10.18653\/v1\/W16-0907"},{"key":"2021060823285262300_bib57","doi-asserted-by":"crossref","unstructured":"Zhiguo Wang , HaitaoMi, and NianwenXue. 2015. Feature optimization for constituent parsing via neural networks. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 1138\u20131147, Beijing, China. Association for Computational Linguistics.","DOI":"10.3115\/v1\/P15-1110"},{"key":"2021060823285262300_bib58","doi-asserted-by":"crossref","unstructured":"Taro Watanabe and Eiichiro Sumita. 2015. Transition-based neural constituent parsing. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 1169\u20131179, Beijing, China. Association for Computational Linguistics.","DOI":"10.3115\/v1\/P15-1113"},{"key":"2021060823285262300_bib59","doi-asserted-by":"crossref","unstructured":"Yue Zhang and StephenClark. 2009. Transition-based parsing of the chinese treebank using a global discriminative model. In Proceedings of the 11th International Conference on Parsing Technologies (IWPT\u201909), pages 162\u2013171, Paris, France. Association for Computational Linguistics.","DOI":"10.3115\/1697236.1697267"},{"key":"2021060823285262300_bib60","doi-asserted-by":"crossref","unstructured":"Yue Zhang and StephenClark. 2011. Syntactic processing using the generalized perceptron and beam search. Computational Linguistics, 37(1):105\u2013151.","DOI":"10.1162\/coli_a_00037"},{"key":"2021060823285262300_bib61","unstructured":"Muhua Zhu , YueZhang, WenliangChen, MinZhang, and JingboZhu. 2013. Fast and accurate shift-reduce constituent parsing. In Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 434\u2013443, Sofia, Bulgaria. Association for Computational Linguistics."}],"container-title":["Transactions of the Association for Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/direct.mit.edu\/tacl\/article-pdf\/doi\/10.1162\/tacl_a_00255\/1923183\/tacl_a_00255.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/direct.mit.edu\/tacl\/article-pdf\/doi\/10.1162\/tacl_a_00255\/1923183\/tacl_a_00255.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T20:15:27Z","timestamp":1694808927000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/tacl\/article\/doi\/10.1162\/tacl_a_00255\/43496\/Unlexicalized-Transition-based-Discontinuous"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,1]]},"references-count":61,"URL":"https:\/\/doi.org\/10.1162\/tacl_a_00255","relation":{},"ISSN":["2307-387X"],"issn-type":[{"value":"2307-387X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2019,4]]},"published":{"date-parts":[[2019,4,1]]}}}