Constraint Categorial Grammars

Details Constraint Categorial Grammars Constraint Categorial Grammars

1995-07-04

arxiv.org/abs/cmp-lg/9507001v1

Computer Science

Computation and Language

12 pages, 5 Postscript figures, uses llncs.sty and epsfig.sty. To appear in Proceedings of EPIA'95, 7th Portuguese Conference

Scientific paper

Although unification can be used to implement a weak form of $\beta$-reduction, several linguistic phenomena are better handled by using some form of $\lambda$-calculus. In this paper we present a higher order feature description calculus based on a typed $\lambda$-calculus. We show how the techniques used in \CLG for resolving complex feature constraints can be efficiently extended. \CCLG is a simple formalism, based on categorial grammars, designed to test the practical feasibility of such a calculus.

Affiliated with

Also associated with

No associations

Rating

Constraint Categorial Grammars 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 Categorial Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint Categorial Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-264257