Talk:Sequitur algorithm

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing ??? This article has not yet received a rating on the project's importance scale.

"a grammar" <-- doesn't it seem ironic to have poor grammar, while talking ABOUT grammar? Or perhaps this has some alternate meaning I'm not able to see. Anyone have thoughts on this? --70.66.98.187 05:47, 3 November 2007 (UTC)Reply

The word "Grammar" is used with a definite or indefinite article when discussing a specific grammar used to describe a language. Used in this way "a grammar" basically means "a set of rules used to describe a language", so for instance we have books such as "A Latin Grammar" written by Charles Bennet in 1895 which lists and explains the grammatical rules used to write Latin. The word, "grammar" may also be used without an article when discussing grammar in general or as a field of study. Both uses are grammatical in their proper places. Read the grammar article for instances of both usages. The SEQUITUR article discusses an algorithm which generates grammars (in the former sense). So its use of the words, "a grammar", is perfectly grammatical. -- Derek Ross | Talk 15:51, 17 April 2008 (UTC)Reply

This article is in need of attention from an expert on the subject. The sections that need attention may be noted below.

This article lacks any mention or analysis of the mathematical properties of this method in running time, or optimality of the deduced form. — MaxEnt 19:10, 28 April 2018 (UTC)Reply

Now I notice "linear time and space" which I guess is all that needs to be said about runtime, even though some linear algorithms are not especially fast (e.g. linear in the number of symbols processed, but non-linear in the number of distinct symbols in the alphabet). — MaxEnt 19:15, 28 April 2018 (UTC)Reply

The abstract synopsis for Identifying Hierarchical Structure in Sequences: A linear-time algorithm styles the name as SEQUITUR (and not just on first use). — MaxEnt 19:18, 28 April 2018 (UTC)Reply