RubyGems Navigation menu

sequitur 0.1.20

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.

Gemfile:
=

installation:
=

Versions:

  1. 0.1.27 February 16, 2025 (34 ko)
  2. 0.1.26 February 15, 2025 (34 ko)
  3. 0.1.25 July 10, 2023 (34 ko)
  4. 0.1.24 July 01, 2023 (28,5 ko)
  5. 0.1.23 September 04, 2021 (30 ko)
  6. 0.1.20 January 03, 2019 (29 ko)
Voir toutes les versions (35)

Dépendances de Development (5):

coveralls >= 0.7.0, ~> 0.7
rake >= 10.0.0, ~> 10.0.0
rspec >= 3.0.0, ~> 3.0.0
simplecov >= 0.8.0, ~> 0.8.0
rubygems >= 2.0.0, ~> 2.0
Show all transitive dependencies

Propriétaires:

Auteurs:

  • Dimitri Geshef

Total de contrôle SHA 256:

=
← Version précédente Version suivante →

Total de téléchargements 75 393

Pour cette version 1 622

Version publiée:

License:

MIT

Version de Ruby requise: >= 2.0.0

Liens:

Page d'accueil Documentation Télécharger Review changes Badge Abonnement RSS Signaler un abus Reverse dependencies