Constraint-Based Categorial Grammar

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-629897

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.