| 摘要 |
PROBLEM TO BE SOLVED: To reduce the wasteful idle area in a dictionary and to compress the data structure without losing the speediness of search. SOLUTION: At the time of registering KANJI (Chinese character) 'OU', 'GAI', 'EN', 'IE', 'KAWA', 'HI', 'GAKU', 'KAI' and 'KI', which follow a word heat 'DAI', in an array CHECK 62, these KANJIs are classified into three categoriesα,βandγ, and displacement amounts d1, d2 and d3 on CHECK 62 are calculated for respective categories. These displacement amounts are registered in the other array and the corresponding additional order of the array is registered in the array to which access can be executed by using the index of the word head 'DAI'.
|
