<?xml version="1.0" standalone="yes"?>
<Paper uid="P04-1051">
  <Title>Computing Locally Coherent Discourses</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measures from the literature.</Paragraph>
    <Paragraph position="1"> We also show that the discourse ordering problem is NP-complete and cannot be approximated.</Paragraph>
  </Section>
class="xml-element"></Paper>