{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:37:01Z","timestamp":1742913421959,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662538258"},{"type":"electronic","value":"9783662538265"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T00:00:00Z","timestamp":1478736000000},"content-version":"vor","delay-in-days":314,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Current chart-based parsers of Minimalist Grammars exhibit prohibitively high polynomial complexity that makes them unusable in practice. This paper presents a transition-based parser for Minimalist Grammars that approximately searches through the space of possible derivations by means of beam search, and does so very efficiently: the worst case complexity of building one derivation is <jats:inline-formula><jats:alternatives><jats:tex-math>$$O(n^2)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msup>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msup>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and the best case complexity is <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic>). This approximated inference can be guided by a trained probabilistic model that can condition on larger context than standard chart-based parsers. The transitions of the parser are very similar to the transitions of bottom-up shift-reduce parsers for Context-Free Grammars, with additional transitions for online reordering of words during parsing in order to make non-projective derivations projective.<\/jats:p>","DOI":"10.1007\/978-3-662-53826-5_17","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T11:59:48Z","timestamp":1478692788000},"page":"273-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Minimalist Grammar Transition-Based Parsing"],"prefix":"10.1007","author":[{"given":"Milo\u0161","family":"Stanojevi\u0107","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199243709.001.0001","volume-title":"Core Syntax: a Minimalist Approach","author":"D Adger","year":"2003","unstructured":"Adger, D.: Core Syntax: a Minimalist Approach, vol. 33. Oxford University Press, Oxford (2003)"},{"doi-asserted-by":"crossref","unstructured":"Ambati, B.R., Deoskar, T., Johnson, M., Steedman, M.: An incremental algorithm for transition-based CCG parsing. In: Proceedings of 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Association for Computational Linguistics (2015)","key":"17_CR2","DOI":"10.3115\/v1\/N15-1006"},{"key":"17_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9783112316009","volume-title":"Syntactic Structures","author":"N Chomsky","year":"1957","unstructured":"Chomsky, N.: Syntactic Structures. Mouton & Co., The Hague (1957)"},{"key":"17_CR4","volume-title":"The Minimalist Program","author":"N Chomsky","year":"1995","unstructured":"Chomsky, N.: The Minimalist Program, vol. 1765. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1111\/synt.12117","volume":"19","author":"C Collins","year":"2016","unstructured":"Collins, C., Stabler, E.: A formalization of minimalist syntax. Syntax 19(1), 43\u201378 (2016)","journal-title":"Syntax"},{"key":"17_CR6","series-title":"Text, Speech and Language Technology","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/1-4020-2295-6_12","volume-title":"New Developments in Parsing Technology","author":"H Harkema","year":"2005","unstructured":"Harkema, H.: A recognizer for minimalist languages. In: Bunt, H., Carroll, J., Satta, G. (eds.) New Developments in Parsing Technology. TSLT, vol. 23, pp. 251\u2013268. Springer, Dordrecht (2005)"},{"unstructured":"Hunter, T., Dyer, C.: Distributions on Minimalist Grammar derivations. In: Proceedings of 13th Meeting on the Mathematics of Language (MoL 2013), pp. 1\u201311. Association for Computational Linguistics, Sofia, August 2013","key":"17_CR7"},{"doi-asserted-by":"crossref","unstructured":"Maier, W.: Discontinuous incremental shift-reduce parsing. In: Proceedings of 53rd ACL (Long Papers), vol. 1, pp. 1202\u20131212. Association for Computational Linguistics, Beijing, July 2015","key":"17_CR8","DOI":"10.3115\/v1\/P15-1116"},{"unstructured":"Mainguy, T.: A probabilistic top-down parser for Minimalist Grammars (2010). CoRR arXiv:abs\/1010.1826","key":"17_CR9"},{"doi-asserted-by":"crossref","unstructured":"Mi, H., Huang, L.: Shift-reduce constituency parsing with dynamic programming and POS tag Lattice. In: Proceedings of 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 1030\u20131035. Association for Computational Linguistics, Denver, May\u2013June 2015","key":"17_CR10","DOI":"10.3115\/v1\/N15-1108"},{"doi-asserted-by":"crossref","unstructured":"Nivre, J.: Non-projective dependency parsing in expected linear time. In: Proceedings of Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, pp. 351\u2013359 (2009)","key":"17_CR11","DOI":"10.3115\/1687878.1687929"},{"doi-asserted-by":"crossref","unstructured":"Sagae, K., Lavie, A.: A classifier-based parser with linear run-time complexity. In: Proceedings of 9th International Workshop on Parsing Technology, Parsing 2005, pp. 125\u2013132. Association for Computational Linguistics., Stroudsburg (2005)","key":"17_CR12","DOI":"10.3115\/1654494.1654507"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0743-1066(95)00035-I","volume":"24","author":"SM Shieber","year":"1995","unstructured":"Shieber, S.M., Schabes, Y., Pereira, F.C.N.: Principles and implementation of deductive parsing. J. Log. Program. 24, 3\u201336 (1995)","journal-title":"J. Log. Program."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0052152","volume-title":"Logical Aspects of Computational Linguistics","author":"E Stabler","year":"1997","unstructured":"Stabler, E.: Derivational minimalism. In: Retor\u00e9, C. (ed.) LACL 1996. LNCS, vol. 1328, pp. 68\u201395. Springer, Heidelberg (1997). doi:10.1007\/BFb0052152"},{"unstructured":"Stabler, E.: Top-down recognizers for MCFGs and MGs. In: Proceedings of 2nd Workshop on Cognitive Modeling and Computational Linguistics, pp. 39\u201348. Association for Computational Linguistics, Portland, June 2011","key":"17_CR15"},{"key":"17_CR16","first-page":"389","volume-title":"Linguistic Form and Its Computation","author":"EP Stabler","year":"2001","unstructured":"Stabler, E.P.: Minimalist Grammars and recognition. In: Rohrer, C., Rossdeutscher, A., Kamp, H. (eds.) Linguistic Form and Its Computation, pp. 389\u2013440. CSLI Publications, Stanford (2001)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-48199-0_15","volume-title":"Logical Aspects of Computational Linguistics","author":"EP Stabler","year":"2001","unstructured":"Stabler, E.P.: Recognizing head movement. In: de Groote, P., Morrill, G., Retor\u00e9, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, pp. 245\u2013260. Springer, Heidelberg (2001). doi:10.1007\/3-540-48199-0_15"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0304-3975(01)00351-6","volume":"29","author":"EP Stabler","year":"2003","unstructured":"Stabler, E.P., Keenan, E.L.: Structural similarity within and among languages. Theoret. Comput. Sci. 29, 345\u2013363 (2003). Algebraic Methods in Language Processing","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Titov, I., Henderson, J., Merlo, P., Musillo, G.: Online graph planarisation for synchronous parsing of semantic and syntactic dependencies. In: Proceedings of 21st International Joint Conference on Artifical Intelligence, IJCAI 2009 (2009)","key":"17_CR19","DOI":"10.3115\/1596324.1596354"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1162\/coli_a_00037","volume":"37","author":"Y Zhang","year":"2011","unstructured":"Zhang, Y., Clark, S.: Syntactic processing using the generalized perceptron and beam search. Comput. Linguist. 37(1), 105\u2013151 (2011)","journal-title":"Comput. Linguist."}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996\u20132016)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53826-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:23:25Z","timestamp":1709821405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-53826-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662538258","9783662538265"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53826-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"10 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LACL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logical Aspects of Computational Linguistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lacl2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lacl.gforge.inria.fr\/lacl-2016\/index-presentation.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}