Question 15
Consider the following dictionary with the number of word occurrences in a corpus:
wo = { "taught" : 2, "laughter" : 1, "drought" : 4, "tough" : 5}Note: Append </w> to each word at the end.
You will be working with BPE algorithm, answer the given subquestions in that context:
What is the minimum number of merges, after which there is a token with exactly 3 English letters?