Parallel Parsing Strategies in Natural Language Processing

We present a concise survey of approaches to the context-free parsing prob­ lem of natural languages in parallel environments. The discussion includes parsing schemes which use more than one traditional parser, schemes where separate processes are assigned to the ‘non-deterministic’ choices during parsing, schemes where the number of processes depends on the length of the sentence being parsed, and schemes where the number of processes depends on the grammar size rather than on the input length. In addition we discuss a connectionist approach to the parsing problem.

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

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

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

[4]  James L. McClelland,et al.  Mechanisms of Sentence Processing: Assigning Roles to Constituents of Sentences , 1986 .

[5]  Raghavendra Rao Loka.  A note on parallel parsing , 1984, SIGP.

[6]  Louise Guthrie,et al.  Parsing in Parallel , 1986, COLING.

[7]  Bernard Lang.  Parallel non-deterministic bottom-up parsing , 1971 .

[8]  Charles N. Fischer.  On parsing context free languages in parallel environments. , 1975 .

[9]  Anton Nijholt.  Computers and languages - theory and practice , 1988, Studies in computer science and artificial intelligence.

[10]  Masaru Tomita,et al.  Efficient parsing for natural language , 1985 .

[11]  Su May Chou.  Transition networks for pattern recognition. , 1975 .

[12]  H.D.A. Tan.  VLSI-algoritmen voor herkenning van context-vrije talen in lineaire tijd [VLSI algorithms for recognition of context-free languages in linear time] , 1983 .

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

[14]  Garrison W. Cottrell,et al.  Viewing parsing as word sense discrimination: a connectionist approach , 1984 .

[15]  Priti Shankar,et al.  Parallel parsing of programming languages , 1987, Inf. Sci..

[16]  H. T. Kung,et al.  Direct VLSI Implementation of Combinatorial Algorithms , 1979 .

[17]  Y. Chiang,et al.  A VLSI Architecture for Fast Context-Free Language Recognition , 1982, ICDCS.

[18]  King-Sun Fu,et al.  VLSI architectures for high speed recognition of context-free languages and finite-state languages , 1982, ISCA 1982.

[19]  Neil Lincoln,et al.  Parallel programming techniques for compilers , 1970, SIGP.

[20]  E. L. Yushchenko,et al.  Several aspects of theory of parametric models of languages and parallel syntactic analysis , 1975, Methods of Algorithmic Language Implementation.

[21]  Steven L. Small,et al.  A distributed word-based approach to parsing , 1987 .

[22]  Michael A. Harrison,et al.  Parsing of General Context-Free Languages , 1976, Adv. Comput..

[23]  M. Dennis Mickunas,et al.  Parallel Compilation In A Multiprocessor Environment (Extended Abstract) , 1978, ACM Annual Conference.

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