  Algorithms on grammars/transducers with context-free derivations: hypergraph
reachability, shortest path, and inside-outside pruning of 'relatively useless'
arcs that are unused by any near-shortest paths.
