Papers › On the number of k-skip-n-grams
On the number of k-skip-n-grams
Dmytro Krasnoshtan
The paper proves that the number of k-skip-n-grams for a corpus of size L is (Ln + n + k′ - n² - nk′)/n ·n-1+k′n-1 where k′ = min(L - n + 1, k).
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections