True False QUESTION 7 You are using Byte Pair Encoding algorithm to tokenize input text. Assume that, during its learning stage, BPE algorithm ended up creating the following vocabulary: V={,d,e,i,l,n,o,r,s,t,w,er,er, ne, new, lo, low, low } Recall that character ' ' is considered to be a stop token. Now, imagine that your input text / sentence (in some strange language) is: newlow lownewer What will be the result of BPE tokenization here? newlow lownewer new low low newer new low low new er n e w low low newer QUESTION 8 When given a text corpus C, finding the number of specific token occurences will help you determine ... specific word frequency and rank corpus source corpus vocabulary size number of morphemes in the corpus