In each masked testing data, only one word is replaced with a "[MASK]" token.
each sentence creates the number of testing samples equal to its 3 The perplexity of masked words is e − log(p) n mask , where p is the probability of correct masked word to be predicted and n mask is the total number of masked words.