J. N. Chen and C. C. Chang*
Department of Information Management
Ming Chuan College
Taipei, Taiwan, R.O.C.
*Institute of Computer Science and Information Engineering,
National Chung Cheng University
Chiayi, Taiwan, R.O.C.
Although various methods for inputting Chinese characters exist, phonetic input is one of the simplest and easiest to use. We propose a new approach that combines a perfect hashing function, data compression, clustering analysis and self-organizing sequential search heuristics using Shuang Pinyin symbols. Experimental results show that our scheme is feasible. The memory space required by our scheme is almost identical to the size occupied by the existing phonetic symbols. Once a specified Chinese character is retrieved, we reorder the table of homophonetic characters by interchanging with the character that immediately precedes it; thus more frequently accessed characters are moved to the front whereas less frequently accessed characters are moved to the rear. In comparison with other Chinese character retrieving schemes proposed previously, our method is the most efficient in terms of time consumption and space occupancy.
Keywords: clustering analysis, data compression, perfect hashing function, shuang pinyin, chinese characters retrieval
Received August 8, 1991; revised October 8, 1992.
Communicated by Jun S. Huang.