Editing Markov algorithm (section)

==Algorithm==

The ''Rules'' are a sequence of pairs of strings, usually presented in the form of ''pattern'' → ''replacement''. Each rule may be either ordinary or terminating.

Given an ''input'' string: 

#Check the Rules in order from top to bottom to see whether any of the ''patterns'' can be found in the ''input'' string.
#If none is found, the algorithm stops.
#If one (or more) is found, use '''the first''' of them to replace the leftmost occurrence of matched text in the ''input'' string with its ''replacement''.
#If the rule just applied was a terminating one, the algorithm stops.
#Go to step 1.

Note that after each rule application the search starts over from the first rule.