next up previous
Next: Discussion Up: SEGMENTATION Previous: Final Table

Algorithm

Given a string of letters s and a dictionary D with (unigram) probabilities, find the probability of the most likely sequence of words.


\begin{algorithm}
{Maxprob}{s, D}
 n \= \vert s\vert \\  p[n+1] \= 1.0 \\  \begi...
 ...vert] \\  q[i] = w
 \end{IF} \end{FOR} \end{FOR} \\  \RETURN p[1]\end{algorithm}


Guangwei Yuan
12/4/1999