| 摘要 |
Storing characters (e.g. names) of a non-alphabetical language, e.g. .a Chinese language, in the form of hash codes, for efficient retrieval. A preferred embodiment first converts each character into a Roman character, using for example Pinyin conversion, then converts the Roman characters into a hash code. Alternatively, hash codes for all the stored characters are not permanently stored, but generated whenever the user searches for a name (Fig. 6). To retrieve one of the names, one or more hash code characters are entered 424 and a matching reduced set of names is provided 426. Thus a complete set of names in the non-alphabetic language is reduced to a set that a user may more readily review 430. This is useful when the names are displayed on a small electronic display, for example in a mobile telephone. The names may be associated with data, e.g. telephone numbers. |
