Two new parsing algorithms for context-free phrase structure gram- mars are presented which perform a bounded amount of processing per word per analysis path, independently of sentence length. They are thus ca- pable of parsing in real-time in a par- allel implementation which forks pro- cessors in response to non-determinis- tic choice points.

Click Here to View the Paper In XML Format