<?xml version="1.0" standalone="yes"?>
<Paper uid="W06-1403">
  <Title>Sydney, July 2006. c(c)2006 Association for Computational Linguistics CCG Chart Realization from Disjunctive Inputs</Title>
  <Section position="9" start_page="18" end_page="18" type="concl">
    <SectionTitle>
6 Conclusions
</SectionTitle>
    <Paragraph position="0"> This paper has presented a new chart realization algorithm for efficiently generating surface realizations from disjunctive logical forms, and has argued that the approach represents an improvement over that of (Shemtov, 1997) in terms of both usability and simplicity. The algorithm has been implemented as an extension to the OpenCCG hybrid symbolic/statistical realizer, and has recently been employed to generate n-best realization lists for reranking according to their predicted synthesis quality (Nakatsu and White, 2006), as well as to generate dialogues exhibiting individuality and alignment(Brockmann et al., 2005; Isard et al., 2005). An initial case study has shown that the algorithm works many times faster than sequential realization, with run times suitable for use in dialogue systems; a more comprehensive study of the algorithm's efficiency is planned for future work.</Paragraph>
  </Section>
class="xml-element"></Paper>