The space of similarity measures is large and relatively unexplored, and the feature expectations that can be computed from forests extend beyond n-gram counts.
first, word lattices are a subclass of forests that have only one source node for each edge (i.e., a graph, rather than a hyper-graph).