D08-1001 . Thus , our task generalizes linear text segmentation to multiple levels . A meanwhile
W08-2232 paper proposes a new method of linear text segmentation based on lexical cohesion of
D11-1026 presented APS -- a new algorithm for linear text segmentation . APS takes into account the
D11-1026 paper presents a new algorithm for linear text segmentation . It is an adaptation of Affinity
W08-2232 paper proposes a new method of linear text segmentation based on lexical cohesion of
D08-1001 approach towards domainindependent linear text segmentation , C99 , is presented in Choi
E03-1058 respective IS patterns . <title> Linear Text Segmentation using a Dynamic Programming Algorithm
A00-2004 Advances in domain independent linear text segmentation </title> Freddy Y Y Choi Abstract
D11-1026 International Scholarship . <title> Linear Text Segmentation Using Affinity Propagation </title>
A00-2004 This paper describes a method for linear text segmentation which is twice as accurate and
D08-1001 closely related to the field of linear text segmentation with the goal to partition text
N10-1133 sections using a publicly available linear text segmentation algorithm by ( Utiyama and Isa
W01-0514 This paper describes a method for linear text segmentation that is more accurate or at least
S14-1017 segmenter is TT . It performs linear text segmentation based on a pretrained LDA topic
E03-1058 local optimiza - tion ) to perform linear text segmentation . A relevant work has been proposed
C02-1033 topic segmentation , also called linear text segmentation , and to the TDT ( Topic Detection
W14-4917 We are aware of recent works in linear text segmentation such as ( Kazant - seva and Szpakowicz
E03-1058 programming algorithm to perform linear text segmentation by global minimization of a segmentation
hide detail