# On the number of k-skip-n-grams

14 May 2019Dmytro Krasnoshtan

The paper proves that the number of k-skip-n-grams for a corpus of size $L$ is $$\frac{Ln + n + k' - n^2 - nk'}{n} \cdot \binom{n-1+k'}{n-1}$$ where $k' = \min(L - n + 1, k)$...

PDF Abstract

# Evaluation results from the paper Add Remove

Submit results from this paper to get state-of-the-art GitHub badges and help community compare results to other papers.