Manber and Wu improved an algorithm for a fuzzy version of this task using Levenshtein distances for their "A-grep" tool.
An approximate version of this task is carried out by an algorithm developed by Baeza-Yates and Gonnet that relies on bitwise operators, called the bitap algorithm. In an algorithm for this task, the numerical value of a "window" is calculated, that value modulo q is computed, and the window is shifted by one position. An algorithm for this task works backwards, using precomputed tables for the "good suffix rule" and the "bad (*) character rule." Another algorithm for this task operates as a DFA, using a "failure function" to provide its transition rules. Manber and Wu improved an algorithm for a fuzzy version of this task using Levenshtein distances for their "A-grep" tool. Algorithms for this task include BoyerÂ–Moore, KnuthÂ–MorrisÂ–Pratt, and RabinÂ–Karp. Regular expressions are used for it. For 10 points, name this task of finding a pattern within a string of text.
An approximate version of this task is carried out by an algorithm developed by Baeza-Yates and Gonnet that relies on bitwise operators, called the bitap algorithm.
string searching [or string matching; accept either answer with "approximate" or "fuzzy" until read; accept "substring" or "text" in place of "string"; accept descriptions like "finding a pattern in a string" until read]