Segmentation of Greek Text by Dynamic Programming

We introduce a dynamic programming algorithm to perform linear segmentation of concatenated texts by global minimization of a segmentation cost function which consists of: (a) within-segment word similarity (expressed in terms of the generalized density of the text dotplot) and (b) prior information regarding segment length. Our algorithm is evaluated on two Greek text collections and proves that it outperforms several other algorithms because it performs global optimization of a global cost function.