{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:11:06Z","timestamp":1725743466683},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642399978"},{"type":"electronic","value":"9783642399985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39998-5_4","type":"book-chapter","created":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T21:59:20Z","timestamp":1375135160000},"page":"52-68","source":"Crossref","is-referenced-by-count":0,"title":["Parsing Pregroup Grammars with Letter Promotions in Polynomial Time"],"prefix":"10.1007","author":[{"given":"Katarzyna","family":"Moroz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-48199-0_6","volume-title":"Logical Aspects of Computational Linguistics","author":"W. Buszkowski","year":"2001","unstructured":"Buszkowski, W.: Lambek Grammars Based on Pregroups. In: de Groote, P., Morrill, G., Retor\u00e9, C. (eds.) LACL 2001. LNCS (LNAI), vol.\u00a02099, pp. 95\u2013109. Springer, Heidelberg (2001)"},{"key":"4_CR2","unstructured":"Buszkowski, W., Moroz, K.: Pregroup grammars and context-free grammars. In: Casadio, C., Lambek, J. (eds.) Computational Algebraic Approaches to Natural Language, Polimetrica, pp. 1\u201321 (2008)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-13089-2_11","volume-title":"Language and Automata Theory and Applications","author":"W. Buszkowski","year":"2010","unstructured":"Buszkowski, W., Lin, Z.: Pregroup Grammars with Letter Promotions. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 130\u2013141. Springer, Heidelberg (2010)"},{"issue":"6","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.jcss.2011.12.010","volume":"78","author":"W. Buszkowski","year":"2012","unstructured":"Buszkowski, W., Lin, Z., Moroz, K.: Pregroup Grammars with Letter Promotions: Complexity and Context-Freeness. Journal of Computer and System Sciences\u00a078(6), 1899\u20131909 (2012)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48975-4_1","volume-title":"Logical Aspects of Computational Linguistics","author":"J. Lambek","year":"1999","unstructured":"Lambek, J.: Type Grammars Revisited. In: Lecomte, A., Perrier, G., Lamarche, F. (eds.) LACL 1997. LNCS (LNAI), vol.\u00a01582, pp. 1\u201327. Springer, Heidelberg (1999)"},{"key":"4_CR6","unstructured":"Lambek, J.: From Word to Sentence: a computational algebraic approach to grammar. Polimetrica (2008)"},{"key":"4_CR7","unstructured":"Mater, A.H., Fix, J.D.: Finite Presentations of Pregroups and the Identity Problem. In: Proceedings of FG-MoL 2005, pp. 63\u201372. CSLI (electronic) (2005)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Moroz, K.: A Savateev-style parsing algorithm for pregroup grammars. In: de Groote, P., Egg, M., Kallmeyer, L. (eds.) FG 2009. LNCS, vol.\u00a05591, pp. 133\u2013149. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20169-1_9"},{"key":"4_CR9","unstructured":"Moroz, K.: Algorithmic questions for pregroup grammars, PhD thesis, Adam Mickiewicz University, Pozna\u0144 (2010)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.tcs.2006.03.018","volume":"357","author":"M. Pentus","year":"2006","unstructured":"Pentus, M.: Lambek calculus is NP-complete. Theoretical Computer Science\u00a0357, 186\u2013201 (2006)","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/s00224-009-9208-4","volume":"46","author":"Y. Savateev","year":"2010","unstructured":"Savateev, Y.: Unidirectional Lambek Grammars in Polynomial Time. Theory of Computing Systems\u00a046, 662\u2013672 (2010)","journal-title":"Theory of Computing Systems"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39998-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T13:27:16Z","timestamp":1547818036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39998-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642399978","9783642399985"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39998-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}