Advances in domain independent linear text segmentation

Freddy Y. Y. Choi (University of Manchester)

Advances in domain independent linear text segmentation

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cs/0003083 v1 pith:3DLMKULB submitted 2000-03-30 cs.CL

Freddy Y. Y. Choi (University of Manchester) This is my paper

classification cs.CL

keywords linearsegmentationtextaccurateadvancesboundaryclusteringcontext

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

This paper describes a method for linear text segmentation which is twice as accurate and over seven times as fast as the state-of-the-art (Reynar, 1998). Inter-sentence similarity is replaced by rank in the local context. Boundary locations are discovered by divisive clustering.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Semantic Source Code Segmentation using Small and Large Language Models
cs.SE 2025-07 conditional novelty 5.0 of 10

Fine-tuned encoder-only models such as CodeBERT outperform zero-shot and few-shot LLMs at semantic line-level segmentation of R code, and a new annotated R dataset, StatCodeSeg, is introduced.

Pith tools