Also known as compact prefix tree, radix trie
data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).