One common decoding technique is to implement a dynamic program, thus avoiding the explicit enumeration of all analyses for a given timestamp (Huang, 2008).
all other leaves are marked with a↓ and are called substitution nodes.