We consider insertion and deletion channels with the additional assumption that the channel input is divided into segments and that at most one edit can occur within a segment.  We propose code constructions for the segmented deletion, segmented insertion and segmented insertion-deletion channels based on segment-by-segment VT codes with a pre-determined prefix.  The proposed codes guarantee that the rate scaling as the code length increases is the same as that of the maximal code.