◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Dmytro Krasnoshtan

2 papers hereh-index 270 citations3 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • middle author1

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.CL1
  • cs.SI1

identity via Semantic Scholar / OpenAlex

most citedAnalytical reasoning task reveals limits of social learning in networks

29 citations · 29 across the 2 of their papers we have counts for

collaborators
Showing cs.CLShow all

1 paper · 1 filter

cs.CL2019

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 nLn+n+k′−n2−nk′​⋅(n−1n−1+k′​) where k′=min(L−n+1,k).

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.