<s>
Iterative	B-Error_Name
Viterbi	I-Error_Name
decoding	I-Error_Name
is	O
an	O
algorithm	O
that	O
spots	O
the	O
subsequence	O
S	O
of	O
an	O
observation	O
O	O
=	O
{	O
o1	O
,	O
...	O
,	O
on}	O
having	O
the	O
highest	O
average	O
probability	O
(	O
i.e.	O
,	O
probability	O
scaled	O
by	O
the	O
length	O
of	O
S	O
)	O
of	O
being	O
generated	O
by	O
a	O
given	O
hidden	O
Markov	O
model	O
M	O
with	O
m	O
states	O
.	O
</s>
<s>
The	O
algorithm	O
uses	O
a	O
modified	O
Viterbi	B-Algorithm
algorithm	I-Algorithm
as	O
an	O
internal	O
step	O
.	O
</s>
<s>
A	O
faster	O
algorithm	O
consists	O
of	O
an	O
iteration	O
of	O
calls	O
to	O
the	O
Viterbi	B-Algorithm
algorithm	I-Algorithm
,	O
reestimating	O
a	O
filler	O
score	O
until	O
convergence	O
.	O
</s>
