Formalization and Parsing of Typed Unification-Based ID/LP Grammars

This paper de nes uni cation based ID/LP grammars based on typed feature structures as nonterminals and proposes a variant of Earley's algorithm to decide whether a given input sentence is a member of the language generated by a particular typed uni cation ID/LP grammar. A solution to the problem of the nonlocal ow of information in uni cation ID/LP grammars as mentioned in Sei ert (1991) is incorporated into the algorithm. At the same time, it tries to connect this technical work with linguistics by giving a motivation drawn from natural language and by drawing connections from this approach to HPSG (Pollard and Sag 1994) and to systems implementing it, especially the Troll system (Gerdemann, Gotz and Morawietz forthcoming). CONTENTS i