If the covering span of an internal node is less than a threshold γ ∈ N, its child nodes are merged (line 3 and 4, Algorithm 3).
we reinsert the child nodes by replacing the corresponding nonterminals with lexical strings that the child nodes have been covered by.