<?xml version="1.0" standalone="yes"?>
<Paper uid="C02-1141">
  <Title>A complete integrated NLG system using AI and NLU tools</Title>
  <Section position="5" start_page="0" end_page="0" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> Since NLG is a subfield of NLP, which is itself a subfield of AI, it seems to be a good idea to reuse tools developped by the NLP or AI community. We have shown in this paper how to integrate DL, sdrt, and a lexicalized grammar into an NLG system, while following the standard pipelined architecture3.</Paragraph>
    <Paragraph position="1"> 3Some authors (de Smedt et al., 1996) have made justified criticisms of the pipelined architecture. However, we decided to keep it for the time being.</Paragraph>
    <Paragraph position="2"> Theorem.</Paragraph>
    <Paragraph position="3"> [?]p,d:IN (d negationslash= 0 - [?]q,r:IN (r &lt; d [?] p = q.d + r)) Proof. Let us choose p,d two natural numbers with d negationslash= 0. By induction on p we prove [?]q,r:IN (r &lt; d [?] p = q.d + r). Let take a a strictly positive natural. We assume [?]b:IN (b &lt; a - [?]q,r:IN (r &lt; d [?] b = q.d + r)) and we must prove [?]q,r:IN (r &lt; d [?] a = q.d + r). We distinguish two cases: a &lt; d and d [?] a. In the first case, we choose q = 0 and r = a. In the second case, we take aprime = a [?] d. Using the induction hypothesis on aprime, we find two naturals q,r such that r &lt; d and aprime = q.d + r. We take S q and r as quotient and remaining for the division of a. We must prove a = S q.d + r which is immediate.</Paragraph>
    <Paragraph position="4">  GePhoX illustrates the applicabilty of our system. It is currently being implemented in Java. The development of the document planner of GePhoX is work in progress. The goal is to interface this module with CLEF (Meunier and Reyes, 1999), an implementation of g-tag.</Paragraph>
    <Paragraph position="5"> We intend to produce a text as shown in Table 7.</Paragraph>
  </Section>
class="xml-element"></Paper>