Changes

Jump to: navigation, search

Isaac's Algorithm Notes

43 bytes added, 22 May
Other Notes
[[File:Screenshot 2024-05-21 at 6.56.45 PM.png|thumb]]
* ensures that all probabilities at each state are in the range (0,1) and sum to 1
'''Semi-log plot Log semiring trick'''* Using semi-[https://en.wikipedia.org/wiki/Log_semiring log plot semiring] to deal with very small probability values trick: Given <math>P</math> as the cumulative probability score of all words in the sequence so far, <math>P=p_0*p_1*p_2...p_n</math>
* Since the value of <math>P</math> can become very small, we can run into computational rounding errors. One strategy around this is to take the natural log of the summation of all p values and use this to compare values of <math>P</math>. This works because
* <math>P=p_0*p_1*p_2...p_n</math>
* <math>log(P)=log(p_0)+log(p_1)+log(p_2)...+log(p_n)</math>
* if <math>(P_1>P_2) => log(P_1)>log(P_2)</math>, so values can still be compared in this form
431
edits

Navigation menu