{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:32:42Z","timestamp":1725895962530},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201684"},{"type":"electronic","value":"9783642201691"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20169-1_9","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T05:21:04Z","timestamp":1301289664000},"page":"133-149","source":"Crossref","is-referenced-by-count":3,"title":["A Savateev-Style Parsing Algorithm for Pregroup Grammars"],"prefix":"10.1007","author":[{"given":"Katarzyna","family":"Moroz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11225-007-9084-3","volume":"87","author":"D. B\u00e9chet","year":"2007","unstructured":"B\u00e9chet, D.: Parsing Pregroup Grammars and Lambek Calculus using Partial Composition. Studia Logica\u00a087(2-3), 199\u2013224 (2007)","journal-title":"Studia Logica"},{"key":"9_CR2","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\u00e8, C. (eds.) LACL 2001. LNCS (LNAI), vol.\u00a02099, p. 95. Springer, Heidelberg (2001)"},{"issue":"2-3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s11225-007-9083-4","volume":"87","author":"W. Buszkowski","year":"2007","unstructured":"Buszkowski, W.: Type Logics and Pregroups. Studia Logica\u00a087(2-3), 145\u2013169 (2007)","journal-title":"Studia Logica"},{"key":"9_CR4","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":"9_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., Lamarche, F., Perrier, G. (eds.) LACL 1997. LNCS (LNAI), vol.\u00a01582, pp. 1\u201327. Springer, Heidelberg (1999)"},{"key":"9_CR6","unstructured":"Lambek, J.: From Word to Sentence: a computational algebraic approach to grammar, Polimetrica (2008)"},{"key":"9_CR7","first-page":"141","volume-title":"Language and Grammar","author":"M. Mootrgat","year":"2005","unstructured":"Mootrgat, M., Oehrle, R.: Pregroups and type-logical grammar: searching for convergence. In: Casadio, C., Scott, P.J., Seely, R.A.G. (eds.) Language and Grammar, pp. 141\u2013160. CSLI Publications, Stanford (2005)"},{"key":"9_CR8","unstructured":"Oehrle, R.: A parsing algorithm for pregroup grammars. In: Proceedings of Categorial Grammars, Montpellier France, pp. 59\u201375 (2004)"},{"issue":"2-3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s11225-007-9087-0","volume":"87","author":"A. Preller","year":"2007","unstructured":"Preller, A.: Linear Processing with Pregroups. Studia Logica\u00a087(2-3), 171\u2013197 (2007)","journal-title":"Studia Logica"},{"key":"9_CR10","unstructured":"Savateev, Y.: Unidirectional Lambek Grammars in Polynomial Time, Theory of Computing Systems (to appear)"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20169-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T10:10:03Z","timestamp":1558519803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20169-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201684","9783642201691"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20169-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}