sequitur 0.1.23

Ruby implementation of the Sequitur algorithm. This algorithm automatically finds repetitions and hierarchical structures in a given sequence of input tokens. It encodes the input into a context-free grammar. The Sequitur algorithm can be used to a) compress a sequence of items, b) discover patterns in an sequence, c) generate grammar rules that can represent a given input.