<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2244">
  <Title>Optimal Multi-Paragraph Text Segmentation by Dynamic Programming</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> There exist several methods of calculating a similarity curve, or a sequence of similarity values, representing the lexical cohesion of successive text constituents, e.g., paragraphs. Methods for deciding the locations of fragment boundaries are, however, scarce. We propose a fragmentation method based on dynamic programming. The method is theoretically sound and guaranteed to provide an optimal splitting on the basis of a similarity curve, a preferred fragment length, and a cost function defined.</Paragraph>
    <Paragraph position="1"> The method is especially useful when control on fragment size is of importance.</Paragraph>
  </Section>
class="xml-element"></Paper>