arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/9812005cs.CL
收藏

基于动态规划的多段文本最优分割

Optimal Multi-Paragraph Text Segmentation by Dynamic Programming

Oskari Heinonen

摘要:

存在几种计算相似性曲线或相似性值序列的方法,表示连续文本成分的词汇衔接,例如,段落。然而,确定碎片边界位置的方法却很少。提出了一种基于动态规划的分片方法。该方法在理论上是合理的,并保证在相似性曲线、优选片段长度和定义的成本函数的基础上提供最佳分裂。当控制片段大小很重要时,该方法特别有用。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑