Original sentence: Baeza-Yates keeps track of whether the previous j characters were a prefix of the search string, and is therefore adaptable to fuzzy string searching.Boyer-Moore string search algorithm.Knuth-Morris-Pratt computes a DFA that recognizes inputs with the string to search for as a suffix, Boyer-Moore starts searching from the end of the needle, so it can usually jump ahead a whole needle-length at each step
Edited sentence: Baeza–Yates keeps track of whether the previous j characters were a prefix of the search string, and is therefore adaptable to fuzzy string searching.Boyer–Moore string search algorithm.Knuth–Morris–Pratt computes a DFA that recognizes inputs with the string to search for as a suffix, Boyer–Moore starts searching from the end of the needle, so it can usually jump ahead a whole needle-length at each step