| 摘要 |
PROBLEM TO BE SOLVED: To check spelling without deciding a Roman letter conversion candidate. SOLUTION: When an operator depresses a Roman letter conversion key, a character string 'gitar' is displayed on a screen in an indecision state. It is judged whether a display character string buffer 27b comprises a Roman letter string or not (step S21) and a spelling check processing is performed when it is comprised (step S23). A CPU 23 judges whether a spelling check object character string is right or not based on a spelling check program 26s (step S25). When it is not right, the character string of a spelling check candidate is displayed in a CRT 30 together with the Roman letter conversion candidate which is generated in a step S17. |
