The normal method for representing anaphoric dependencies in Unification Based grammar tbrmalisms is that of re-entrance. In this paper, we address the problems that this represen...
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...
Marc Moens, Jonathan Calder, Ewan Klein, Mike Reap...
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...