A Dynamic Programming Algorithm for the Segmentation of Greek Texts

Simple item page
dc.creatorFragkou, Pavlina
dc.date2003-10-21
dc.date.accessioned2026-07-07T03:20:28Z
dc.date.available2026-07-07T03:20:28Z
dc.descriptionIn this paper we introduce a dynamic programming algorithm to perform linear text segmentation by global minimization of a segmentation cost function which consists of: (a) within-segment word similarity and (b) prior information about segment length. The evaluation of the segmentation accuracy of the algorithm on a text collection consisting of Greek texts showed that the algorithm achieves high segmentation accuracy and appears to be very innovating and promissing.
dc.descriptionThis paper will appear in the Proceedings of the CONSOLE XII Conference (Patras, Greece, 2003)
dc.identifierhttps://arxiv.org/abs/cs/0310041
dc.identifierhttp://arxiv.org/abs/cs/0310041
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31841
dc.subjectComputation and Language
dc.subjectDigital Libraries
dc.subjectH.3.1; H.3.3; H.3.7
dc.titleA Dynamic Programming Algorithm for the Segmentation of Greek Texts
dc.typetext

Files

Collections

arXiv