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.
Required Ruby Version
>= 1.9.1
Authors
Dimitri Geshef
Versions
- 0.1.27 February 16, 2025 (34 KB)
- 0.1.26 February 15, 2025 (34 KB)
- 0.1.25 July 10, 2023 (34 KB)
- 0.1.24 July 01, 2023 (28.5 KB)
- 0.1.23 September 04, 2021 (30 KB)
- 0.1.02 September 18, 2014 (23.5 KB)