---
title: Sequitur algorithm
slug: sequitur-algorithm
qid: 
snapshot: enwiki-001346462318
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1346462318
tags: [23118434, 23215384, 2330768, 23603337, 29176270, 7692542]
---

# Sequitur algorithm

> [!note] Provenance
> Snapshot `enwiki-001346462318` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1346462318> · Licensed CC BY-SA 4.0

Sequitur (or Nevill-Manning–Witten algorithm) is a recursive algorithm developed by Craig Nevill-Manning and Ian H. Witten in 1997 that infers a hierarchical structure (context-free grammar) from a sequence of discrete symbols. The algorithm operates in linear space and time. It can be used in data compression software applications.

Sequitur (or Nevill-Manning–Witten algorithm) is a recursive algorithm developed by Craig Nevill-Manning and Ian H. Witten in 1997 that infers a hierarchical structure (context-free grammar) from a sequence of discrete symbols. The algorithm operates in linear space and time. It can be used in data compression software applications. ==See also== Context-free grammar Data compression Lossless data compression Straight-line grammar Byte pair encoding ==References== ==External links== sequitur.info – the reference Sequitur algorithm implementation in C++, Java, and other languages
