Optimal Multi-Paragraph Text Segmentation by Dynamic Programming
<|reference_start|>Optimal Multi-Paragraph Text Segmentation by Dynamic Programming: There 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.<|reference_end|>
@article{heinonen1998optimal,
    title={Optimal Multi-Paragraph Text Segmentation by Dynamic Programming},
    author={Oskari Heinonen (University of Helsinki)},
    journal={Proceedings of COLING-ACL '98, pp. 1484-1486, Montreal, Canada},
    year={1998},
    archivePrefix={arXiv},
    eprint={cs/9812005},
    primaryClass={cs.CL}
}