LLM Fundamentals →hardMultiple ChoiceObjective-mapped

1Z0-1127-25 LLM Fundamentals Practice Question

A research team is comparing two LLMs for a translation task. Model A uses greedy decoding, Model B uses beam search with width=5. Both models are otherwise identical. Which statement about their outputs is MOST likely true?

Answer choices

Why each option matters

Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.

Correct answer & explanation

✓

Model B will generally produce more fluent and accurate translations

Beam search considers multiple candidate sequences and selects the one with the highest overall probability, which often results in more fluent and accurate translations than greedy decoding, but at higher computational cost.

Answer analysis

Option-by-option breakdown

For each option: why learners choose it and why it is or isn't the right answer here.

✗
Model A will have higher BLEU scores than Model B
Why it's wrong here
Beam search typically yields higher BLEU scores because it produces sequences with higher n-gram overlap with references.
✓
Model B will generally produce more fluent and accurate translations
Why this is correct
Beam search explores multiple paths and picks the best sequence, often improving fluency and accuracy over greedy decoding.
✗
Model A will produce more diverse translations
Why it's wrong here
Greedy decoding is deterministic and less diverse; beam search can still be relatively deterministic but finds higher-probability sequences.
✗
Model B will have lower latency than Model A
Why it's wrong here
Beam search is computationally more expensive and thus slower.

Go deeper

1Z0-1127-25 LLM Fundamentals Practice Question

Why each option matters

Option-by-option breakdown

Related to this question