Linear text segmentation using a dynamic programming algorithm

  • Authors:
  • Athanasios Kehagias;Fragkou Pavlina;Vassilios Petridis

  • Affiliations:
  • Aristotle Univ of Thessaloniki, Greece;Aristotle Univ of Thessaloniki, Greece;Aristotle Univ of Thessaloniki, Greece

  • Venue:
  • EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we introduce a dynamic programming algorithm to perform linear text segmentation by global minimization of a segmentation cost function which consists of: (a) within-segment word similarity and (b) prior information about segment length. The evaluation of the segmentation accuracy of the algorithm on Choi's text collection showed that the algorithm achieves the best segmentation accuracy so far reported in the literature.