Sequitur algorithm
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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
Text derived from https://en.wikipedia.org/w/index.php?oldid=1346462318 under CC BY-SA 4.0; modifications have been made.