<?xml version="1.0" standalone="yes"?>
<Paper uid="P90-1028">
  <Title>ALGORITHMS FOR GENERATION IN LAMBEK THEOREM PROVING</Title>
  <Section position="3" start_page="0" end_page="220" type="intro">
    <SectionTitle>
1 INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> Algorithms for tactical generation are becoming an increasingly important subject of research in computational linguistics (Shieber, 1988; Shieber et al., 1989; Calder et al., 1989). In this paper, we will discuss generation algorithms within the Lambek Theorem Proving (LTP) framework (Moortgat, 1988; Lambek, 1958; van Benthem, 1988). In section (2) we give an introduction to a categorial calculus that is extended towards bidirectionality. The naive top-down control strategy in this section does not suit the needs of efficient generation. Next, we discuss two ways to implement a semantics-driven strategy. Firstly, we add inference rules and cut rules geared to generation to the calculus (3). Secondly, since these changes in the calculus do not support bidirectionality, we *We would llke to thank Gosse Bouma, Wietske Si~tsma and Marianne Sanders for their comments on an earlier draft of the paper.</Paragraph>
    <Paragraph position="1">  introduce a second implementation: a bottom-up algorithm for the theorem prover (4).</Paragraph>
  </Section>
class="xml-element"></Paper>