Hash functions are an analogy that falls apart very quickly.
You can recover the original word from the embedding, but not from the hash.
A hash function will return very distant vectors for very similar inputs. An embedding will return similar ones
You can recover the original word from the embedding, but not from the hash.
A hash function will return very distant vectors for very similar inputs. An embedding will return similar ones
Returning unrelated (distant) hashes for similar inputs is a possible property of a hash function, and oftentimes a desirable one (especially for cryptography), but there are in fact use cases where one wants similar inputs to map to similar (or the same) hash. https://en.m.wikipedia.org/wiki/Locality-sensitive_hashing
Not all hashes are cryptographic hashes.