A Dynamic Programming Algorithm for the Segmentation of Greek Texts

Details A Dynamic Programming Algorithm for the Segmentation of Greek Texts A Dynamic Programming Algorithm for the Segmentation of Greek Texts

2003-10-21

arxiv.org/abs/cs/0310041v1

Computer Science

Computation and Language

This paper will appear in the Proceedings of the CONSOLE XII Conference (Patras, Greece, 2003)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Dynamic Programming Algorithm for the Segmentation of Greek Texts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Dynamic Programming Algorithm for the Segmentation of Greek Texts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Dynamic Programming Algorithm for the Segmentation of Greek Texts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509740