Multi hash embeddings in spaCy
Not on the map. Why?
Abstract (arXiv)
The distributed representation of symbols is one of the key technologies in machine learning systems today, playing a pivotal role in modern natural language processing. Traditional word embeddings associate a separate vector with each word. While this approach is simple and leads to good performance, it requires a lot of memory for representing a large vocabulary. To reduce the memory footprint, the default embedding layer in spaCy is a hash embeddings layer. It is a stochastic approximation of traditional embeddings that provides unique vectors for a large number of words without explicitly storing a separate vector for each of them. To be able to compute meaningful representations for both known and unknown words, hash embeddings represent each word as a summary of the normalized word form, subword information and word shape. Together, these features produce a multi-embedding of a word. In this technical report we lay out a bit of history and introduce the embedding methods in spaCy in detail. Second, we critically evaluate the hash embedding architecture with multi-embeddings on Named Entity Recognition datasets from a variety of domains and languages. The experiments validate most key design choices behind spaCy's embedders, but we also uncover a few surprising results.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 27 references that are in the map. First posted on arXiv 19 Dec 2022.
Builds on
7 of 27 references.
References · 7
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2016Layer Normalizationcited by 5,579
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2016Enriching Word Vectors with Subword Informationcited by 1,578
- 2016Neural Architectures for Named Entity Recognitioncited by 548
- 2017Hash Embeddings for Efficient Word Representationscited by 54
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.