Constructing small language models from grammars

This paper presents a method for constructing small word graphs from regular grammars in a way to reduce the number of vertices in the resulting graph. Our method works at the grammar level instead of intermediate forms like finite automata. It represents a prime alternative to exact minimization algorithms, and is distinguished by its simplicity, its flexibility and by the fact that it avoids the determinization of the resulting graph or automaton.