article · 2003

Linear text segmentation using a dynamic programming algorithm

Athanasios Kehagias, Pavlina Fragkou, Vassilios Petridis

Cited by 24Open access

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 Choi's text collection showed that the algorithm achieves the best segmentation accuracy so far reported in the literature.

Cite this paper

APA 7

Kehagias, A., Fragkou, P., & Petridis, V. (2003). Linear text segmentation using a dynamic programming algorithm. https://doi.org/10.3115/1067807.1067831

MLA 9

Kehagias, Athanasios, et al. “Linear text segmentation using a dynamic programming algorithm.” vol. 1, 2003, p. 171, https://doi.org/10.3115/1067807.1067831.

Chicago

Kehagias, Athanasios, Pavlina Fragkou, and Vassilios Petridis. 2003. “Linear text segmentation using a dynamic programming algorithm.” https://doi.org/10.3115/1067807.1067831.

Harvard

Kehagias, A., Fragkou, P. and Petridis, V. (2003) ‘Linear text segmentation using a dynamic programming algorithm’. Available at: https://doi.org/10.3115/1067807.1067831.

BibTeX

@article{kehagias2003linear,
  title = {{Linear text segmentation using a dynamic programming algorithm}},
  author = {Kehagias, Athanasios and Fragkou, Pavlina and Petridis, Vassilios},
  volume = {1},
  pages = {171},
  year = {2003},
  doi = {10.3115/1067807.1067831}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.