Abstract
The paper proves that the number of k-skip-n-grams for a corpus of size L is Ln+n+k′−n2−nk′n⋅(n−1+k′n−1) where k′=min(L−n+1,k).
Abstract (translated by Google)
URL
https://arxiv.org/abs/1905.05407
The paper proves that the number of k-skip-n-grams for a corpus of size L is Ln+n+k′−n2−nk′n⋅(n−1+k′n−1) where k′=min(L−n+1,k).
https://arxiv.org/abs/1905.05407