Before embeddings, and still underneath most search, text is counted rather than understood. N-grams are the smallest useful unit of that.
Write ngram_counts(text, n, top_k) returning a list of (ngram, count) pairs.
n consecutive tokens, joined with a single spacetop_kYou have read the opening. The rest is free with a Bezen account, and no card is needed.
Behind the sign-in