<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2244">
  <Title>Optimal Multi-Paragraph Text Segmentation by Dynamic Programming</Title>
  <Section position="5" start_page="1485" end_page="1486" type="concl">
    <SectionTitle>
4 Conclusions
</SectionTitle>
    <Paragraph position="0"> In this article, we presented a method for detecting fragment boundaries in text. The fragmentation method is based on dynamic programming and is guaranteed to give an optimal solution with respect to a similarity curve, a preferred fragment length, and a parametric fragment-length cost function defined. The method is independent of the similarity calculation. This means that any method, not necessarily based on lexical cohesion, producing a suitable sequence of similarities can be used prior to our fragmentation method. For example, the lexical cohesion profile (Kozima, 1993) should be perfectly usable with our fragmentation method.</Paragraph>
    <Paragraph position="1">  The method is especially useful when control over fragment size is required. This is the case in passage retrieval since windows of 1000 bytes (Wilkinson and Zobel, 1995) or some hundred words (Callan, 1994) have been proposed as best passage sizes. Furthermore, we believe that fragments of reasonably similar size are beneficial in our intended purpose of document assembly.</Paragraph>
  </Section>
class="xml-element"></Paper>