Algorithm 2. The variable-length MEMM process

For $l=1,\mathrm{...},L_{\max }$ /* $L_{\max }$ is the largest step count */   For $c=1,2,\mathrm{...},C$   Calculate $P_{n-l+1:n}(c)=\max P(y_c^{n-l+1},\mathrm{...},y_c^n|x^{n-l+1:n})$;   End   If $\max P_{n-l+1:n}(c)$ is significantly larger than others    return $\arg \underset{c}{\max }{P}_{n-l+1:n}(c)$;  End End return $\arg \underset{c}{\max }{P}_{n-l+1:n}(c)$;