Computer Science – Computation and Language
Scientific paper
1994-11-16
Computer Science
Computation and Language
COLING 94, five pages, one PS file of figure `t.eps'
Scientific paper
We propose a paradigm for concurrent natural language generation. In order to represent grammar rules distributively, we adopt categorial unification grammar (CUG) where each category owns its functional type. We augment typed lambda calculus with several new combinators, to make the order of lambda-conversions free for partial / local processing. The concurrent calculus is modeled with Chemical Abstract Machine. We show an example of a Japanese causative auxiliary verb that requires a drastic rearrangement of case domination.
No associations
LandOfFree
Free-ordered CUG on Chemical Abstract Machine 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 Free-ordered CUG on Chemical Abstract Machine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Free-ordered CUG on Chemical Abstract Machine will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-224463