Most search engines use an inverted index — rather than compiling a list of every single Web page and all its words, for every single word, they compile a list of the places where it appears.
This rule can be inverted to store a 0 if the run begins with a 0 bit, but the effect is the same as long as both the encoder and the decoder of the inversion list agree on this detail.