Question 2
Consider the following dictionary with the number of word occurrences in a corpus:
wo = { "deeper": 5, "keener": 6, "sweeter": 7,}Note: Append identifier/special symbol </w> to each word at the end.
You will be learning a byte pair encoding, answer the given subquestions in that context:
Which of the following pairs has the least frequency before any merge?