A Dynamic Programming Algorithm for the Segmentation of Greek Texts
Computation and Language
2007-05-23 v1 Digital Libraries
Abstract
In 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.
Cite
@article{arxiv.cs/0310041,
title = {A Dynamic Programming Algorithm for the Segmentation of Greek Texts},
author = {Pavlina Fragkou},
journal= {arXiv preprint arXiv:cs/0310041},
year = {2007}
}
Comments
This paper will appear in the Proceedings of the CONSOLE XII Conference (Patras, Greece, 2003)