Look at Algorithm::Diff or, if the strings are short and expected to be similar, Text::Levenshtein, a more sophisticated direct measure of similarity.

A third way is to compress the two strings, and compress their concatenation. If they are similar, the concatenation will compress to not much more size than one of its parts. I don't know of a module that does that.