8
edits
Changes
→Beam Search
* After the algorithm is finished we take the best option from the candidate sequences as our output
If we have at most <math>m</math> words in our final sentence, each state has <math>n</math> word options, and we maintain a maximum bin width size of <math>k</math>, this algorithm runs with a time complexity of <math>O(nmk log(k))</math>
[[File:Screenshot 2024-05-21 at 7.50.48 PM.png|thumb]]
