Parsing a Probabilistic Dependency Grammar

Contents

This note discusses the current development of an approach to parsing designed to overcome some of the problems of existing parsers, particularly with respect to their utility as probabilistic language models. The parser combines lexical and grammatical constraints into a uniform grammatical representation and is readily trainable (since the parser output is indistinguishable from the grammar input). A key issue is what path of generalization to use for rare and unseen constructions.