The Formal and Processing Models of Clg

1Citations
Citations of this article
72Readers
Mendeley users who have this article in their library.

Abstract

We present the formal processing model of CLG, a logic grammar formalism based on complex constraint resolution. In particular, we show how to monotonically extend terms and their unification to constrained terms and their resolution. The simple CLG constraint rewrite scheme is presented and its consequence for CLG's multiple delay model explained.

Cite

CITATION STYLE

APA

Damas, L., Moreira, N., & Varile, G. B. (1991). The Formal and Processing Models of Clg. In 5th Conference of the European Chapter of the Association for Computational Linguistics, EACL 1991 - Proceedings (pp. 173–178). Association for Computational Linguistics (ACL). https://doi.org/10.3115/977180.977210

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free