Dynamic Programming of Partial Parses

The last years have seen a renewal of interest in applying dyn amic programming to natural language processing. The main advan tage is the compactness of the representations, which is turning this para digm into a common way of dealing with highly redundant computations related t o phenomena such as non-determinism. Natural language parsing adds another challenge, since gra mmatical information is often insufficient. We describe an extension of parsing te chniques for partial parsing in dynamic programming. Our aim is to obtain as much i nformation as possible, that is incomplete parses, while preserving comp actness of the representations.