ML p(r)ior | Constraint-Based Categorial Grammar
Processing...

Constraint-Based Categorial Grammar

1994-04-19
9404007 | cmp-lg
We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recursive constraints. In particular, the introduction of relational constraints allows one to capture the effects of (recursive) lexical rules in a computationally attractive manner. We illustrate the linguistic merits of the new approach by showing how it accounts for the syntax of Dutch cross-serial dependencies and the position and scope of adjuncts in such constructions. Delayed evaluation is used to process grammars containing recursive constraints.
PDF

Login to like/save this paper, take notes and configure your recommendations