Feed aggregator

Ask HN: N-Grams with Context

Hacker News - Wed, 04/17/2024 - 3:50am

Hello, I am thinking in developing an algorithm similar to n-grams, the algorithm should use some recursive procedure to replace terms with context-terms so that the final result of this algorithm would be similar to an embedding, that is a function from n "context words" to probabilities for the next word. Do anyone of you know if this is a solved problem or any attempt in that directions. Thanks in advance.

Context-terms could initially be words but could evolve into something similar to small embeddings.

Comments URL: https://news.ycombinator.com/item?id=40061678

Points: 1

# Comments: 0

Categories: Hacker News

Papyrus 2 – SNL [video]

Hacker News - Wed, 04/17/2024 - 3:10am
Categories: Hacker News

Pages