That is a pretty badly overloaded word for it, and I didn't even pay much attention to the notion of "rank" anyways. I'm mainly interested in how the text is represented with bit vectors. It's very reminiscent of how vector math plays out in other ML domains, but I would bet that many people working with text have never heard of it.

Can you explain how this is useful for those problems though? I'm struggling to come up with a way to use rank queries on embeddings in order to get back useful information.

> It's very reminiscent of how vector math plays out in other ML domains

How so?

You weren't wrong. Wavelet Trees have no relationship whatsoever to vector embeddings.