Computer Science – Computation and Language
Scientific paper
1994-04-19
Proceedings ACL 94
Computer Science
Computation and Language
8 pages, LaTeX
Scientific paper
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.
Bouma Gosse
Noord Gertjan van
No associations
LandOfFree
Constraint-Based Categorial Grammar does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Constraint-Based Categorial Grammar, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint-Based Categorial Grammar will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-629897