{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T18:14:52Z","timestamp":1682446492078},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0304-3975(01)00352-8","type":"journal-article","created":{"date-parts":[[2003,1,21]],"date-time":"2003-01-21T19:54:09Z","timestamp":1043178849000},"page":"365-389","source":"Crossref","is-referenced-by-count":0,"title":["Tabular parsing and algebraic transformations"],"prefix":"10.1016","volume":"293","author":[{"given":"Karl-Michael","family":"Schneider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00352-8_BIB1","doi-asserted-by":"crossref","unstructured":"M. Alonso, J. Gra\u00f1a, M. Vilares, E. de la Clergerie, New tabular algorithms for LIG parsing, in: Proc. 6th Int. Workshop on Parsing Technologies, IWPT 2000, Trento, 2000, pp. 29\u201340.","DOI":"10.3115\/977035.977056"},{"key":"10.1016\/S0304-3975(01)00352-8_BIB2","unstructured":"M. Alonso, E. de la Clergerie, D. Cabrero, Tabulation of automata for tree adjoining languages, in: Proc. 6th Meeting on Mathematics of Language, MOL 6, Orlando, Florida, 1999, pp. 127\u2013141."},{"key":"10.1016\/S0304-3975(01)00352-8_BIB3","series-title":"Natural Language Parsing and Linguistic Theory","first-page":"69","article-title":"Applicability of indexed grammars to natural languages","author":"Gazdar","year":"1988"},{"key":"10.1016\/S0304-3975(01)00352-8_BIB4","series-title":"Universal Algebra","author":"Gr\u00e4tzer","year":"1979"},{"key":"10.1016\/S0304-3975(01)00352-8_BIB5","series-title":"Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology","author":"Gusfield","year":"1997"},{"issue":"2","key":"10.1016\/S0304-3975(01)00352-8_BIB6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.4064\/cm-28-2-189-193","article-title":"A characterization of strong homomorphisms","volume":"28","author":"H\u00f6ft","year":"1973","journal-title":"Colloq. Math."},{"key":"10.1016\/S0304-3975(01)00352-8_BIB7","series-title":"Handbook of Formal Languages, Vol. 3, Chap. 2","first-page":"69","article-title":"Tree-adjoining grammars","author":"Joshi","year":"1997"},{"key":"10.1016\/S0304-3975(01)00352-8_BIB8","unstructured":"M. Kay, Guides and oracles for linear-time parsing, in: Proc. 6th Internat. Workshop on Parsing Technologies, IWPT 2000, Trento, 2000, pp. 6\u20139."},{"issue":"4","key":"10.1016\/S0304-3975(01)00352-8_BIB9","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1111\/j.1467-8640.1994.tb00011.x","article-title":"Recognition can be harder than parsing","volume":"10","author":"Lang","year":"1994","journal-title":"Comput. Intell."},{"key":"10.1016\/S0304-3975(01)00352-8_BIB10","series-title":"Topics in Combinatorial Optimization","first-page":"145","article-title":"On the foundations of dynamic programming","volume":"Vol. 175","author":"Martelli","year":"1975"},{"key":"10.1016\/S0304-3975(01)00352-8_BIB11","unstructured":"M.-J. Nederhof, Linguistic parsing and program transformations, Ph. d. Thesis, Katholieke Universiteit Nijmegen, Nijmegen, 1994."},{"key":"10.1016\/S0304-3975(01)00352-8_BIB12","unstructured":"M.-J. Nederhof, Models of tabulation for TAG parsing, in: Proc. 6th Meeting on Mathematics of Language, MOL, Vol. 6, Orlando, FL, pp. 143\u2013158."},{"key":"10.1016\/S0304-3975(01)00352-8_BIB13","doi-asserted-by":"crossref","unstructured":"F.C.N. Pereira, D.H.D. Warren, Parsing as deduction, in: Proc. 21st Ann. Meeting of the Association for Computational Linguistics, (ACL\u201983), 1983, pp. 137\u2013144.","DOI":"10.3115\/981311.981338"},{"issue":"1","key":"10.1016\/S0304-3975(01)00352-8_BIB14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.4064\/cm-21-1-5-21","article-title":"A homomorphism theorem for partial algebras","volume":"21","author":"Schmidt","year":"1970","journal-title":"Colloq. Math."},{"key":"10.1016\/S0304-3975(01)00352-8_BIB15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00630917","article-title":"Evidence against the context-freeness of natural language","volume":"8","author":"Shieber","year":"1985","journal-title":"Linguist. Philos."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(01)00352-8_BIB16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0743-1066(95)00035-I","article-title":"Principles and implementation of deductive parsing","volume":"24","author":"Shieber","year":"1995","journal-title":"J. Logic Program."},{"key":"10.1016\/S0304-3975(01)00352-8_BIB17","series-title":"Parsing Schemata, Proefschrift, Universiteit Twente","author":"Sikkel","year":"1993"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(01)00352-8_BIB18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0304-3975(97)00269-7","article-title":"Parsing schemata and correctness of parsing algorithms","volume":"199","author":"Sikkel","year":"1998","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(01)00352-8_BIB19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.4064\/cm-15-1-25-44","article-title":"On mappings between quasi-algebras","volume":"15","author":"S\u0142omi\u0144ski","year":"1966","journal-title":"Colloq. Math."},{"issue":"2","key":"10.1016\/S0304-3975(01)00352-8_BIB20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.4064\/cm-17-2-247-268","article-title":"On systems of mappings between models","volume":"17","author":"S\u0142omi\u0144ski","year":"1967","journal-title":"Colloq. Math."},{"key":"10.1016\/S0304-3975(01)00352-8_BIB21","series-title":"Current Issues in Parsing Technology","first-page":"191","article-title":"Polynomial parsing of extensions of context-free grammars","author":"Vijay-Shanker","year":"1991"},{"issue":"4","key":"10.1016\/S0304-3975(01)00352-8_BIB22","first-page":"591","article-title":"Parsing some constrained grammar formalisms","volume":"19","author":"Vijay-Shanker","year":"1993","journal-title":"Comput. Linguist."},{"key":"10.1016\/S0304-3975(01)00352-8_BIB23","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/BF01191624","article-title":"The equivalence of four extensions of context-free grammars","volume":"27","author":"Vijay-Shanker","year":"1994","journal-title":"Math. Systems Theory"},{"issue":"2","key":"10.1016\/S0304-3975(01)00352-8_BIB24","doi-asserted-by":"crossref","first-page":"187","DOI":"10.4064\/cm-27-2-187-191","article-title":"Remarks on lattices of congruence relations of quasi-algebras","volume":"27","author":"Wojdy\u0142o","year":"1973","journal-title":"Colloquium Mathematicum"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003528?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003528?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T17:43:42Z","timestamp":1682444622000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0304397501003528"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00352-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}