Content deleted Content added
Mention LLMs as state of art for translation where beam search is often applied. |
Undid revision 1188649871 by DMH223344 (talk) - please cite sources and be more specific - "backtracking algorithm" in what sense? Also note that this case is already discussed below ("With an infinite beam width ...") |
||
Line 1:
{{short description|Heuristic search algorithm}}
In [[computer science]], '''beam search''' is a [[heuristic (computer science)|heuristic]] [[search algorithm]] that explores a graph by expanding the most promising node in a limited set. Beam search is an optimization of [[best-first search]] that reduces its memory requirements. Best-first search is a graph search which orders all partial solutions (states) according to
The term "beam search" was coined by [[Raj Reddy]] of [[Carnegie Mellon University]] in 1977.<ref>{{Cite book |last=Defense Technical Information Center |url=http://archive.org/details/DTIC_ADA049288 |title=DTIC ADA049288: Speech Understanding Systems. Summary of Results of the Five-Year Research Effort at Carnegie-Mellon University |date=1977-08-01 |language=english}}</ref>
| |||