LOGIC GRAMMAR TOOLS FOR COMPUTATIONAL LINGUISTICS

To many people, logic grammars are equivalent to the Definite Clause Grammars (DCGs) of Warren and Pereira. Although sophisticated applications can be built with DCGs, the notation is too close to Prolog and too far from linguistic notation. Furthermore, DCGs rely entirely on a very simple control stategy for execution. In this paper we describe some advances in notation and control which make logic grammars more declarative and which bring logic grammars closer to current linguistic concerns. In particular, we shall describe the addition of feature sets and constraints on feature values, delaying mechanisms to implement such constraints declaratively, metaprogramming for logic grammars, and the application of metagrammatical programming to ID/LP parsing.