Figure 2From: Decoding HMMs using the k best paths: algorithms and applicationsK -best tree construction visualization. The solid lines represent path level nodes and edges, while dotted lines represent vertex level nodes and edges. A) The tree structure before any pruning or compressing. B) The tree structure after path and state nodes are removed. C) The final data structure, after all node merging.Back to article page