Formulation and Analysis of Parallel Context-Free Recognition and Parsing on a PRAM Model

Abstract A new parallel version of the CKY-algorithm for context-free recognition and parsing is presented. The proposed algorithm is formulated on a PRAM model. First we show that the CKY-algorithm can easily be formulated on a WRAM model taking O( n ) time and O( n 2 ) processors. An analysis of this formulation shows that the multiple entries in a location of recognition table can be ordered in a manner to be written exclusively in that location. Based on this ordering, a formulation on a PRAM model is developed. It is shown that the proposed CKY-algorithm with PRAM formulation takes 2 n − 2 steps, i.e. its time-complexity is also linear and requires a quadratic number of processors.

[1]  King-Sun Fu,et al.  Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[3]  Laurent Chevalier Langlois,et al.  Parallel parsing of context-free languages on an array of processors , 1988 .

[4]  Antinus Nijholt.  Parallel Parsing Strategies in Natural Language Processing , 1989, IWPT.

[5]  Ralph Grishman,et al.  Evaluation Of A Parallel Chart Parser , 1988, ANLP.

[6]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[7]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[8]  Narendra S. Chaudhari,et al.  Efficient Parallel Recognition of Context-Free Languages , 1994, Parallel Comput..

[9]  Wojciech Rytter.  On the Complexity of Parallel Parsing of General Context-Free Languages , 1986, Theor. Comput. Sci..

[10]  Oscar H. Ibarra,et al.  Parallel Regognition and Parsing on the Hypercube , 1991, IEEE Trans. Computers.

[11]  Jordan B. Pollack,et al.  Massively Parallel Parsing: A Strongly Interactive Model of Natural Language Interpretation , 1988, Cogn. Sci..

[12]  Masaru Tomita,et al.  Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .

[13]  Henry S. Thompson,et al.  Chart Parsing for Loosely Coupled Parallel Systems , 1989, IWPT.

[14]  Oscar H. Ibarra,et al.  Parallel Parsing on a One-Way Array of Finite-State Machines , 1987, IEEE Transactions on Computers.

[15]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[16]  S. Rao Kosaraju.  Speed of Recognition of Context-Free Languages by Array Automata , 1975, SIAM J. Comput..

[17]  C. Siva Ram Murthy,et al.  Parallel Recognition and Parsing on Mesh Connected Computers with Multiple Broadcasting , 1994, Comput. Lang..

[18]  Rajiv Trehan,et al.  A Parallel Chart Parser for the Committed Choice Non-Deterministic Logic Languages , 1988, ICLP/SLP.

[19]  Akinori Yonezawa,et al.  Object-Oriented Parallel Parsing for Context-Free Grammars , 1988, COLING.

[20]  Peter J. Wyard,et al.  A Single Layer Higher Order Neural Net and its Application to Context Free Grammar Recognition , 1990 .

[21]  Antinus Nijholt,et al.  The CYK approach to serial and parallel parsing , 1990 .

[22]  King-Sun Fu,et al.  Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture , 1986, Pattern Recognit..

[23]  Donald E. Knuth,et al.  On the Translation of Languages from Left to Right , 1965, Inf. Control..

[24]  Hiroaki Kitano,et al.  Massively Parallel Memory-Based Parsing , 1991, IJCAI.