Sequitur algorithm
Sequitur (or Nevill-Manning 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.
- Comment
- enSequitur (or Nevill-Manning 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.
- Has abstract
- enSequitur (or Nevill-Manning 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.
- Hypernym
- Algorithm
- Is primary topic of
- Sequitur algorithm
- Label
- enSequitur algorithm
- Link from a Wikipage to an external page
- www.sequitur.info/
- Link from a Wikipage to another Wikipage
- Bigram
- Byte pair encoding
- Category:Lossless compression algorithms
- Context-free grammar
- Craig Nevill-Manning
- Data compression
- Ian H. Witten
- Lossless compression
- Nonterminal symbol
- Straight-line grammar
- Terminal symbol
- SameAs
- 4RJpT
- m.04ksxx
- Q477535
- Sequitur
- Sequitur
- Sequitur algorithm
- Sequitur-algoritmi
- Алгоритм Sequitur
- Subject
- Category:Lossless compression algorithms
- WasDerivedFrom
- Sequitur algorithm?oldid=1096714474&ns=0
- WikiPageLength
- 4537
- Wikipage page ID
- 1234577
- Wikipage revision ID
- 1096714474
- WikiPageUsesTemplate
- Template:Compression methods
- Template:Reflist