I suggest the Levenshtein distance algorithm. You could use the standard algorithm on the entire sentence, treating it as a long string of characters (including the blanks and punctuation).
Depending on your requirements you could try some variations like running the Porter stemmer on all the words or ignoring the punctuation. You could even modify the Levenshtein algorithm to use words as its atoms instead of characters.