An algorithm is generating a sequence, keeping the 2 most likely partial sequences (the 'beam') at each step. At the current step, the beam contains sequence 'A' (score: -1.0) and sequence 'B' (score: -2.0). The algorithm then identifies the most likely next tokens to extend these sequences:

• For 'A', the next tokens are 'C' (score: -1.5) and 'D' (score: -1.6).
• For 'B', the next tokens are 'E' (score: -0.1) and 'F' (score: -0.2).

Given that scores are combined by addition, which of the foll

Forming the Candidate Set in a Search Algorithm

In a sequence generation algorithm that maintains a fixed number of top hypotheses at each step, the candidate set for the current step is formed by taking the newly generated sequences and adding them to the set of hypotheses from the previous step.