Free-ordered CUG on Chemical Abstract Machine

Authors:
Satoshi Tojo
Affiliations:
Mitsubishi Research Institute, Inc.
Venue:
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Year:
1994

Citing 3
Cited 0

Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
The chemical abstract machine

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Categorial unification grammars

COLING '86 Proceedings of the 11th coference on Computational linguistics

Quantified Score

Hi-index	0.03

Visualization

Abstract

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 λ-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.