Sequitur algorithm: Difference between revisions

Revision as of 12:57, 15 January 2009

Revision as of 20:03, 24 May 2009

Line 1:

{{redirect6|Sequitur|the Latin phrase|Non sequitur|the cutting implement|Secateur}}

'''Sequitur''' (or ''Nevill-Manning algorithm'') is a recursive algorithm developed by [[Craig Nevill-Manning]] and [[Ian H. Witten]] in 1997<ref name=Nevill-manning1997>{{cite journal

| author = Nevill-Manning, C.G.

Line 9 ⟶ 7:

| url = http://arxiv.org/abs/cs/9709102

| accessdate = 2008-04-10

}}</ref> that infers a hierarchical structure ([[Context-free_grammar|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.

== Method summary ==