Theoretical Time Complexities

We propose the design of deterministic constituent parsers that choose parser ac- tions according to the probabilities of parses of a given probabilistic context-free grammar. Several variants are presented. One …...