Dictionary lookup is a type-based approach to normalisation, i.e., every token instance of a given type will always be normalised in the same way.
as N (the lexicon size cut-off) increases, the performance drops more slowly than the other methods.