Paper: Algorithms For Generation In Lambek Theorem Proving

ACL ID P90-1028
Title Algorithms For Generation In Lambek Theorem Proving
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1990

We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This strategy can be modeled by means of rules in the calculus that are geared to generation, or by means of an al- gorithm for the Theorem Prover. The latter pos- sibility enables processing of a bidirectional cal- culus. Therefore Lambek Theorem Proving is a natural candidate for a 'uniform' architecture for natural language parsing and generation. Keywords: generation algorithm; natural lan- guage generation; theorem proving; bidirection- ality; categorial grammar.