On the number of k-skip-n-grams

Abstract

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

2 pages

References in corpus (1)

• Efficient Estimation of Word Representations in Vector Space