My favorites | Sign in
Project Home Downloads Wiki Issues Source
Project Information
Members
Links

http://sequitur.info/

SEQUITUR is an algorithm that infers a hierarchical structure from a sequence of discrete symbols by replacing repeated phrases with a grammatical rule that generates the phrase, and continuing this process recursively. The result is a hierarchical representation of the original sequence, which offers insights into its lexical structure. The algorithm is driven by two constraints that reduce the size of the grammar, and produce structure as a by-product.

Powered by Google Project Hosting