Free-ordered CUG on Chemical Abstract Machine

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
COLING 94, five pages, one PS file of figure `t.eps'

Keywords

Computation and Language

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/151113

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cmp-lg/9411021
 http://arxiv.org/abs/cmp-lg/9411021

Collections

arXiv