希腊文文本切分的动态规划算法
A Dynamic Programming Algorithm for the Segmentation of Greek Texts
摘要:
在本文中,我们介绍了一个动态规划算法进行线性文本分割的分割成本函数,其中包括:(a)段内的词相似性和(b)段长度的先验信息的全局最小化。在一个由希腊文本组成的文本集上对该算法的分割精度进行了评估,结果表明,该算法具有很高的分割精度,具有很大的创新性和应用前景。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。