1
The algorithm compares x with each entry in turn until a match is found
or the list is exhausted.
2
[see also: accord, agree, correspond] Suppose the first three characters of the pattern match three
consecutive text characters.
Now F is defined to make G and H match up at the left end of I.