A Dynamic Programming Algorithm for the Segmentation of Greek Texts

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
This paper will appear in the Proceedings of the CONSOLE XII Conference (Patras, Greece, 2003)

Keywords

Computation and Language, Digital Libraries, H.3.1; H.3.3; H.3.7

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31841

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0310041
 http://arxiv.org/abs/cs/0310041

Collections

arXiv