JPS6175954A - Input system of kanji data - Google Patents

Abstract

PURPOSE:To call out a desired character string with input of KANJI (Chinese characters) included in a character string to be supplied, by using a dictionary which stores plural pieces of data that define plural KANJI character strings or a character string including plural pieces of KANJI as a unit. CONSTITUTION:A dictionary which stores the reading, description and codes of data (names of places, etc.) that define plural KANJI character strings or a character string including plural pieces of KANJI as a unit is provided in addition to an ordinary dictionary. In case a KANJI character string (name of place) whose reading is unknown is supplied, the readable one of these KANJI characters are supplied. Then the KANA (Japanese syllabary)/KANJI conversion is carried out with the readable KANJI to select the desired KANJI. Here a KANJI retrieval key is pushed, an input device detects a name of a place including said readable KANJI out of those names of places having a code ''5103'' at each head since it is known from the above-mentioned unreadable KANJI character code that the code ''5103'' is put at the head. Thus the name of a place corresponding to said unreadable KANJI character string is detected and displayed.

Description

[Detailed Description of the Invention] <Technical Field of the Invention> The present invention relates to a kanji data input method suitable for Japanese language processing in Japanese word processors and computers, and particularly relates to a method for inputting kanji characters to be input in these devices that employ a kana-kanji conversion method. If you don't know how to read a string, you can immediately input the kanji string as data by entering one (or two) appropriate kanji in the string. For example, in cases where there is a great advantage in handling data in kanji, such as addresses and names, and a mask dictionary (file) can be prepared, it is most convenient to use the kana-kanji conversion method using voice or keystrokes for inputting the data. Therefore, this conversion method has been widely used as an input method for Japanese word glossers and computers.

However, if, for example, a place name has a unique reading and the reading is completely unknown, it is very difficult to input it using the kana-kanji conversion method. Conventionally, in such cases, the phonetic conversion method is used to convert each character one by one.

However, if the place name is long, converting it character by character is extremely troublesome, and it takes a long time to convert everything, making it impossible to input kanji data easily and quickly. There's a big problem.

<Object of the invention> The present invention has been made in view of such conventional problems.
We would like to provide a kanji data input method that allows you to extract kanji data that includes the kanji from a mask dictionary and use it as input data by simply inputting one or two kanji in the kanji data to be input. It is something to do.

<Example> Fig. 1 is a schematic configuration diagram of a Japanese word processing sensor using a kanji data input method according to the present invention. Reference numeral 2 designates a key input unit such as a keyboard, 3 a voice input unit such as a microphone, 4 a display unit such as a CRT, and although not shown, an output unit such as a printer is also provided.

5 and 6 are storage units. The storage unit 5 stores a dictionary necessary for onkun conversion, that is, an onkun dictionary that pairs readings and kanji. On the other hand, the storage unit 6 stores a dictionary (file) for realizing the kanji data input method according to the present invention. This dictionary stores data in which multiple kanji character strings or character strings containing multiple kanji characters are one unit, such as "place names", in the form of pronunciations, notations, and codes. For example, Figure 2 shows an address. This is an example of a file, and this file is prefectural ordinance-designated city file A, city
It consists of three files: county/ward file B and town file C. Furthermore, for example, if the code for "1 Kyoto City" in File A is 151 XXXXXXX, then the code for "5 Sakyo Ward" related to Kyoto City in File B is '5'.
103XXXX", and the names of the towns in the ward in Tokyo in File C, 'Akichiku-cho', 'Kamitakano Kanbe-Ryashi-cho', and '9 Wakoku-cho'.
``51030001'' and +510 respectively
30189", '51030636", the data between files A, B, and C is stored in association with each other, so that searches can be performed rationally and quickly.

The storage unit 5.6 described above can be provided, for example, by a floppy disk device. In addition, other storage units (not shown) store dictionaries necessary for segmentation processing, homophone selection processing, kana-kanji conversion processing, and the like.

The above-mentioned control section 1 is constituted by, for example, a microcomputer, and is configured to control the other components 2 to 6 and to perform various processes described later using these components 2 to 6. In addition, the above keyboard 2
Nibaka Irukaki - 1 Kana-Kanji conversion key, Onkun conversion key,
Various keys such as a next candidate key, a character selection key, and a kanji search key are provided.

FIG. 3 is a diagram showing a processing flow, and FIG. 4 is a diagram showing a display example, and the operation will be explained based on these diagrams.

Now, if you use the address file shown in Figure 2 to enter ``9 Kyoto City, Sakyo Ward, Kamikoya Kanbe Hayashimachi'' using the kana-kanji conversion (or phonetic kanji conversion) method, you will enter ``Kyoutoshi'' using the incorrect kana input key. After entering the information, if you operate the kana-kanji conversion key, file A of the address file is referenced and "Kyoto City" is entered.

Next, when you input "Sakyouku" and operate the conversion key, file B is referenced and the code 1 of Kyoto City is phantom-xxx.
The item of code 91U03XXXX" related to "xxx" is searched and "Sakyo Ward" is input (at). Up to this point, input is made in the same manner as before, and "Sakyo Ward, Kyoto City" is displayed on the screen of the CRT display section 4 as shown in FIG. 4 (a).

Next, you enter the town name, but for example, if you don't know the pronunciation of the town name "Kamitakano Kanbe Hayashi-cho", you would have to convert it one character at a time using the phonetic conversion function, whereas in the past, Here, we first focus on the - character "Kane" in the town name, input "Haku" using the Kana input key (a2), and then operate the onkun conversion key (a3) to perform the onkun conversion. . At this time, the CRT display section 4 displays images as shown in FIG. If there are a plurality of homophones, the desired kanji is displayed by operating the next candidate key, and the desired kanji is selected by the selection key (a4 to a6).

In this way, the - character ``kan'' in the town name is input using the phonetic conversion function, and the kanji search key is operated when it is displayed on the CRT screen as shown in the same figure (a7).

When this kanji search key is operated, the town name file C is searched, and since "Sakyo Ward, Kyoto City" has already been entered, an item is determined from among the codes '5103XXXX'.In this example, the code 115+030001 is selected. “〜
A search is performed for 636 items up to “5103636”, and from among these items, the phonetic conversion function is used to
The town name ``Kamitakano Kanbe Hayashi-cho'' containing the character ``Kane'' displayed on the RT screen is selected and displayed as shown in the figure (E).

Note that in the above example, there is only one town name that includes the character "Kane". In such a case, you can immediately enter the desired town name by operating the kanji search key, but for example, "bayashi". If you pay attention to the character ``
If there are several town names that include Hayashi J, the desired town name can be input using a selection method such as selecting the next candidate (a8, a9).

In this way, even if you do not know the reading, you can convert one of the characters using the onkun function, and then immediately enter the desired kanji by operating the kanji search key.

In addition, when searching, if you expect that there will be many matching items using only common kanji characters, such as "bayashi", enter two or more characters, such as "bu" and "bayashi". Then, you can search for items containing these characters.

Further, in the above embodiment, only the kanji characters are displayed, but the readings of the kanji characters may be displayed at the same time, or only the readings may be displayed instead of the kanji notation by operating the non-conversion key.

Furthermore, although the address file in the embodiment stores data in only kanji characters, the same effect can be achieved even if the address file contains kanji data mixed with kana.

<Effects of the Invention> As described above, the kanji data input method of the present invention uses a dictionary (file) that stores a plurality of data in which one unit is a plurality of kanji character strings or a character string containing a plurality of kanji characters. For a unit of data to be input, when a certain appropriate kanji in the data is input, the dictionary is searched based on that kanji and the unit of data containing the kanji is extracted from the data group. Since it is made to be the input data, even if you do not know the reading of the kanji data to be input,
The kanji data can be entered quickly and with extremely simple operations.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a schematic diagram of a Japanese word processing sensor employing the method of the present invention, and FIG. 2 is a diagram showing an example of an address file. 1 is the control section, 2 is the keyboard, 3 is the voice input section, 5 and 6 are the storage sections, 4 is the display section Agent Patent attorney Aihiko Fukushi (and 2 others) Figure 1 Figure ztA Figure 3

Claims (1)

[Claims] 1. Equipped with a dictionary (file) that stores multiple units of data each consisting of multiple kanji character strings or character strings containing multiple kanji characters. A kanji data input method characterized in that when a kanji is input, the dictionary is searched based on the kanji, and one unit of data containing the kanji is extracted from the data group and used as input data. .