Crochemore and Perrin discovered an elegant linear-time constant-space string matching algorithm that makes at most 2n - m symbol comparison. This paper shows how to modify their algorithm to use fewer comparisons. Given any fixed [??] the new algorithm takes linear time, uses constant space and makes at most [??] symbol comparisons. If O(log m) space is available, then the algorithm makes at most [??] symbol comparisons. The pattern preprocessing step also takes linear time and uses constant space. These are the first string matching algorithms that make fewer then 2n - m symbol comparisons and use sub-linear space.