2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31841In 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 a text collection consisting of Greek texts showed that the algorithm achieves high segmentation accuracy and appears to be very innovating and promissing.This paper will appear in the Proceedings of the CONSOLE XII Conference (Patras, Greece, 2003)Computation and LanguageDigital LibrariesH.3.1; H.3.3; H.3.7text