| 摘要 |
Even-letter and odd-letter words are separately stored in an electronic dictionary and are codified by using predefined letter weight numbers and position weight numbers corresponding to different letters and letter positions within a word to calculate their hash values. These hash values are arranged sequentially in numerical order and divided into groups according to a predetermined number of higher digits. Numbers of hash values in these groups and the addresses of the first hash values in them are stored. When a letter array is inputted for spell-check, it is codified by the same formula and a corresponding group is identified from its high digits. A sequential comparison is made only with the hash values belonging to this selected group and until the stored hash value in the selected group exceeds the codified number.
|
