{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T01:40:04Z","timestamp":1735522804518,"version":"3.32.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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,2]]},"DOI":"10.1007\/bf01379313","type":"journal-article","created":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T22:56:31Z","timestamp":1112396191000},"page":"1-38","source":"Crossref","is-referenced-by-count":0,"title":["Parallel parsing of Tree Adjoining Grammars on the Connection Machine"],"prefix":"10.1007","volume":"21","author":[{"given":"Michael A.","family":"Palis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David S. L.","family":"Wei","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. of Comp. and Syst. Sci. 10:136?163 (1975).","journal-title":"J. of Comp. and Syst. Sci."},{"key":"CR2","unstructured":"A. S. Kroch and A. K. Joshi, The Linguistic Relevance of Tree Adjoining Grammars, Technical Report MS-CIS-85-16, Department of Computer and Information Science, University of Pennsylvania (April 1985)."},{"key":"CR3","volume-title":"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, (eds.), D. Dowty, L. Karttunen and A. Zwicky, Cambridge University Press, New York (1985)."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"A. Abeill\u00e9, Parsing French with Tree Adjoining Grammar: Some Linguistic Accounts,Proc. 12th Int'l Conf. on Computational Linguistics, Budapest (August 1988).","DOI":"10.3115\/991635.991637"},{"key":"CR5","unstructured":"A. Abeill\u00e9, A Lexicalized Tree Adjoining Grammar for French: The General Framework, Technical Report MS-CIS-88-64, Department of Computer and Information Science, University of Pennsylvania (1988)."},{"key":"CR6","unstructured":"A. Abeill\u00e9, Extraction Out of NP in Tree Adjoining Grammars, Papers from the 24th Regional Meeting of the Chicago Linguistic Society, Chicago, Illinois (1988)."},{"key":"CR7","unstructured":"A. Abeill\u00e9 and Y. Schabes, Parsing Idioms in Tree Adjoining Grammars,Proc. Fourth Conf. of the European Chapter of the Association for Computational Linguistics, Manchester (1989)."},{"key":"CR8","unstructured":"K. Bishop, S. Cote, and A. Abeill\u00e9, A Lexicalized Tree Adjoining Grammar for English, Technical Report, Department of Computer and Information Science, University of Pennsylvania (1989)."},{"key":"CR9","unstructured":"A. Abeill\u00e9, K. Bishop, S. Cote, Y. Schabes, and A. K. Joshi, Parsing with Tree Adjoining Grammars: The Current State of Implementation, Technical Report, Department of Computer and Information Science, University of Pennsylvania (August 1988)."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"K. Vijayshanker and A. K. Joshi, Some Computational Properties of Tree Adjoining Grammars,Proc. 23rd Ann. Meeting of the Association for Computational Linguistics, Chicago, Illinois, pp. 82?93.","DOI":"10.3115\/981210.981221"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Y. Schabes and A. K. Joshi, An Earley-type Parsing Algorithm for Tree Adjoining Grammars, Technical Report MS-CIS-88-36, Department of Computer and Information Science, University of Pennsylvania (June 1988).","DOI":"10.3115\/982023.982055"},{"key":"CR12","unstructured":"S. Shende, Computational Feasibility of Some Constrained Formalisms for Natural Language, PhD. Dissertation, Department of Computer and Information Science, University of Pennsylvania (1990)."},{"issue":"1","key":"CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0219001","volume":"19","author":"M. A. Palis","year":"1990","unstructured":"M. A. Palis, S. Shende, and D. Wei, An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages,SIAM J. on Computing 19(1):1?31 (February 1990).","journal-title":"SIAM J. on Computing"},{"key":"CR14","unstructured":"M. A. Palis and S. Shende, Upper Bounds on Recognition for a Hierarchy of Non-Context-Free Languages, Technical Report MS-CIS-88-56, Department of Computer and Information Science, University of Pennsylvania (1988); to appear inTheoretical Computer Science, Vol. 101 (December 1992)."},{"key":"CR15","unstructured":"M. A. Palis and S. Shende, Sublinear Parallel Time Recognition of Tree Adjoining Languages,Proc. Int'l. Conf. on Parallel Processing, Chicago, Illinois, pp. 202?205 (August 1989)."},{"key":"CR16","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 J. on Computing 4:331?340 (1975).","journal-title":"SIAM J. on Computing"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","volume":"22","author":"W. Ruzzo","year":"1980","unstructured":"W. Ruzzo, Tree-Size Bounded Alternation,J. of Comp. and Syst. Sci. 22:218?235 (1980).","journal-title":"J. of Comp. and Syst. Sci."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/978-3-642-82456-2_24","volume-title":"Combinatorial Algorithms on Words","author":"W. Rytter","year":"1985","unstructured":"W. Rytter, The Complexity of Two-Way Pushdown Automata and Recursive Programs,Combinatorial Algorithms on Words, (eds.), A. Apostolico and Z. Galil, Springer-Verlag, Heidelberg, pp. 341?356 (1985)."},{"key":"CR19","unstructured":"Thinking Machines Corporation,Connection Machine Model CM-2 Technical Summary (May 1989)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A. Borodin","year":"1985","unstructured":"A. Borodin and J. E. Hopcroft, Routing, Merging and Sorting on Parallel Models of Computation,J. of Comp. and Syst. Sci. 30:130?145 (1985).","journal-title":"J. of Comp. and Syst. Sci."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, D. Krizanc, and T. Tsantilas, Tight Bounds for Oblivious Routing in the Hypercube,ACM Symposium on Parallel Algorithms and Architectures, pp. 31?36 (1990).","DOI":"10.1145\/97444.97453"},{"key":"CR22","volume-title":"Introduction to Parallel Algorithms and Architectures: Trees, Arrays, Hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"F. T. Leighton,Introduction to Parallel Algorithms and Architectures: Trees, Arrays, Hypercubes, Morgan-Kaufmann Publishers, San Mateo, California (1992)."},{"key":"CR23","unstructured":"Thinking Machines Corporation,The Connection Machine CM-5 Technical Summary (October 1991)."},{"key":"CR24","unstructured":"Y. Schabes and A. K. Joshi, The Relevance of Lexicalization to Parsing,Proc. Int'l. Workshop on Parsing Technologies, CMU (August 1989)."},{"key":"CR25","unstructured":"D. S. L. Wei, Fast Parallel Routing and Computation on Interconnection Networks, PhD. Dissertation, Department of Computer and Information Science, University of Pennsylvania (1991)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01379313.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01379313\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01379313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T01:04:53Z","timestamp":1735520693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01379313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["BF01379313"],"URL":"https:\/\/doi.org\/10.1007\/bf01379313","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}