This is similar to the word hashing used in deep structured semantic models. [1] This works by representing a word as k-hot vector of trigrams that form the wor

This is similar to the word hashing used in deep structured semantic models. [1] This works by representing a word as k-hot vector of trigrams that form the word - it is able to generalize better to unseen words than one-hot whole word embeddings probably due to word morphology as the other answer in this thread suggests. [1] https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/MSRTR2014_wordEmbedding.pdf https://www.microsoft.com/en-us/research/wp-content/uploads/...