An example of an abstraction hierarchy learned from the training sequence abracadabra. The root node (top) represents the entire set S, and the leaf nodes (bottom) indicate each individual 2-mer. Nodes are merged from the leaf to the root, forming abstraction hierarchies.