"In computer science, the Knuth\u2013Morris\u2013Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a \"word\" W within a main \"text string\" S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.The algorithm was conceived in 1974 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris."@en .