Forward–backward algorithm: Difference between revisions

Content deleted Content added
No edit summary
Tags: Mobile edit Mobile web edit
Pseudocode: reduce line length
Line 291:
result = 0
for each neighboring state n:
result = result + (transition probability from guessState to
n given observation element at sequenceIndex)
* ForwardBackward(n, sequenceIndex+1)
save result for (guessState, sequenceIndex)