  Ochem, Rampersad, and Shallit gave various examples of infinite words
avoiding what they called approximate repetitions. An approximate repetition is
a factor of the form xx', where x and x' are close to being identical. In their
work, they measured the similarity of x and x' using either the Hamming
distance or the edit distance. In this paper, we show the existence of words
avoiding approximate repetitions, where the measure of similarity between
adjacent factors is based on the length of the longest common subsequence. Our
principal technique is the so-called "entropy compression" method, which has
its origins in Moser and Tardos's algorithmic version of the Lovasz local
lemma.
