A thing I've been thinking about is whether word embedding could be used to build exhaustive distributed search. #P2P networks like #Kademlia use the 'closeness' of an ID's bit pattern to determine node neighbours: you could just as easily use a binary word embedding of a search query to generate such an ID for lookup, and it has the lovely property that similar search queries get mapped to nearby areas of the #DHT address space.