29 citations · 29 across the 2 of their papers we have counts for
1 paper · 1 filter
Dmytro Krasnoshtan
The paper proves that the number of k-skip-n-grams for a corpus of size L is nLn+n+k′−n2−nk′⋅(n−1n−1+k′) where k′=min(L−n+1,k).