HEURISTIC APPROACH TO CHINESE‐CHARACTER SEARCH

The paper deals with a heuristic approach to a Chinese‐writing character search. Due to the small masks of the Chinese words being used in the approach, the database of the masks are compressed. Heuristic information, which is the summation of the values of elements of the mask, has been used in the searching process. It simplifies the approach and accelerates the search. By means of a FFT or FWT (Walsh Transformation) algorithm, a word may be mapped into its image form, which is a two‐dimensional array in a frequency domain; then a small mask is extracted.