We also provide the first results on the limits of online Markov decoding under latency constraints.
we craft lower bounds for the online approximation of Viterbi algorithm in both deterministic and randomized ergodic chain settings.