@James Ooooh... the Sequitur algorithm <https://en.wikipedia.org/wiki/Sequitur_algorithm>, developed in 1997:* "*a recursive algorithm developed by Craig Nevill-Manning <https://en.wikipedia.org/wiki/Craig_Nevill-Manning> and Ian H. Witten <https://en.wikipedia.org/wiki/Ian_H._Witten> in 1997 that infers a hierarchical structure (context-free grammar <https://en.wikipedia.org/wiki/Context-free_grammar>) from a sequence of discrete symbols. The algorithm operates in linear space and time."
Yes.... that is very close to what LINECOMP does. I hadn't heard of Sequitur when I developed LINECOMP. The algorithms are also identical in time and space complexity. However, there are differences. I do only pairs while they have arbitrary length productions. Also Sequitur seems to work incrementally while I process the whole input at once. Maybe this is just a difference in implementation though. ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/Tb2cf064c700f181c-M00324a18aca4bb17f738d71f Delivery options: https://agi.topicbox.com/groups/agi/subscription
