How to compute unseen bi-grams in a corpus (for Good-Turing Smoothing)
I just remembered that we create a table with all possible words as the header of each row and of each column. As a result, the list of all bi-grams would be all possible bi-grams formed by concatenating any 2 words.