A quick "layman's language" recap of the algorithm MDH has already encoded ...
-Group words first by their root or stem, as in the previous approach; list the plain root first.
-Group compounds and sort them as in the previous approach; print these last, as they are most complex words with a given root or stem.
-Assign each morpheme a numerical value (list to be finalized).
-Generate sort keys for words as follows:
-First, look at the numbers of the prefix and suffix nearest the root. Add the lower of these numbers to the sort key.
-Then ignore the affix whose number has been added to the sort key, and repeat the process of comparing and adding numbers, building the sort key until no morphemes are left.