---
title: "Text Segmentation as a Supervised Learning Task (2018)"
description: "The authors introduce WIKI-727K, a corpus of 727,746 English Wikipedia articles segmented… 11 references, cited by 66 papers here."
authors: ["Omri Koshorek", "Adir Cohen", "Noam Mor", "Michael Rotman", "Jonathan Berant"]
year: 2018
venue: "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers)"
source: "https://aclanthology.org/N18-2075/"
doi: "10.18653/v1/n18-2075"
licence: "CC BY 4.0 (ACL Anthology)"
licence_url: "https://creativecommons.org/licenses/by/4.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/koshorek-2018-text-segmentation-as-supervised-learning/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/koshorek-2018-text-segmentation-as-supervised-learning/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [2018](https://md.research.elamur.ai/free/en/papers/2018/page/3/) / Text Segmentation as a Supervised Learning Task

# Text Segmentation as a Supervised Learning Task

**Authors:** [Omri Koshorek](https://md.research.elamur.ai/free/en/authors/omri-koshorek/), Adir Cohen, Noam Mor, Michael Rotman and [Jonathan Berant](https://md.research.elamur.ai/free/en/authors/jonathan-berant/) · **Year:** 2018 · **Venue:** [Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers)](https://md.research.elamur.ai/free/en/venues/naacl/) ([NAACL 2018](https://md.research.elamur.ai/free/en/venues/naacl/2018/)) · **Publisher:** [Association for Computational Linguistics](https://md.research.elamur.ai/free/en/publishers/association-for-computational-linguistics/) · **Licence:** [CC BY 4.0 (ACL Anthology)](https://creativecommons.org/licenses/by/4.0/)

**Links:** [Publisher's page](https://aclanthology.org/N18-2075/) · [PDF](https://aclanthology.org/N18-2075.pdf) · [DOI 10.18653/v1/n18-2075](https://doi.org/10.18653/v1/n18-2075) · [OpenAlex](https://openalex.org/W2794904608)

**Citations:** 162 citations (OpenAlex, 2026-10-14) · [66](https://md.research.elamur.ai/free/en/papers/koshorek-2018-text-segmentation-as-supervised-learning/cited-by/) in our library, of the 141,840 papers whose bibliographies we read

## Summary
Koshorek et al. reframe text segmentation, which splits a document into topically coherent contiguous parts, as supervised learning. Earlier systems relied on unsupervised heuristics, topic models or graph methods, mainly because labeled corpora were tiny or synthetic. The authors introduce WIKI-727K, a corpus of 727,746 English Wikipedia articles segmented automatically using each article's table of contents. Each sentence receives a binary label marking whether it closes a segment. Their model is hierarchical. A bidirectional LSTM with max-pooling builds a vector for each sentence, and a second bidirectional LSTM reads these vectors and predicts a boundary probability for each sentence. Boundaries are then chosen by thresholding. Evaluated with the Pk metric, the model clearly beats GraphSeg and a random baseline on Wikipedia text and comes close to human annotators on a 50-document sample. It is weaker on Choi's synthetic dataset and on the chemistry-themed ELEMENTS set. It also runs much faster than GraphSeg. The work shows that cheap, naturally structured data can support learned segmenters for real text, and both the corpus and the code are publicly released.

## Key points
- **WIKI-727K corpus:** 727,746 documents split 80/10/10 into train, development and test. It keeps the full hierarchical segmentation, sentences are split with NLTK's PUNKT tokenizer, and it is released at github.com/koomri/text-segmentation.
- **Training setup:** the model learns only top-level segments and uses GoogleNews word2vec embeddings. The first segment of each article, typically a broad summary, is dropped during training.
- **Pk results on WIKI-50 (lower is better):** the model scores 18.24, compared with GraphSeg at 63.56, the random baseline at 52.65 and humans at 14.97. On the full WIKI-727K test set the model reaches 22.13.
- **Mixed results on older benchmarks:**
  - On CITIES, the model beats Chen et al. (2009), scoring 18.14 versus 22.1 with word-level Pk.
  - On ELEMENTS, it trails Chen et al., scoring 33.82 versus 20.1.
  - On CHOI, GraphSeg wins, scoring 5.6–7.2 versus 26.26.
- **Runtime:** the model scales linearly with text length and averages 1.6 s per document on a laptop CPU, compared with 23.6 s for GraphSeg on WIKI-50.

*Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.*

## Institutions

- [Tel Aviv University](https://md.research.elamur.ai/free/en/universities/tel-aviv-university/) — University, Tel Aviv, Israel · 67 works · 10,006 citations

📚 Shelves (4): [🖥️ Computer Science](https://md.research.elamur.ai/free/en/shelves/computer-science/) · 9,085 works · [🤖 Artificial Intelligence](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · 8,888 works · [🎭 Arts and Humanities](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · 9,296 works · [🗣️ Language and Linguistics](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · 9,206 works

## Cite

Cite as: Omri Koshorek, Adir Cohen, Noam Mor, Michael Rotman and Jonathan Berant. 2018. Text Segmentation as a Supervised Learning Task. Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers).

The paper itself, not this page. BibTeX from the library's record of the work.

```bibtex
@inproceedings{koshorek2018text,
  title = {{Text Segmentation as a Supervised Learning Task}},
  author = {Omri Koshorek, Adir Cohen, Noam Mor, Michael Rotman and Jonathan Berant},
  booktitle = {Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers)},
  year = {2018},
  doi = {10.18653/v1/n18-2075},
  url = {https://doi.org/10.18653/v1/n18-2075}
}
```

- [← previous Strong Baselines for Neural Semi-Supervised Learning under Domain Shift](https://md.research.elamur.ai/free/en/papers/ruder-2018-strong-baselines-neural-semi-supervised/)
- [next → Findings of the Third Shared Task on Multimodal Machine Translation](https://md.research.elamur.ai/free/en/papers/barrault-2018-findings-third-shared-task-multimodal/)
- [↑ back to papers of 2018](https://md.research.elamur.ai/free/en/papers/2018/page/3/)

## References

11 references, 3 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. Martin Riedl and Chris Biemann. 2012. Topictiling: a text segmentation algorithm based on lda. In Proceedings of ACL 2012 Student Research Workshop. Association for Computational Linguistics, pages 37–42. [find](https://scholar.google.com/scholar?q=Martin+Riedl+and+Chris+Biemann%2E+2012%2E+Topictiling%3A+a+text+segmentation+algorithm+based+on+lda%2E+In+Proceedings+of+ACL+2012+Student+Research+Workshop%2E+Association+for+Computational+Linguistics%2C+pages+37)
2. Doug Beeferman, Adam Berger, and John Lafferty. 1999. Statistical models for text segmentation. Machine learning 34(1):177–210. [find](https://scholar.google.com/scholar?q=Doug+Beeferman%2C+Adam+Berger%2C+and+John+Lafferty%2E+1999%2E+Statistical+models+for+text+segmentation%2E+Machine+learning+34%281%29%3A177%E2%80%93210%2E)
3. S. Bird, E. Loper, and E. Klein. 2009. Natural Language Processing with Python. OReilly Media Inc. [find](https://scholar.google.com/scholar?q=S%2E+Bird%2C+E%2E+Loper%2C+and+E%2E+Klein%2E+2009%2E+Natural+Language+Processing+with+Python%2E+OReilly+Media+Inc%2E)
4. Masao Utiyama and Hitoshi Isahara. 2001. [A statistical model for domain-independent text segmentation](https://md.research.elamur.ai/free/en/papers/utiyama-2001-statistical-model-domain-independent-text/). In Proceedings of the 39th Annual Meeting on Association for Computational Linguistics. Association for Computational Linguistics, pages 499–506.
5. D. Blei, A. Ng, and M. I. Jordan. 2003. [Latent Dirichlet allocation](https://md.research.elamur.ai/free/en/papers/blei-2003-latent-dirichlet-allocation/). Journal of Machine Learning Research (JMLR) 3:993–1022.
6. Thorsten Brants, Francine Chen, and Ioannis Tsochantaridis. 2002. Topic-based document segmentation with probabilistic latent semantic analysis. In Proceedings of the eleventh international conference on Information and knowledge management. ACM, pages 211–218. [find](https://scholar.google.com/scholar?q=Thorsten+Brants%2C+Francine+Chen%2C+and+Ioannis+Tsochantaridis%2E+2002%2E+Topic%2Dbased+document+segmentation+with+probabilistic+latent+semantic+analysis%2E+In+Proceedings+of+the+eleventh+international+conference)
7. Harr Chen, SRK Branavan, Regina Barzilay, and David R Karger. 2009. Global models of document structure using latent permutations. In Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics. Association for… [find](https://scholar.google.com/scholar?q=Harr+Chen%2C+SRK+Branavan%2C+Regina+Barzilay%2C+and+David+R+Karger%2E+2009%2E+Global+models+of+document+structure+using+latent+permutations%2E+In+Proceedings+of+Human+Language+Technologies%3A+The+2009+Annual+Confer)
8. Freddy YY Choi. 2000. [Advances in domain independent linear text segmentation](https://md.research.elamur.ai/free/en/papers/choi-2000-advances-domain-independent-linear-text/). In Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference. Association for Computational Linguistics, pages 26–33.
9. Chris Fournier. 2013. Evaluating Text Segmentation using Boundary Edit Distance. In Proceedings of 51st Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics, Stroudsburg, PA, USA, page to appear. [find](https://scholar.google.com/scholar?q=Chris+Fournier%2E+2013%2E+Evaluating+Text+Segmentation+using+Boundary+Edit+Distance%2E+In+Proceedings+of+51st+Annual+Meeting+of+the+Association+for+Computational+Linguistics%2E+Association+for+Computational+L)
10. Goran Glavaš, Federico Nanni, and Simone Paolo Ponzetto. 2016. Unsupervised text segmentation using semantic relatedness graphs. Association for Computational Linguistics. [find](https://scholar.google.com/scholar?q=Goran+Glavas%CC%8C%2C+Federico+Nanni%2C+and+Simone+Paolo+Ponzetto%2E+2016%2E+Unsupervised+text+segmentation+using+semantic+relatedness+graphs%2E+Association+for+Computational+Linguistics%2E)
11. Marti A Hearst. 1994. Multi-paragraph segmentation of expository text. In Proceedings of the 32nd annual meeting on Association for Computational Linguistics. Association for Computational Linguistics, pages 9–16. [find](https://scholar.google.com/scholar?q=Marti+A+Hearst%2E+1994%2E+Multi%2Dparagraph+segmentation+of+expository+text%2E+In+Proceedings+of+the+32nd+annual+meeting+on+Association+for+Computational+Linguistics%2E+Association+for+Computational+Linguistics)

*Updated 24 October 2026*