Text segmentation by product partition models and dynamic programming

In this paper, we use Barry and Hartiganʹs Product Partition Models 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.