On Characterizing Recursively Enumerable Languages by Insertion Grammars