January 2018
Beginner to intermediate
284 pages
8h 35m
English
Beam Search is a heuristic search algorithm that explores a graph by expanding the most promising node in a limited set. It can be considered as an optimization of the best-first search that reduces its memory requirements. Basically, it’s an iterative approach where, at each step or time t, only consider the set of k best sentences (with length = t) to generate the sentence of t + 1. For all resulting sentences with length equals t + 1, only keep the best k of them.
Read now
Unlock full access