| 摘要 |
PURPOSE:To attain reduction of the input speed by feeding only the KANA (Japanese syllabary) characters needed for a sentence to be fed and detecting the longest KANA character string corresponding to the KANJI(Chinese character) reading from the head of a KANA character string written with no space to convert the KANA string into KANJI characters. CONSTITUTION:KANA characters are fed through a keyboard XB and stored to a document memory ME. A homonym buffer BU stores the reading KANA characters and their corresponding KANJI characters, and the KANJI characters are extracted by an amount equivalent to several characters counted from the head of the character string and compared with the reading within a KANJI dictionary DIC. Then the last one character is deleted when no coincidence is obtained from the comparison. This action is repeated until the coincidence is obtained. Then the reading KANA characters and their corresponding KANJI characters are all stored to the buffer BU. Then a homonym counter CO is set for redisplay, and the character codes in an area corresponding to the counter CO are stored to the memory ME. Then the correct characters are selected and displayed. This eliminates the need for conversion every input of a paragraph. Thus the conversion is possible after the input of a sentence. This can reduce the input speed.
|
