Unless they pull one or more teeth… 
So in images, there is a thing called a “perceptual hash”: Perceptual hashing - Wikipedia
Basically it compares “does this image look like this other one”, despite small modifications, crops, recoloring, etc. It detects similarity, not sameness.
I wonder if there’s something like that for text…?
Text embeddings (e.g. BERT) will do this. Also not a hash algorithm, but there are algorithms like Levenshtein distance.