{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:42:20Z","timestamp":1755218540217,"version":"3.43.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Grammars"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1023\/a:1009967013686","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T19:25:11Z","timestamp":1040585111000},"page":"89-110","source":"Crossref","is-referenced-by-count":3,"title":["Tabulation of Automata for Tree-Adjoining Languages"],"prefix":"10.1007","volume":"3","author":[{"given":"Miguel \u00c1.","family":"Alonso Pardo","sequence":"first","affiliation":[]},{"given":"Mark-Jan","family":"Nederhof","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Villemonte de la Clergerie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"310431_CR1","unstructured":"Alonso Pardo, M., E. de la Clergerie and M. Vilares Ferro. Automata-Based Parsing in Dynamic Programming for Linear Indexed Grammars. In A. Narin'yani, editor, Computational Linguistics and its Applications, Proceedings, 22\u201327, Moscow, Russia, 1997."},{"issue":"4","key":"310431_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1111\/j.1467-8640.1994.tb00006.x","volume":"10","author":"T. Becker","year":"1994","unstructured":"Becker, T. A New Automaton Model for TAGs: 2-SA. Computational Intelligence, 10(4): 422\u2013430, 1994.","journal-title":"Computational Intelligence"},{"key":"310431_CR3","doi-asserted-by":"crossref","unstructured":"Billot, S. and B. Lang. The Structure of Shared Forests in Ambiguous Parsing. In 27th Annual Meeting of the ACL. 143\u2013151, Vancouver, British Columbia, Canada, 1989.","DOI":"10.3115\/981623.981641"},{"key":"310431_CR4","unstructured":"de la Clergerie, E., M. Alonso Pardo and D. Cabrero Souto. A Tabular Interpretation of Bottom-Up Automata for TAG. In Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks, 42\u201345, 1998."},{"key":"310431_CR5","first-page":"69","volume-title":"Natural Language Parsing and Linguistic Theories","author":"G. Gazdar","year":"1987","unstructured":"Gazdar, G. Applicability of Indexed Grammars to Natural Languages. In U. Reyle and C. Rohrer, editors, Natural Language Parsing and Linguistic Theories. Dordrecht, Reidel, 69\u201394, 1987."},{"key":"310431_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1075\/z.35.07jos","volume-title":"Mathematics of Language.","author":"A. Joshi","year":"1987","unstructured":"Joshi, A. An Introduction to Tree Adjoining Grammars. In A. Manaster-Ramer, editor. Mathematics of Language. Amsterdam, John Benjamins, 87\u2013114, 1987."},{"key":"310431_CR7","first-page":"31","volume-title":"Foundational Issues in Natural Language Processing","author":"A. Joshi","year":"1991","unstructured":"Joshi, A., K. Vijay-Shanker and D. Weir. The Convergence of Mildly Context-Sensitive Grammar Formalisms. In P. Sells, S. Shieber, and T. Wasow, editors, Foundational Issues in Natural Language Processing. MIT Press, Cambridge, MA, chapt. 2, 31\u201381, 1991."},{"key":"310431_CR8","doi-asserted-by":"crossref","unstructured":"Lang, B. Deterministic Techniques for Efficient Non-Deterministic Parsers. In Automata, Languages and Programming, 2nd Colloquium, vol. 14 of Lecture Notes in Computer Science. Saarbr\u00fccken, 255\u2013269, 1974.","DOI":"10.1007\/978-3-662-21545-6_18"},{"key":"310431_CR9","volume-title":"Complete Evaluation of Horn Clauses: An Automata Theoretic Approach","author":"B. Lang","year":"1988","unstructured":"Lang, B. Complete Evaluation of Horn Clauses: An Automata Theoretic Approach. Rapport de Recherche 913, Institut National de Recherche en Informatique et en Automatique, Rocquencourt, France, 1988a."},{"key":"310431_CR10","unstructured":"Lang, B. The Systematic Construction of Earley Parsers: Application to the Production of O.(n\n                  6) Earley Parsers for Tree Adjoining Grammars. Unpublished paper, 1988b."},{"issue":"4","key":"310431_CR11","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1111\/j.1467-8640.1994.tb00011.x","volume":"10","author":"B. Lang","year":"1994","unstructured":"Lang, B. Recognition Can be Harder than Parsing. Computational Intelligence, 10(4): 486\u2013494, 1994.","journal-title":"Computational Intelligence"},{"key":"310431_CR12","unstructured":"Nederhof, M.-J. Linear Indexed Automata and Tabulation of TAG Parsing. In Actes des premi\u00e8res journ\u00e9es sur la Tabulation en Analyse Syntaxique et D\u00e9duction (Tabulation in Parsing and Deduction). Paris, France, 1\u20139, 1998."},{"issue":"3","key":"310431_CR13","first-page":"345","volume":"25","author":"M.-J. Nederhof","year":"1999","unstructured":"Nederhof, M.-J. The Computational Complexity of the Correct-Prefix Property for TAGs. Computational Linguistics, 25(3): 345\u2013360, 1999a.","journal-title":"Computational Linguistics"},{"key":"310431_CR14","unstructured":"Nederhof, M.-J. Models of Tabulation for TAG Parsing. In Sixth Meeting on Mathematics of Language. Orlando, Florida USA, 143\u2013158, 1999b."},{"key":"310431_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/S0019-9958(80)90867-0","volume":"45","author":"R. Parchmann","year":"1980","unstructured":"Parchmann, R., J. Duske and J. Specht. On Deterministic Indexed Languages, Information and Control, 45: 48\u201367, 1980.","journal-title":"Information and Control"},{"key":"310431_CR16","doi-asserted-by":"crossref","unstructured":"Schabes, Y. and K. Vijay-Shanker. Deterministic Left to Right Parsing of Tree Adjoining Languages. In 28th Annual Meeting of the ACL. Pittsburgh, Pennsylvania, USA, 276\u2013283, 1990.","DOI":"10.3115\/981823.981858"},{"key":"310431_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0743-1066(95)00035-I","volume":"24","author":"S. Shieber","year":"1995","unstructured":"Shieber, S., Y. Schabes and F. Pereira. Principles and Implementation of Deductive Parsing. Journal of Logic Programming, 24: 3\u201336, 1995.","journal-title":"Journal of Logic Programming"},{"key":"310431_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61345-6","volume-title":"Parsing Theory, vol. I: Languages and Parsing","author":"S. Sippu","year":"1988","unstructured":"Sippu, S. and E. Soisalon-Soininen. Parsing Theory, vol. I: Languages and Parsing. Springer, Berlin 1988."},{"key":"310431_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-08424-3","volume-title":"Parsing Theory, vol. II: LR(k) and LL(k) Parsing","author":"S. Sippu","year":"1990","unstructured":"Sippu, S. and E. Soisalon-Soininen. Parsing Theory, vol. II: LR(k) and LL(k) Parsing. Springer, Berlin 1990."},{"key":"310431_CR20","doi-asserted-by":"crossref","unstructured":"Tomita, M. Efficient Parsing for Natural Language. Dordrecht Kluwer, 1986.","DOI":"10.1007\/978-1-4757-1885-0"},{"issue":"4","key":"310431_CR21","first-page":"591","volume":"19","author":"K. Vijay-Shanker","year":"1993","unstructured":"Vijay-Shanker, K. and D. Weir. Parsing Some Constrained Grammar Formalisms. Computational Linguistics, 19(4): 591\u2013636, 1993a.","journal-title":"Computational Linguistics"},{"key":"310431_CR22","doi-asserted-by":"crossref","unstructured":"Vijay-Shanker, K. and D. Weir. The Use of Shared Forests in Tree Adjoining Grammar Parsing. In Sixth Conference of the European Chapter of the ACL. Utrecht, The Netherlands, 384\u2013393, 1993b.","DOI":"10.3115\/976744.976789"},{"key":"310431_CR23","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BF01191624","volume":"27","author":"K. Vijay-Shanker","year":"1994","unstructured":"Vijay-Shanker, K. and D. Weir. The Equivalence of Four Extensions of Context-Free Grammars. Mathematical Systems Theory, 27: 511\u2013546, 1994.","journal-title":"Mathematical Systems Theory"},{"key":"310431_CR24","first-page":"1333","volume":"2","author":"E. Villemonte de la Clergerie","year":"1998","unstructured":"Villemonte de la Clergerie, E. and M. Alonso Pardo. A Tabular Interpretation of a Class of 2-Stack Automata. In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, vol. 2. Montr\u00e9al, Qu\u00e9bec, Canada, 1333\u20131339, 1998.","journal-title":"36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics"},{"key":"310431_CR25","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(97)00272-7","volume":"199","author":"E. Villemonte de la Clergerie","year":"1998","unstructured":"Villemonte de la Clergerie, E. and F. Barth\u00e9lemy. Information Flow in Tabular Interpretations for Generalized Push-Down Automata. Theoretical Computer Science, 199: 167\u2013198, 1998.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"310431_CR26","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1111\/j.1467-8640.1994.tb00007.x","volume":"10","author":"D. Weir","year":"1994","unstructured":"Weir, D. Linear Iterated Pushdowns. Computational Intelligence, 10(4): 431\u2013439, 1994.","journal-title":"Computational Intelligence"}],"container-title":["Grammars"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009967013686.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009967013686\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009967013686.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T05:49:42Z","timestamp":1754459382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009967013686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":26,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["310431"],"URL":"https:\/\/doi.org\/10.1023\/a:1009967013686","relation":{},"ISSN":["1386-7393","1572-848X"],"issn-type":[{"type":"print","value":"1386-7393"},{"type":"electronic","value":"1572-848X"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}