I liked the approach movpasd suggested: https://news.ycombinator.com/item?id=42346076 https://news.ycombinator.com/item?id=42346076 With a linear algebra libra

I liked the approach movpasd suggested: https://news.ycombinator.com/item?id=42346076 https://news.ycombinator.com/item?id=42346076 With a linear algebra library, you can guarantee that you've found the next, or the previous, match in sequence. I don't know what the state of the art is for fast linear algebra in javascript, though. (The matrix approach also has the advantage that, when your full-text search problem has 2^115 solutions, you can compute the one you want, the next one after some index, without having to compute them all.)