Sequitur algorithm: Difference between revisions

Revision as of 21:06, 10 May 2008

Revision as of 20:33, 22 June 2008

Line 1:

:''{{redirect6|Sequitur redirects here. For |the Latin phrase, see [[|Non sequitur]]. For |the cutting implement, see [[|Secateur]].''}}

'''Sequitur''' (or ''Nevill-Manning algorithm'') is an recursive algorithm that infers a hierarchical structure from a sequence of discrete symbols developed by [[Craig Nevill-Manning]] and [[Ian H. Witten]] in 1997.<ref name=Nevill-manning1997>{{cite journal