This is a very complicated topic, because it depends what you mean by "similar" words, how close they have to be to count as matches, and how you want to deal with conflicts or missing words.
The difference between any two words can be measured using a metric such as the Hamming distance, the Damerau-Levenshtein distance or some other string metric .
But matching them is much more difficult. Consider that each of your example sentences has a different number of words and some of them repeat in the second sentence: how do does the computer know to match both 'to''s (the second and third words of the second sentence) to one 'to' (the fourth word of the first sentence)? How different do the words have to be for them to be considered a match? How do we classify them if there are multiple different possible matches? Which match decides the "correct location" ?
Consider this example:
A = 'bob bib did'
B = 'bib bid dib'
How would you match these: Does 'bib' in B match 'bob' in the same position in A, or does it match 'bib' which has the same spelling? 'Does 'bid' match 'bib' or 'did', from each of which it differs by only one letter? Does another possible match affect another? How are you going to tell your computer this?
