To arrange a first character string and a second character string by keeping a balance by correcting character intervals so that the length of the first character string and that of the second character string become almost equal by comparing them and arranging the second character string near the corrected first character string in parallel.

It is calculated how many KANAs (Japanese syllabary) are allocated from the number of characters, character width and the character intervals in the character string whose range is designated. The obtained allocation possible number of the KANA is stored in a memory area (S202). Then, the character string given as the KANA is inputted (S203). The allocation possible number of the KANA in the character string whose range is designated is compared with the number of inputted KANA strings. It is judged whether the allocation possible number of the KANA is larger or equal than/to the input number of the KANA (S204). When the condition is not satisfied, an attribute varying the character interval is added to the character string whose range is designated (S206) and KANA allocation processing is executed (S207). Thus, the KANA can be given with satisfactory looking.