Categories: None [Edit]
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.
Total
Ranking: 20,102 of 186,698
Downloads: 76,173
Daily
Ranking: 47,572 of 186,685
Downloads: 8
Downloads Trends
Ranking Trends
Num of Versions Trends
Popular Versions (Major)
Popular Versions (Major.Minor)
Depended by
Rank | Downloads | Name |
---|
Owners
# | Gravatar | Handle |
---|---|---|
1 | famished-tiger |