JPH07262182A - Character processor - Google Patents

Abstract

PURPOSE:To improve operability by reducing the number of key operations until a synonym is decided by employing such constitution that a word used frequently by an operator who uses KANA(Japanese syllabary)/KANJI(Chinese character) conversion can be outputted in front of a synonym candidate. CONSTITUTION:A homonym in a storage means 5 selected at every selection of the homonym is sampled from a homonym candidate by an arranging means 2, and a sampled homonym is placed at the forefront of the homonym candidate. The position relation of the homonyms before and behind the sampled homonym is set so as to be neighbored to each other. When the output of all homonym candidates is instructed by an instruction means 1, the homonym candidate is outputted in sequence arranged by the arranging means 2 by an output means 3. In such a way, the operability can be improved by reducing the number of key operations by outputting the homonym with high use frequency as a first candidate.

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 All phrases that form a sentence are extracted from an input reading string, and a phrase that is the most natural sentence is cut out from the extracted phrases and determined as a basic phrase. For example, as shown in Table 1, basic phrase candidates and subsequent phrase candidates are extracted for the reading string "Kikai ga me".

[0003]

[Table 1]

The most natural sentence among the basic phrase candidates and the subsequent phrase candidates extracted as shown in Table 1 is the basic phrase "Kikaiga" and the subsequent phrase candidate "I".
"Kikaiga" is decided as the basic phrase.

A homophone word stored in an area (learning data storage area 1) in which information of a homophone word used last time is stored from all conversion candidates which are candidates when the basic phrase is acquired. Information data (learning data) is compared with conversion candidates. As a result of the comparison, if there is a conversion candidate having the same homophone information, that homonym is registered as the first candidate. FIG. 14 shows a state in which the basic phrase is “kikaiga” and “instrument” is registered as the first candidate.

On the other hand, when there is no conversion candidate having the same homophone word information, the homophone word having the highest priority among them is set as the first candidate. Then, the first candidate determined by the previous process is output to the output device. An example thereof is shown in FIG.
However, when the determined homophone is not the desired homophone, a dictionary search is again performed with the reading sequence of the basic phrase, and all the possible homophone candidates are extracted. FIG. 16 shows how to extract homophone candidates. All the homonym word candidates obtained by such processing are output to the output device.
An output example is shown in FIG.

The operator selects a desired homophone from the output homophone candidates. FIG. 18 shows an example in which “Kikai ga” is selected from the homonym candidates. The learning data of the selected homophone is stored in the learning data storage area 1. FIG. 19 shows how selection candidates are stored.

By storing in this way, it is guaranteed that the selected homophone will be output as the first candidate in the next conversion.

[0009]

The data of the same-word information used last time (learning data) is utilized for the first candidate, but this learning data was not used for outputting the same-word candidates. Further, the display order of the homophone candidate other than the first candidate is determined only by the information such as the priority of the word from the beginning. Therefore, as shown in FIG. 20, when the homonym used up to the last time is “Kikai ga”, the homonym symptom learned up to the last time is quite a homophone word candidate at the time of outputting the homonym candidate. It was often displayed behind. Again, to use this homophone, it is necessary to move and select the cursor on the homophone candidate.

Further, as shown in FIG. 21, when the number of homophones is large and the homophone used last time is "Listen", 1 to display the target homophone candidate. It could not be displayed in the number of times displayed, and more key operations were required to select a homophone.

Therefore, the number of key operations when selecting a homophone has increased in proportion to the homophone, and at the same time, the operability has also deteriorated.

An object of the present invention is to provide a character processing device which solves the above problems and can improve the operability.

[0013]

According to the present invention, in a character processing device having storage means for storing homophone word candidates, each time a homophone word is selected, the selected homophone word is replaced by a homophone word candidate in the storage means. And puts the extracted homophonic word at the head of the homophoneic word candidate, and instructs the output of all the homophonic word candidates, and the aligning means that makes the positional relationship of the homophoneic words before and after the extracted homophonic word adjacent to each other. Instruction means for doing
When output of all the homophonic word candidates is instructed by the instructing means, output means is provided for outputting the homophoneic word candidates in the order in which they are arranged by the arranging means.

[0014]

According to the present invention, every time a homophone is selected, the selected homophone is extracted from the homophone candidates in the storage means by the aligning means, and the extracted homophone is placed at the head of the homophone candidate. While placing, the positional relationship of the homophones before and after the extracted homophones are made adjacent to each other, and when the output of all the homophone candidates is instructed by the instructing means, the homonym candidates are output by the output means in the order arranged by the aligning means. Output.

[0015]

Embodiments of the present invention will now be described in detail with reference to the drawings.

FIG. 1 shows an embodiment of the present invention. In FIG. 1, reference numeral 1 is an input device for inputting a character string. The input device 1 includes a keyboard. A central processing unit 2 controls each unit. 21
Is a ROM (read only memory) in which a character processing program is stored. 22 is a RAM (random access mem)
ory) and is used for work. A storage device 5 is for storing the character processing result. An output device 3 is for displaying the character processing result. As the output device 3, there is a display device having a CRT (cathode ray tube).

FIG. 2 is a flow chart showing an example of the character processing program stored in the ROM 20 shown in FIG.

With respect to the character string input from the input device 1, in step S1, all the clauses that make up the sentence are extracted, and the clause that becomes the most natural sentence is cut out and determined as the basic clause. . Then, in step S2, the homophones stored in the area (learning data storage area 1) storing the information of the homophones from all the conversion candidates that are candidates when the basic phrase is acquired. The information data (learning data) is compared with the conversion candidates. As a result of comparison,
If there is matching data, the homonym is registered as the first candidate, and if there is no matching data,
The homonym with the highest frequency of use is selected as the first candidate.
Then, the determined first candidate is output to the output device 3 in step S3.

When it is determined in step S4 that the first candidate output to the output device 3 is the desired homophone, the first candidate is determined as the conversion result.

On the other hand, if it is determined that the homonym is not the desired one, the process proceeds to step S5. In step S5,
A dictionary search is again performed for basic phrases that are not the desired homophone, and all homophones that can be established in that phrase are extracted. Then, in step S6, it is determined whether or not learning data exists in the homophone information storage area 2. When a positive determination is made, the process proceeds to step S7. Step S
In step S8, learning data to be compared is acquired from the learning data storage area 2, and whether there is a homonym candidate having homonym information that matches the acquired learning data is determined in step S8. judge. The state of homophone determination is shown in FIGS. 3 and 4. FIG. 3 is an example in which no matching data exists, and the next learning data is indicated. FIG. 4 is an example in which "Kikai ga" is detected as matching data.

In step S9, it is determined whether or not there is a homophone word candidate having homophone word information that matches the learning data. When a negative determination is made, the process returns to step S6. If an affirmative decision is made, then the flow shifts to step S10, and in step S10, the matched homophone candidate is moved to the first homophone candidate. FIG. 5 shows how "Kikai ga" detected as matching data is moved to the first position. Then, in step S11, it is determined whether or not all the homonym candidates have been sorted. If a positive determination is made, step S6
Return to. On the other hand, if a negative decision is made, step S12.
Move to. As described above, the comparison processing is performed on all the learning data stored in the homophone word information storage area 2, or the homophone word candidates after finishing the sorting processing on all the homophone word candidates are shown in FIG. As shown.

In step S12, the same-sound candidate is output to the output device 3. An output example is shown in FIG. Then, in step S13, when the selection cursor is moved to the desired homophone and is selected (an example in which the selection cursor is moved to "Kikai ga" is shown in FIG. 8), it is selected in step S14. The learning data of the same phoneme is stored in the learning data storage area 1 and the learning data storage area 2, and the process ends. 9 and 10 show how the selection history is stored.

On the other hand, when a negative determination is made in step S11, the process proceeds to step S12.

Therefore, in the conventional example, the homophone word candidates are shown in FIG.
In contrast to the output as shown in FIG.
The output will be as shown in FIG. That is,
In the conventional example, the learning effect of the “machine” that had been learned so far has disappeared, so it is displayed as the fourth homophone candidate,
In the present embodiment, since the selection history of the “machine” that has been learned so far remains, this effect appears at the time of displaying a homophone word candidate and is displayed as the next homophone word candidate.

As described above, by storing the learning data in the learning data storage area 1, it is guaranteed that the selected homophone is output as the first candidate for the next conversion, and the learning data storage area is also ensured. Storing in 2 ensures that the output order of homophones is rearranged into the usage order. The effect of the selection history becomes more remarkable as the number of homophones increases. Output example of homophone word candidates in the conventional example (Fig. 2
1)), the output order is the order of using homophones in this embodiment. An output example is shown in FIG.

Therefore, the more frequently used the operator who uses the kana-kanji conversion, the more the words are output to the front of the homonym candidate, and the number of key operations until the homonym is determined is reduced, and the operability is reduced. improves.

[0027]

As described above, according to the present invention,
Since it is configured as described above, the operability can be further improved.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention.

2 is a flowchart showing an example of a character processing program stored in a ROM 21 shown in FIG.

FIG. 3 is a diagram showing a state of homophone determination.

FIG. 4 is a diagram showing a state of homophone determination.

FIG. 5 is a diagram showing how “Kikai ga” detected as matching data is moved to the first position.

FIG. 6 is a diagram showing an example of homophone candidate after sorting.

FIG. 7 is a diagram showing an output example at the time of listing homophone candidates.

FIG. 8 is a diagram showing an example in which a selection cursor is moved to “Kikai ga”.

FIG. 9 is a diagram showing how a selected homophone is stored in a learning data storage area 1.

FIG. 10 is a diagram showing how a selected homophone is stored in a learning data storage area 2.

FIG. 11 is a diagram showing an output example at the time of listing homophone candidates in a conventional example.

FIG. 12 is a diagram showing an output example at the time of listing homophone words in one embodiment.

FIG. 13 is a diagram showing an output example at the time of listing homophone candidates in one embodiment.

FIG. 14 is a diagram showing how “instrument” is registered as a first candidate in the conventional example.

FIG. 15 is a diagram showing an output example of a first candidate in a conventional example.

FIG. 16 is a diagram showing a state of extracting homophone words.

FIG. 17 is a diagram showing an output example at the time of listing homophone candidates in a conventional example.

FIG. 18 is a diagram showing an example in which “Kikai ga” is selected from the homonym candidates in the conventional example.

FIG. 19 is a diagram showing how selection candidates are stored in a conventional example.

FIG. 20 is a diagram showing an output example of homophone word candidates in a conventional example.

FIG. 21 is a diagram showing an output example of homophone word candidates in a conventional example.

[Explanation of symbols]

 1 Input Device 2 Central Processing Unit 3 Output Device 5 Storage Device 21 ROM 22 RAM

Claims (1)

[Claims] 1. A character processing apparatus having a storage means for storing a homophone word candidate, each time a homophone word is selected, the selected homophone word is extracted from the homophone word candidate of the storage means, and the extracted homophone word is extracted. Arranging means for placing a word at the head of the homonym word candidate, and aligning the positional relationship of the extracted homonym words before and after the homonym word with each other, and an instructing means for instructing the output of all the homonym word candidates, A character processing device comprising: output means for outputting homophone word candidates in the order in which they are arranged by the arrangement means when the output of all homophone words candidates is instructed by the instruction means.