TITLE: Ordering on words
QUESTION [5 upvotes]: What are the known computation-friendly well-orderings on words from $A^*$, where $A$ is a finite alphabet, except the standard weightlex and syllable-order?

REPLY [3 votes]: Here are three relevant references for partial wqo on words:
[1] F. D'Alessandro, S. Varricchio, Well quasi-orders, unavoidable sets, and derivation systems, RAIRO - Theoretical Informatics and Applications 40 (2006) 407-426, DOI 
[2] A. Ehrenfeucht, D. Haussler, G. Rozenberg, On regularity of context-free languages, Theoret. Comput. Sci. 27 (1983) 311–332.
[3] M. Kunc, Regular solutions of language inequalities and well quasi-orders, Theoret. Comput. Sci. 348 (2005) 277–293, ISSN 0304-3975, DOI.