{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/on-the-number-of-k-skip-n-grams","title":"On the number of k-skip-n-grams","arxiv_id":"1905.05407","date":"2019-05-14","proceeding":null,"authors":["Dmytro Krasnoshtan"],"abstract":"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)$.","url_abs":"https://arxiv.org/abs/1905.05407v1","url_pdf":"https://arxiv.org/pdf/1905.05407v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"on-the-number-of-k-skip-n-grams","repo_url":"https://github.com/salvador-dali/k-skip-n-gram","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}