Optimal Multi-Paragraph Text Segmentation by Dynamic Programming

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, 3 eps figures, LaTeX2e; includes errata; uses colacl, epsf, times

Scientific paper

There exist several methods of calculating a similarity curve, or a sequence of similarity values, representing the lexical cohesion of successive text constituents, e.g., paragraphs. Methods for deciding the locations of fragment boundaries are, however, scarce. We propose a fragmentation method based on dynamic programming. The method is theoretically sound and guaranteed to provide an optimal splitting on the basis of a similarity curve, a preferred fragment length, and a cost function defined. The method is especially useful when control on fragment size is of importance.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Optimal Multi-Paragraph Text Segmentation by Dynamic Programming 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 Optimal Multi-Paragraph Text Segmentation by Dynamic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Multi-Paragraph Text Segmentation by Dynamic Programming will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-236351

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.