In the general context of presentations of monoids, we study normalisation processes that are determined by their restriction to length-two words. Garsides greedy normal forms and quadratic convergent rewriting systems, in particular those associated
with the plactic monoids, are typical examples. Having introduced a parameter, called the class and measuring the complexity of the normalisation of length-three words, we analyse the normalisation of longer words and describe a number of possible behaviours. We fully axiomatise normalisations of class (4, 3), show the convergence of the associated rewriting systems, and characterise those deriving from a Garside family.
