The following are exectutable programs for grammars
make a set of rules for a SCFG.
make a set of rules for a SCFG.
train a set of rules for a SCFG.
Perform parsing using pre-trained grammar.
Build a weighted finite state transducer.
Run a weighted finite state transducer.
Train a n-gram from text.
Caldulate the perplexity etc of an n-gram.