SOTAVerified

On the number of k-skip-n-grams

2019-05-14Code Available0· sign in to hype

Dmytro Krasnoshtan

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

The paper proves that the number of k-skip-n-grams for a corpus of size L is where k' = (L - n + 1, k).

Reproductions