Text Segmentation by Product Partition Models and Dynamic Programming
Thanasis Kehagias, Pavlina Fragkou, V. Petridis, Anna Nicolaou · SSRN Electronic Journal · 2003
In this paper we use Barry and Hartigan’s to formulate text segmentation as an optimization problem, which we solve by a fast dynamic programming algorithm. We test the algorithm on Choi’s segmentation benchmark and achieve the best segmentation results so far reported in the literature.