| Background | Therefore, it has 22:0 T4Z time complexity if it terminates at the m-th iteration. |
| Background | In the best case in which m = 0, the time complexity is T. In the worst case in which m = [log2 L] — 1 is the ceiling function which maps a real number to the smallest following integer), the time complexity is |
| Introduction | Unfortunately, due to its 0(TL2) time complexity , where T is the input token size and L is the label size, the Viterbi decoding can become prohibitively slow when the label size is large (say, larger than 200). |