In terms of computational complexity, the number of stack sequences Order(S m ) to search over during the first decoding step increases exponentially with the number of input mandatory stacks.
the proposed three-stage architecture allows for tractable decoding by (a) pruning low probability paths during each Viterbi search, and (b) pruning low probability sequences from the output n-best list of each component.