Optimal Multi-Paragraph Text Segmentation by Dynamic Programming
| dc.creator | Heinonen, Oskari | |
| dc.date | 1998-12-04 | |
| dc.date.accessioned | 2026-07-07T03:23:51Z | |
| dc.date.available | 2026-07-07T03:23:51Z | |
| dc.description | 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. | |
| dc.description | 5 pages, 3 eps figures, LaTeX2e; includes errata; uses colacl, epsf, times | |
| dc.identifier | https://arxiv.org/abs/cs/9812005 | |
| dc.identifier | http://arxiv.org/abs/cs/9812005 | |
| dc.identifier | Proceedings of COLING-ACL '98, pp. 1484-1486, Montreal, Canada | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33106 | |
| dc.subject | Computation and Language | |
| dc.subject | I.2.7 | |
| dc.title | Optimal Multi-Paragraph Text Segmentation by Dynamic Programming | |
| dc.type | text |