Question 13
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:
Which of the following pairs has the highest frequency before any merge?
(‘u’, ‘g’)
(‘a’, ‘u’)
(‘g’, ‘h’)
(‘h’, ‘t’)
(‘w’, ‘e’)
None of these.