JPH07191982A - Character processor - Google Patents

Abstract

(57) [Summary] [Purpose] In character processing, for example, a word to be converted is quickly searched for and operability is improved. [Structure] The storage device 4 stores information such as processing steps, data, and a dictionary of the present invention, and the information stored therein is read by the central processing unit 1. In the normal conversion, since only the user dictionary designated by the used dictionary designation data is accessed, only one-third of the words in the case of accessing all the dictionaries as in the prior art can be processed. That is, for example, in FIG.
In the example No. 9, when it is determined that the converted "yellowish" will not be used by the user in the future, "yellowish" is designated in the homophone conversion (Fig. 10) and the delete key is pressed. Then,
“Yellow” is deleted from the user dictionary, then registered in the “deleted user dictionary”, and the deletion is recorded in the word update data (FIG. 8).

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character processing device.

[0002]

2. Description of the Related Art A conventional technique will be described with reference to FIGS.

FIG. 16 is a conceptual diagram showing the flow of data in the normal conversion and the homophone conversion in the prior art.

FIG. 17 shows a normal conversion in the prior art.
7 is a flowchart of an example process.

FIG. 18 is a flow chart of an example of homophone conversion in the prior art.

FIG. 19 and FIG. 21 show the contents of the dictionary and the input and conversion results obtained when the user inputs "By Yuniyuji Yuka no Kouka" in the prior art.

FIG. 20 shows a list of homophones and the contents of the dictionary when the homophones are converted by the conventional technique.

In normal conversion and homophone conversion (FIG. 16),
The same dictionary is used without changing the dictionary used for each conversion.

In the normal conversion (FIG. 17), a key code is input at 171 (FIGS. 19 and 21), and at 172 it is checked whether the code is a conversion target.

When it is determined in 172 that the data is to be converted, 1
The word corresponding to the input is extracted from the dictionary at 73, the phrase is created at 174, and the conversion result is output at 175 (see FIGS. 19 and 2).
1) and return to 171.

When it is judged in 172 that it is not the conversion target, the processing corresponding to the input is executed in 176, and the process returns to 171.

In the homophone conversion (FIG. 18), the key code of the phrase targeted for the homophone conversion is input as 181 (FIG. 20), and the key code is checked at 182.

When it is determined in 182 that the data is to be converted, 1
The word corresponding to the input is extracted from the dictionary in 83, the phrase is created in 184, the conversion result is output as a homophone list in 185, and the process returns to 181.

When the selection key is judged in 182, 1
At 86, the conversion result at that time (“Yellow” in FIG. 20) is replaced with the candidate (“Effect” in FIG. 20) selected from the homophone list, and the process ends.

When it is determined in 182 that none of the above is present, the processing corresponding to the input is performed in 187, and 181
Return to.

[0016]

[Problems to be Solved by the Invention] In the process of improving the conversion rate, the types of dictionaries that are gradually used, such as user dictionaries, system dictionaries, and field dictionaries, increase, and the number of words stored in each dictionary increases. Is also increasing. As a result, the number of homophones displayed by homophone conversion also increases, and as a result, the user spends a lot of time searching for a candidate to really convert. On the other hand, among the displayed homophone words, even the words that are unlikely to be used by individual users are stored, which is the biggest cause of deterioration in the operability of homophone conversion. .

Furthermore, even in the normal conversion, a word unnecessary for the user causes a wrong conversion, which lowers the conversion rate, and it is necessary to analyze even the unnecessary word, so that the response performance is improved. It causes a problem that it lowers and requires extra memory for analysis.

Therefore, an object of the present invention is to provide a character processing device which solves the above problems.

[0019]

To achieve the above object, the present invention displays a dictionary section having at least two dictionaries for storing word data corresponding to a key code, and a homophone of an arbitrary phrase in character data. A homologous word converting means for selecting or changing, and a word deleting means for deleting the word from the corresponding dictionary in the dictionary part when the word is deleted by the homophoneic word converting means. .

[0020]

The present invention will be described in detail with reference to the drawings.

FIG. 2 is a block diagram showing the configuration of an information processing system to which the present invention is applied.

This information processing system has a central processing unit 1 and devices and processes associated with it. The output device 2 outputs the result of this processing and the like (example: display). The input device 3 inputs a key code or the like (example: keyboard). The storage device 4 stores information such as processing steps (control procedure of the central processing unit 1 shown in FIGS. 3 to 6), data, and dictionary of the present invention (example: R
By reading the information stored therein, the processing by the central processing unit 1 is executed.

FIG. 1 is a conceptual diagram showing the flow of data in the normal conversion and the homophone conversion according to the present invention.

FIG. 3 is a flow chart of an example of the normal conversion process according to the present invention.

FIG. 4 is a flow chart of an example of homophone conversion according to the present invention.

FIG. 5 shows a dictionary used in the present invention.
7 is a flowchart of an example process.

FIG. 6 shows the word update confirmation according to the present invention.
7 is a flowchart of an example process.

FIG. 7 is an example of use dictionary designation data in the present invention.

FIG. 8 shows an example of word update data according to the present invention.

FIG. 9, FIG. 11 and FIG. 13 show the contents of the dictionary as a result of the input and the conversion result when "By Yuniuji-Yu-Kanoka-ka" is input in the present invention.

FIGS. 10 and 12 show the list of homophones and the contents of the dictionary when the homophones are converted in the present invention.

FIG. 14 shows an example of a display screen for designating the dictionary used in the present invention.

FIG. 15 shows an example of a display screen for confirming word update in the present invention.

In the normal conversion and the homophone conversion (FIG. 1), the dictionaries designated by the normal conversion and the homophone conversion are used according to the designation (circle mark in FIG. 7) of the use dictionary designation data (FIG. 7). There is.

In the normal conversion (FIG. 3), a key code is input at 31 (FIGS. 9, 11, and 13), and it is checked at 32 whether the code is a conversion target.

When it is judged in 32 that the data is to be converted, 33
Use the word corresponding to the input in the dictionary specification data (Fig. 7)
It is extracted from the user dictionary in the client specified to be used in the normal conversion by.
The conversion result is output in 5 (FIGS. 9, 11, and 13), and 3
Return to 1.

When it is determined in 32 that the data is not to be converted, a process corresponding to the input is performed in 36, and the process returns to 31.

In the homophone conversion (FIG. 4), the key code of the phrase targeted for the homophone conversion is input by 41 (FIG. 1).
0, FIG. 12) and check the key code at 42.

When it is judged in 42 that the data is to be converted, 43
Use the word corresponding to the input in the dictionary specification data (Fig. 7)
The user dictionary on the client and the system dictionary on the server specified for use in homophone conversion by
It is extracted from the field-specific dictionary A and the field-specific dictionary B, the phrase is created in 44, the conversion result is output as a homophone list in 45, and the process returns to 41.

When it is judged as the selection key at 42, 46
Then, the conversion result at that time (“school song” in FIG. 12) is replaced with the candidate (“effect” in FIG. 12) selected from the homophone list, and the process proceeds to 47.

At 47, the selected candidate is registered in the user dictionary, and at 48, the information that it has been registered in the user dictionary is registered in the word update data (FIG. 8), and the process ends.

When it is judged as the delete key in 42, 49
Candidates selected from the list of homophones (“Yellow” in Figure 10)
Delete from the user dictionary and proceed to 4A.

In 4A, the selected candidate is registered in the deleted user dictionary, and in 4B, the information indicating that it has been deleted from the user dictionary is registered in the word update data (FIG. 8), and the process is terminated.

When it is judged at 42 that none of the above, the processing corresponding to the input is performed at 4C, and the process returns to 41.

In the use dictionary designation function (FIG. 5), the screen for use dictionary designation (FIG. 14) is displayed on the output device at 51, and
The user inputs the key code instructing the designated change in 2, and checks the key code in 53.

When it is judged at 53 that the cursor is the cursor moving key, at 54 the cursor is moved in the designated direction and the process returns to 51.

If it is determined at 53 that the instruction has been selected, whether to use or not is reversed, the used dictionary designation data (FIG. 7) is changed, and the process returns to 51.

When the end of processing is instructed by selection or cancellation in 53, the processing is ended.

When it is determined in 53 that none of the above is present, in 56, processing corresponding to the input is performed, and the flow returns to 51.

In the word update confirmation function (FIG. 6), 61 displays the word update confirmation screen (FIG. 15), 62 inputs the key code instructing the user to change the designation, and 63 displays the key code. To check.

When it is determined at 63 that the cursor is the key for moving the cursor, at 64 the cursor is moved in the designated direction and the process returns to 61.

When it is judged at 63 that the instruction has been selected, the validity / invalidity is reversed, the word update data (FIG. 8) is changed, and the process returns to 61.

When the end of the processing is instructed by the selection or cancellation in 63, the invalidated word is restored to the original in 66 and the processing is ended.

When it is judged in 63 that none of the above is present, the processing corresponding to the input is carried out in 67, and the process returns to 61.

Here, the example used in the description of the prior art (see FIG.
A specific description will be given using the same example as 9).

According to the present invention, in the normal conversion, since only the user dictionary designated by the used dictionary designation data (FIG. 7) is accessed, it is 1/3 that in the case of accessing all the dictionaries as in the prior art. Only the words need to be processed.

At this time, when it is determined that the converted "yellowish" is not used by the user in the future, "yellowish" is designated in the homophone conversion (FIG. 10) and the delete key is pressed.
Then, "yellow erosion" is deleted from the user dictionary, then registered in the "deleted user dictionary", and the deletion is recorded in the word update data (FIG. 8).

Further, if the homophony conversion (FIG. 12) of the “school song” converted by the normal conversion (FIG. 11) is performed and the “effect” of the homophone is selected, the “effect” is displayed in the user dictionary.
Is registered, and the fact that it has been registered is recorded in the word update data (FIG. 8). After that, when the normal conversion (Fig. 13) is performed,
The "effect" is converted.

[Other Embodiments] In the present invention, the dictionaries are distributed to the server and the client (FIG. 1), but of course they may be in the same environment. A deleted user dictionary is not needed unless it is necessary to recover deleted words. Since it is sufficient if there is at least one user dictionary and one other dictionary, one of the system dictionary and the field-specific dictionaries A and B
Only one is enough. On the contrary, there may be other dictionaries such as a meaning example dictionary and an idiomatic dictionary. The instructions for implementing the present invention may exist in an internal memory or may be read from an external storage device such as a floppy disk or the like and executed. The input data to be converted is not limited to the key code, and may be data input by a pen, voice, or a mouse for operating instructions. The designation of deletion may be made other than the user dictionary. If it is not necessary to return to the state before the change such as deletion or addition of the word, the word update data and the registration processing to the word update data are unnecessary. If the dictionary used for each conversion is decided, the use dictionary specifying function and the use dictionary specifying data for that are unnecessary.

[0060]

As described above, according to the present invention,
It is possible to reduce the number of homophone word candidates that are displayed afterwards by deleting words that the user has determined to be unnecessary in the normal homophone conversion process. In addition, it is possible to reduce the number of words to be analyzed by normal conversion. This allows
The user can search for the desired word faster, and the operability is dramatically improved. Furthermore, since only the words that are really needed by the user are stored in the word dictionary, the memory size on the disk that stores the dictionary and the RAM size for loading and accessing the dictionary are reduced, improving response performance. Let

[Brief description of drawings]

FIG. 1 is a conceptual diagram showing a data flow in normal conversion and homophone conversion according to the present invention.

FIG. 2 is a block diagram showing a configuration of an information processing system in which character processing of the present invention is performed.

FIG. 3 is a flowchart of an example of normal conversion processing according to the present invention.

FIG. 4 is a flowchart of an example of homophone conversion according to the present invention.

FIG. 5 is a flow chart of an example of a process of specifying a used dictionary according to the present invention.

FIG. 6 is a flow chart of an example of processing for confirming word update in the present invention.

FIG. 7 is a diagram showing an example of use dictionary designation data in the present invention.

FIG. 8 is a diagram showing an example of word update data in the present invention.

FIG. 9 is a diagram showing the contents of the dictionary as a result of input and conversion when "By Yuniyuji Yuka no Koka ka," is input in the present invention.

FIG. 10 is a diagram showing a list of homophones and the contents of a dictionary when homophone conversion is performed in the present invention.

FIG. 11 is a diagram showing the contents of the dictionary as a result of input and conversion when "By Yuniyuji Yuka no Koka Ka," is input in the present invention.

FIG. 12 is a diagram showing a list of homophones and the contents of a dictionary when homophone conversion is performed in the present invention.

FIG. 13 is a diagram showing the contents of the dictionary as a result of input and conversion when “By Yuniyuji Yuka no Koukaka” is input in the present invention.

FIG. 14 is a diagram showing an example of a display screen for specifying a use dictionary according to the present invention.

FIG. 15 is a diagram showing an example of a display screen for confirming word update in the present invention.

FIG. 16 is a conceptual diagram showing a data flow in a normal conversion and a homophone conversion according to a conventional technique.

FIG. 17 is a flowchart of an example of normal conversion processing in the related art.

FIG. 18 is a flowchart of an example of homophone conversion according to the related art.

FIG. 19 is a diagram showing the contents of the dictionary, the input and the conversion result when the user inputs “By Yuniyuji Yuka no Kouka,” in the prior art.

FIG. 20 is a diagram showing a list of homophones and the contents of a dictionary when homophone conversion is performed by the conventional technique.

FIG. 21 is a diagram showing the contents of the dictionary as a result of input and conversion when "By Yuniyuji Yuka no Koukaka" is input in the prior art.

[Explanation of symbols]

 1 Central processing unit 2 Output device 3 Input device 4 Storage device

Claims (2)

[Claims] 1. A dictionary unit having at least two dictionaries for storing word data corresponding to a key code, a homophone conversion unit for displaying, selecting or changing a homophone of an arbitrary phrase in character data, said homophone. A character processing device comprising: a word deleting unit that deletes a word from a corresponding dictionary in the dictionary unit when the word is deleted by the word converting unit. 2. The character processing device according to claim 1, further comprising normal conversion means for converting the input key code into character data composed of a kana-kanji mixed sentence using the data in the dictionary section.