Quiz Space

Large Language Models · End Term · 31 Aug 2025 · May 2025 term · Set QDB1

Question 1: Given the input string: moonlight And the following vocab…

Question 1

+2 marksOne correct option

Given the input string:

moonlight

And the following vocabulary of subword tokens with their corresponding log-probabilities:

SubwordLog-Probability (base ee)
moon-0.4
light-1.0
moonlight-1.8
moo-0.3
nlight-0.6
n-2.0
li-0.5
ght-0.5

Using the Viterbi algorithm (as used in the SentencePiece tokenizer), determine the most probable tokenization of the input string. The probability of a tokenized sequence is the sum of the log-probabilities of the selected subwords. Only subwords from the vocabulary may be used.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B
See the whole paperTake it as a mock test

Question 1 of 17 in the IIT Madras BS Large Language Models (LLM) End Term paper sat on 31 Aug 2025, in the May 2025 term (IIT M DEGREE AN EXAM QDB3 31 Aug 2025). It carries 2 marks.

More questions from this paper

  1. Q2Figure question
  2. Q3Which of the following statements about subword tokenizers (e.g., Byte Pair Encoding, SentencePiece) is true?
  3. Q4A GPT-based model is fine-tuned for story generation. During evaluation, you test different decoding strategies on the …
  4. Q5Which of the following are valid design choices when building a transformer-based language model?
  5. Q6Which of the following statements about Top-k and Nucleus (Top-p) sampling are correct?
  6. Q7Which of the following preprocessing steps are commonly required when preparing data for transformer models like BERT?
  7. Q8Suppose a language model outputs the following logits for a vocabulary of size 4: | Token | Logit | |---|---| | cat | 1…
  8. Q9For the input “you enjoy tea often”, compute the final representation of the word “tea” after the attention layer (i.e.…
  9. Q10Suppose the input sentence is “tea you enjoy often”. Using the same matrices and processing method, what is the attenti…
  10. Q11Figure question
  11. Q12Figure question
  12. Q13What percentage of entries in the attention matrix are zero (i.e., the sparsity)?
  13. Q14Consider the short sentence: “large language models are cool” A transformer processes this sequence using the naive rel…
  14. Q15Consider the short sentence: “large language models are cool” A transformer processes this sequence using the naive rel…
  15. Q16Consider the short sentence: “large language models are cool” A transformer processes this sequence using the naive rel…
  16. Q17Consider the short sentence: “large language models are cool” A transformer processes this sequence using the naive rel…