Post #3287719

@b0rk@social.jvns.ca I think there might be. The maths behind searching is creating a matrix of occurrences of words and compressing that matrix (Latent Semantic Indexing). In a very simplified way, LSI is like an LLM with a context of 0. So I guess LLMs which are also only matrices might be used in a similar way… (I am not very deep into the maths and theory of LLMs, but aren’t embeddings something in the direction you are looking for?)