BETAmodules.com is in beta — open to partnerships & joint ventures.Build with us
modules.com
⌘K

sequitur

v0.1.27RubyGems· Ruby

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.

The verdict
Aging — last published over a year ago — check before adopting. Check the repo for activity before adopting.
Check the repo for activity before adopting.
Live from the RubyGems registry · derived rules, not AI
How it scores
MaintenanceAging
PopularityNiche
SecurityClean
LicensePermissive
DepsZero deps
Maintenance
Last published over a year ago — check before adopting.
Popularity
8 downloads / week
Security
No known advisories for this version (OSV).
License
MIT
Dependencies
No runtime dependencies
Recent releases
  • 0.1.27over a year ago
  • 0.1.26over a year ago
  • 0.1.252 years ago
  • 0.1.242 years ago
  • 0.1.234 years ago
  • 0.1.226 years ago
  • 0.1.207 years ago
  • 0.1.198 years ago
sequitur — 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. (Ruby / RubyGems) · Modules