The virtues of viewing the lexicon as an inheritance network are its succinctness and its
tendency to highlight significant clusters of linguistic properties. From its succinctness follow …

Inheritance is an inference mechanism originally defined for semantic network formalisms. It
allows redundancy to be removed from the description of a domain by factoring out reusable …

Default unification has been used in several linguistic applications. Most of them have
utilized defaults at a metalevel, as part of an extended description language. We propose …

This paper addresses two central problems for probabilistic processing models: parameter
estimation from incomplete data and efficient retrieval of most probable analyses. These …

This paper proposes a new computational treatment of lexical rules as used in the HPSG
framework. A compiler is described which translates a set of lexical rules and their …

This paper examines the main points of contact between logic programming and natural
language processing, and covers some of the important issues that arise using logic …

Constraint logic grammars provide a powerful formalism for expressing complex logical
descriptions of natural language phenomena in exact terms. Describing some of these …

This paper extends the approach to feature structures developed in Johnson (1991a), which
uses SchO'nfinkel-Bernays' formulae to express feature structure constraints. These are …

Niniejszy raport stanowi przegl, ad najbardziej popularnych system ow umo_zliwiaj, acych
implementacj, e gramatyk formalnych j, ezyka naturalnego. Selekcji system ow dokonano ze …

In this paper we describe the key ideas of the unification-based grammar formalism STUF
that is being developed and used within the LILOG project at IBM Germany. STUF integrates …