2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/33106There 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. The method is especially useful when control on fragment size is of importance.5 pages, 3 eps figures, LaTeX2e; includes errata; uses colacl, epsf, timesComputation and LanguageI.2.7text