Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is beam search?

  • A.A search using a beam shaped region of the state space
  • B.A search that widens its frontier as the goal is approached
  • C.Best first search keeping only the best k nodes at each level
  • D.A search that follows a single beam of nodes to the goal

Answer: C

Beam search bounds the frontier to a fixed width, discarding everything else, which makes memory constant and the search fast but sacrifices both completeness and optimality. It is widely used in speech recognition and machine translation where an approximate answer quickly is worth more than a guaranteed one slowly. The other options describe no standard algorithm. Trading guarantees for a fixed resource budget is often the right decision when the budget is hard and the guarantee is soft.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.