{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:23:51Z","timestamp":1648967031210},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1007\/bf01408291","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T04:59:02Z","timestamp":1112504342000},"page":"151-167","source":"Crossref","is-referenced-by-count":0,"title":["An NC algorithm for recognizing tree adjoining languages"],"prefix":"10.1007","volume":"21","author":[{"given":"Michael A.","family":"Palis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunil M.","family":"Shende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A. K. Joshi","year":"1975","unstructured":"A. K. Joshi, L. S. Levy, and M. Takahashi, Tree Adjunct Grammars,J. Comput. and Syst. Sci. 10:136?163 (1975).","journal-title":"J. Comput. and Syst. Sci."},{"key":"CR2","volume-title":"Natural Language Processing?Theoretical, Computational and Psychological Perspectives","author":"A. K. Joshi","year":"1985","unstructured":"A. K. Joshi, How Much Context-Sensitivity is Necessary for Characterizing Structural Descriptions?Tree Adjoining Grammars,Natural Language Processing?Theoretical, Computational and Psychological Perspectives, D. Dowty, L. Karttunen, and A. Zwicky (eds.), Cambridge University Press, New York (1985)."},{"key":"CR3","unstructured":"A. S. Kroch and A. K. Joshi, The Linguistic Relevance of Tree Adjoining Grammar, Tech. Rep. MS-CIS-85-16, Department of Computer and Information Science, University of Pennsylvania (June 1985)."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"A. Abeill\ufffd, Parsing French with Tree Adjoining Grammar: Some Linguistic Accounts,Proc. 12th Int. Conf. on Computational Linguistics, Budapest (August 1988).","DOI":"10.3115\/991635.991637"},{"key":"CR5","unstructured":"A. Abeill\ufffd, A Lexicalized Tree Adjoining Grammar for French: The General Framework, Tech. Rep. MS-CIS-88-64, Department of Computer and Information Science, University of Pennsylvania (1988)."},{"key":"CR6","unstructured":"A. Abeill\ufffd, Extraction Out of NP in Tree Adjoining Grammars,The 24th Regional Meeting of the Chicago Linguistic Society, Chicago, Illinois (1988)."},{"key":"CR7","unstructured":"A. Abeill\ufffd and Y. Schabes, Parsing Idioms in Tree Adjoining Grammars,Proc. Fourth Conf. of the European Chapter of the Assoc. for Computational Linguistics, Manchester (1989)."},{"key":"CR8","unstructured":"K. Bishop, S. Cote, and A. Abeill\ufffd, A Lexicalized Tree Adjoining Grammar for English, Tech. Rep., Department of Computer and Information Science, University of Pennsylvania (1989)."},{"key":"CR9","unstructured":"A. Abeill\ufffd, K. Bishop, S. Cote Y. Schabes, and A. K. Joshi, Parsing with Tree Adjoining Grammars: The Current State of Implementation, Tech. Rep., Department of Computer and Information Science, University of Pennsylvania (August 1988)."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"K. Vijayashanker and A. K. Joshi, Some Computational Properties of Tree Adjoining Grammars,Proc. of the 23rd Ann. Meeting of the Assoc. for Computational Linguistics Chicago, Illinois, pp. 82?93 (July 1985).","DOI":"10.3115\/981210.981221"},{"key":"CR11","unstructured":"D. J. Weir, From Context-Free Grammars to Tree Adjoining Grammars and Beyond, Tech. Rep. MS-CIS-87-42, Department of Computer and Information Science, University of Pennsylvania (May 1987)."},{"issue":"3","key":"CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/0204028","volume":"4","author":"S. R. Kosaraju","year":"1975","unstructured":"S. R. Kosaraju, Speed of Recognition of Context-Free Languages by Array Automata,SIAM Journal on Computing 4(3):331?340 (1975).","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"CR13","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/TPAMI.1984.4767522","volume":"6","author":"Y. Chiang","year":"1984","unstructured":"Y. Chiang and K. S. Fu, Parallel Parsing and VLSI Implementations for Syntactic Pattern Recognition,IEEE Trans. PAMI 6(3):302?313 (1984).","journal-title":"IEEE Trans. PAMI"},{"issue":"1","key":"CR14","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TC.1987.5009449","volume":"36","author":"J. H. Chang","year":"1987","unstructured":"J. H. Chang, O. H. Ibarra, and M. A. Palis, Parallel Parsing on a One-Way Array of Finite-State Machines,IEEE Trans. on Comput. C-36(1):64?75 (January 1987).","journal-title":"IEEE Trans. on Comput. C"},{"key":"CR15","unstructured":"L. Langlois, Parallel Parsing of Context-Free Languages on an Array of Processors, PhD Thesis, University of Edinburgh (September 1988)."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"W. L. Ruzzo, Tree-size Bounded Alternation,J. of Comput. and Syst. Sci. 21:218?235.","DOI":"10.1016\/0022-0000(80)90036-7"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","volume":"13","author":"L. Stockmeyer","year":"1984","unstructured":"L. Stockmeyer and U. Vishkin, Simulation of Parallel Random Access Machines by Circuits,SIAM Journal on Computing 13:409?422 (1984).","journal-title":"SIAM Journal on Computing"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"S. A. Cook, A Taxonomy of Problems with Fast Parallel Algorithms,Infor. and Contr. 64:2?22 (1985).","journal-title":"Infor. and Contr."},{"key":"CR19","unstructured":"W. Rytter, The Complexity of Two-Way Pushdown Automata and Recursive Programs,Combinatorial Algorithms on Words, A. Apostolico and Z. Galil (eds.), NATO ASI Series F: 12, Springer-Verlag, New York\/Berlin."},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"J. Reif, ParallelO(logn) Time Acceptance of Deterministic CFLs,Proc. 23rd IEEE Symp. on Foundations of Comput. Sci., pp. 290?296 (1982).","DOI":"10.1109\/SFCS.1982.84"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0890-5401(87)90041-1","volume":"73","author":"W. Rytter","year":"1987","unstructured":"W. Rytter, ParallelO(logn) Recognition of Unambiguous Context-Free Languages,Infor. and Comput. 73:75?86 (1987).","journal-title":"Infor. and Comput."},{"key":"CR22","volume-title":"Theory of Parsing, Translation and Compiling, Volume 1: Parsing","author":"A. V. Aho","year":"1972","unstructured":"A. V. Aho and J. D. Ullman,Theory of Parsing, Translation and Compiling, Volume 1: Parsing, Prentice-Hall, Englewood Cliffs, New Jersey (1972)."},{"key":"CR23","unstructured":"C. N. Fischer, On Parsing Context-Free Languages in Parallel Environments, PhD Thesis, Cornell University (1975)."},{"issue":"2","key":"CR24","first-page":"203","volume":"2","author":"C. N. Fischer","year":"1980","unstructured":"C. N. Fischer, On Parsing and Compiling Arithmetic Expressions on Vector Computers,ACM Trans. PAS 2(2):203?224 (April 1980).","journal-title":"ACM Trans. PAS"},{"key":"CR25","unstructured":"R. M. Schell, Methods for Constructing Parallel Compilers for Use in a Multiprocessor Environment, PhD Thesis, University of Illinois at Urbana-Champaign (1979)."},{"issue":"2","key":"CR26","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1145\/322307.322316","volume":"29","author":"J. Cohen","year":"1982","unstructured":"J. Cohen, T. Hickey, and J. Katcoff, Upper-Bounds for Speed-Up in Parallel Parsing,J. of the ACM 29(2):408?428 (1982).","journal-title":"J. of the ACM"},{"issue":"1","key":"CR27","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/TSE.1985.231848","volume":"11","author":"J. Cohen","year":"1985","unstructured":"J. Cohen and S. Kolonder, Estimating the Speed-Up in Parallel Parsing,IEEE Trans. on Software Engineering 11(1):114?124 (January 1985).","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"3","key":"CR28","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(89)90217-2","volume":"31","author":"D. B. Skillicorn","year":"1989","unstructured":"D. B. Skillicorn and D. T. Barnard, Parallel Parsing on the Connection Machine,Infor. Proc. Lett. 31(3):111?117 (May 1989).","journal-title":"Infor. Proc. Lett."},{"issue":"1","key":"CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0219001","volume":"19","author":"M. A. Palis","year":"1990","unstructured":"M. A. Palis, S. M. Shende, and D. S. L. Wei, An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages,SIAM Journal on Computing 19(1):1?31 (February 1990).","journal-title":"SIAM Journal on Computing"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(92)90005-Z","volume":"98","author":"M. A. Palis","year":"1992","unstructured":"M. A. Palis and S. M. Shende, Upper Bounds on Recognition of a Hierarchy of Noncontext-Free Languages,Theoret. Comput. Sci. 98:289?319 (1992).","journal-title":"Theoret. Comput. Sci."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01408291.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01408291\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01408291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T17:07:24Z","timestamp":1586192844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01408291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["BF01408291"],"URL":"https:\/\/doi.org\/10.1007\/bf01408291","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}