I am trying to find a more appropriate algorithm for string similarity.
I have always used Levenshtein or Smith-Waterman but since there are so many others that I didn’t even know the existence of (and never tried) I would like your suggestion on the matter.
So, let me clarify that characters are usually in the same positions (or near) and that sometimes happen that there is no space between two words and instead sometimes there is.
Of course it might happen that few characters of a string might be different and it might also happen that there are additional or less words and/or lines (it happens also with empty lines so maybe I should some preprocessing and remove the empty lines).

I am creating an app where the user enters 8 characters. After he enters the string I have to see if it is an eight letter word. If not, check if contains a seven letter word etc.

I am creating an app where the user enters 8 characters. After he enters the string I have to see if it is an eight letter word. If not, check if contains a seven letter word etc.

I am creating an app where the user enters 8 characters. After he enters the string I have to see if it is an eight letter word. If not, check if contains a seven letter word etc.