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

>= 3.0.0

Authors

Dimitri Geshef

Versions

  1. 0.1.27

    1. source

      1. 0.1.27 source February 16, 2025 (34 KB)
  2. 0.1.26

    1. source

      1. 0.1.26 source February 15, 2025 (34 KB)
  3. 0.1.25

    1. source

      1. 0.1.25 source July 10, 2023 (34 KB)
  4. 0.1.24

    1. source

      1. 0.1.24 source July 01, 2023 (28.5 KB)
  5. 0.1.23

    1. source

      1. 0.1.23 source September 04, 2021 (30 KB)
Show all versions (35 total)

SHA 256 checksum

← Previous version