Linear Text Segmentation using a Dynamic Programming Algorithm

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.

• Type: Conference
• Year: 2003
• Where: EACL
• Authors: Athanasios Kehagias, Pavlina Fragkou, Vassilios Petridis
• Keywords: EACL 2003, Linear Text Segmentation, Natural Language Processing, Segmentation Accuracy, Segmentation Cost Function