| 摘要 |
PROBLEM TO BE SOLVED: To make it possible to retrieve target difficult KANJI (Chinese character) with efficiency by retrieving a character which belongs to a 3rd character set from a 2nd data base according to a character belonging to a 2nd character set. SOLUTION: A Japanese front-end processor is actuated on a Japanese word processor and an operator inputs KANJI for daily use through KANA (Japanese syllabary)-KANJI conversion. For example, 'a woman plus a man' is inputted. The inputted KANJI is copied to a clipboard 33 with a copy/cut command of the Japanese word processor. Difficult KANJI code data base retrieval software 34, on the other hand, receives the code data of the KANJI for daily use and performs retrieval to list and display KANJI candidates to the operator. Then when the operator selects one difficult KANJI candidate, the character code data of the selected KANJI is copied to the clipboard 33. The operator copies the difficult KANJI on the clipboard 33 to a page in operation with a paste command 42. |
