On the number of k-skip-n-grams

05/14/2019
by   Dmytro Krasnoshtan, et al.
0

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

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro