JPH0638258B2 - Character processor - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a character processing device having a learning function and a kana-kanji conversion function.

[Prior art]

In order to realize a kana-kanji conversion function with a learning function in this type of device, the following method has been conventionally used.

A memory is provided for storing information regarding learning corresponding to each word in the dictionary.

In this case, since a storage area proportional to the number of words in the dictionary is required, there is a drawback that the cost increases if the number of words is large.

The word position in the dictionary is replaced according to the frequency of use of the word, and the word position is prioritized.

This method is not possible when using a read-only memory as a dictionary, and when using a floppy disk as a dictionary, it takes time to process because it involves writing to the floppy disk. There is.

〔Purpose〕

An object of the present invention is to eliminate the above-mentioned drawbacks, efficiently use a small storage area irrelevant to the number of words in a dictionary, and perform kana-kanji conversion that prioritizes learned words in a short processing time. It is to provide a character processing device that can be realized.

〔Example〕

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

FIG. 1 shows the overall construction of the character processing apparatus of the present invention. That is, the device of the present invention is the reading input means 1 for inputting the reading.
And a reading memory 2 for storing the reading input by the reading input means 1, a kanji conversion instructing means 3 for instructing to convert the reading stored in the reading memory 2 into kanji, and the reading and kanji are associated with each other. A first dictionary 4 to be stored, a second dictionary 5 to store previously selected readings and kanji, a homophone meaning word memory 6 to store homonyms, and a order for determining homonyms An evaluation means 7 for obtaining a score, a kanji conversion means 8 for converting the reading into kanji, a display means 9 for displaying a part or all of the homonyms stored in the homonym memory 6, and a character are stored. The character memory 10 and the homonym selection instruction means 11 for instructing to select one of the homonyms stored in the homonym memory 6
And a homonym synonym selection means 12 for selecting a homonym and storing it in the character memory 10 and the second dictionary 5.

The above-mentioned evaluation means 7 gives a higher score to the kanji stored in the second dictionary 5 than the kanji stored in the first dictionary 4. When the Kanji conversion instructing unit 3 instructs conversion, the Kanji conversion unit 8 uses the first dictionary 4 and the second dictionary 5 to convert the readings stored in the reading memory 2 into Kanji. Further, the homonyms with high scores obtained by the evaluation means 7 are stored in the homonyms memory 6 as high-rank candidates. Further, when the homonym synonym selection means 12 is instructed to select by the homonym synonym selection instructing means 11, the homonym synonym is stored in the character memory 10 while the selected homonym and reading are selected. The second dictionary 5
To memorize.

FIG. 2 shows an embodiment of the character processing device of the present invention. Reference numeral 21 denotes a keyboard which constitutes the input means 1, the conversion instruction means 3 and the selection instruction means 11 in FIG. 1, and for example, a character key for instructing the input of kana characters and symbols and an instruction for executing kana-kanji conversion. It has a conversion key, a selection key for instructing the selection of homophones, and various function keys for instructing other processing operations necessary for character processing.

Reference numeral 22 is an evaluation means 7, a conversion means 8 and a selection means of FIG.
A CPU (Central Processing Unit) in the form of, for example, a microprocessor, which constitutes 12, and a program memory (PROM) 24
Various controls necessary for character processing are performed according to the processing procedure stored in.

23 is a read-only memory (ROM), and program memory 24
And a first dictionary (memory) 25. The program memory 24 stores in advance the processing procedure shown in the flowchart of FIG. The first dictionary 25 corresponds to the dictionary 4 in FIG. 1, and stores readings and kanji for Kana-kanji conversion in association with each other.

Reference numeral 26 denotes a writable memory (RAM), which is a reading memory 27, a homophone meaning word memory 28, a character memory 29, a second dictionary 30, a homophone meaning word displaying flag 31, a homophone meaning word number register 32, and a cursor register 33. And other storage area 34 required for character processing. The reading memory 27 corresponds to the reading memory 2 in FIG. 1 and stores characters input from the keyboard 21.

The homophone meaning word memory 28 corresponds to the synonym word memory 6 in FIG. 1 and stores the homophone meaning words converted by the kana-kanji conversion. The character memory 29 corresponds to the character memory 10 in FIG. 1,
The selected homonym word is stored. The second dictionary 30 is the first
It corresponds to the second dictionary 5 in the figure and stores the selected homonym meaning words and readings, and the stored homonym meaning words and readings are referred to in the subsequent Kana-Kanji conversion.

The homophone meaning word display flag 31 stores whether or not the homophone meaning word is being displayed. The homophone significant word number register 32 stores the number of the homophone significant word being displayed. Cursor register 34
Stores the cursor position.

Reference numeral 35 is a display corresponding to the display means 9 in FIG. 1, and is a character memory 29 and a reading memory 27 or a homophone meaning word memory.
Display the characters stored in 28. Reference numeral 36 is a bus line for transferring address signals, data signals and control signals necessary for controlling each part. CPU22 is this bus line 3
It is connected to the keyboard 21, the read-only memory 23, the writable memory 26 and the display 35 via 6.

FIG. 3 shows the CP stored in the program memory 24 of FIG.
It is a flow chart which shows an example of the processing procedure of the character processing device of the present invention performed by U22. Next, an operation example of the device of the present invention shown in FIG. 2 will be described with reference to the flowchart shown in FIG. First, when the power is turned on, a key input from the keyboard 21 is awaited in step S1. At this time,
The memory contents of the reading memory 27, the character memory 29, and the second dictionary 30 are empty, the homophone meaning word display flag 31 is in a reset state, and the cursor register 33 stores the start position of the character memory 29. is doing.

After that, when a character key is input from the keyboard 21, the input key determination procedure of step S2 is performed, and then step S3 is performed.
If the homophone meaning word display flag 31 is in the reset state, the character input in the next step S4 is stored in the reading memory 27, and then the character memory is stored in step S5.
29 and the characters stored in reading memory 27 are displayed 35
Is displayed, and the process returns to the key input standby in step S1. If the homophone meaning word display flag 31 is in the set state, the input of the character key is due to an erroneous operation, and the process immediately returns to the key input standby in step S1.

When the conversion key is keyed in in step S1, the process proceeds to step S6 through the input key determination procedure in step S2, and if the homophone meaning word display flag 31 is in the reset state, the process proceeds to the next step S7 and the reading memory 27 The corresponding word (kanji) stored in the second dictionary 30 is searched based on the reading of the kanji stored in. If the word is found, the process proceeds to step S9 via step S8, and the found word is stored in the homonym meaningful word memory 28 as the homonym significant word. At this time, the word found earlier is stored so that it becomes a high-ranked candidate having a higher rank to be selectively displayed. Next, returning to step S7, the above-described search operation is repeated.

When the corresponding word is no longer found in the second dictionary 30, the process proceeds to step S10 through step S8, and the word (kanji) corresponding to the above-mentioned reading stored in the first dictionary 25 is searched. After that, in steps S10 to S12,
The same search and memory storage processing as in S7 to S9 is performed, and this processing is repeated until the corresponding word is no longer found in the first dictionary 25.

When the corresponding word is no longer found in the first dictionary 25, the process proceeds to step S13 through step S11, and the homophone meaning word displaying flag 31 is set. Next, proceeding to step S14, "1" is stored in the homonym significant word number register. Next, in step S15, among the characters stored in the character memory 29 and the same-sound significant words (kanji) stored in the same-sound significant word memory 28, the order of “1” indicated by the same-sound significant word number register 32 ( The first candidate) homophone meaning word display
The message is displayed at 35, and the process returns to step S1 again. Therefore, the words searched from the second dictionary 30 have a higher rank than the words searched from the first dictionary 25, and the word with the highest rank is the first rank.
First displayed as a candidate for.

On the other hand, if it is determined in step S6 that the homonym significant word displaying flag 31 is in the set state, step S1
The process shifts to 6 and "1" is added to the homonym meaning word number register 32. Next, proceeding to step S17, it is determined whether or not the numerical value stored in the homonym significant word number register 32 is larger than the number of homonym significant words stored in the homonym significant word memory 28, and the value is large. If there is, that is, if it is determined that the register value has exceeded the number of homophone meaning words stored in the memory 28, "1" is stored in the homophone meaning word number register 32 in step S14, and the process proceeds to step S15. If it is determined in step S17 that the register value is not large, the process directly proceeds from step S17 to step S15.

Next, in step S15, among the characters stored in the character memory 29, and the homophone significant words stored in the homophone significant word memory 28, the homophone significant words in the order indicated by the homophone significant word number register 32, that is, Homophone word having the next rank of the currently displayed homophone word is displayed
Display on 35. Then, the process returns to step S1.

When the selection key is input from the keyboard 21 in step S1, the process proceeds to step S18 via step S2,
If the homophone meaning word display flag 31 is in the set state, in step S19, among the homophone meaning words stored in the homophone meaning word memory 28, the homophone meaning words in the order indicated by the homophone meaning word number register 32, that is, The homophone meaning word currently being displayed is stored in the character memory 29. At this time, the contents of the cursor register 33 are updated at the same time according to the number of characters of the stored homonym significant words. Then go to step S20,
The reading of the reading memory 27 and, of the homonym significant words stored in the homonym significant word memory 28, the homonym significant words in the order indicated by the homonym significant word number register 32 are stored in the second dictionary.
Store at the beginning of 30. At this time, the word previously at the beginning is sequentially moved to the second, the word at the second is moved to the third, and the last word is lost from the second dictionary 30.

Next, in step S21, the reading stored in the reading memory 27 is cleared, the homophone meaning word display flag 31 is reset in the next step S22, and further stored in the character memory 29 in the next step S23. The displayed characters are displayed on the display 35 and the process returns to step S1.

On the other hand, if it is determined in step S18 that the homonym meaning word display flag 31 is in the reset state, the selection key is input erroneously, so immediately step S1.
Return to.

Further, in the step S1, if a character key, a conversion key, or any other key other than the selection key is input, the process proceeds to step S24 through step S2, and other necessary for character processing depending on the type of the input key. Processing, for example, various processing such as editing, printing, or saving is performed, and the process returns to step S1.

FIGS. 4A to 4J show examples of display modes displayed on the display 35 by the processing operation of FIG. 3 in the order of display. Also,
FIGS. 5 (A) to 5 (D) show an example of the states of reading and kanji stored in the second dictionary 30 according to the processing operation order of FIG. C of FIG. 4 shows the cathode showing the position where the character is displayed next.

If, for example, three characters of “ki”, “ka”, and “i” are input from the keyboard 21 after the power is turned on, the three characters of the kana are stored in the reading memory 27 and displayed on the display 35 as shown in FIG. 4 (A). Is displayed in. Here, it is assumed that the left side screen of the display unit 35 is an area for displaying the reading or homophone meaning words, and the right side screen of the display unit 35 is an area for displaying a part of the characters stored in the character memory 29. In this figure, the cursor C is displayed at a position corresponding to the beginning of the character memory 29.

Next, when the conversion key on the keyboard 21 is pressed, the second dictionary 30 is searched first, but since the content of the second dictionary 30 is initially empty, the word corresponding to the reading "kikai" ( There is no kanji), and the search proceeds to the first dictionary 25. Here, it is assumed that the first dictionary 25 stores three words “machine”, “opportunity”, and “strange” as the kanji corresponding to the reading “kikai” in this order.

As a result of the search of the first dictionary 25, the three words "machine", "opportunity", and "strange" are stored in the homonym meaning word memory 28 in this order. First, the first candidate "machine" is shown in FIG. Displayed as shown in (B). Next, when the conversion key on the keyboard 21 is pressed, the "opportunity" of the second candidate is displayed as shown in FIG. 4 (C). When the conversion key on the keyboard 21 is further pressed, the candidate "strange" shown in FIG. 3 is displayed as shown in FIG. 4 (D). Next, when the selection key on the keyboard 21 is pressed, the homonym meaning word “strange” displayed on the left screen of the display 35 is selected, and the selected “strange” is stored in the character memory 29. Displayed on the right screen of 35. At the same time, the reading "Kaikai" stored in the reading memory 27 and the selected "strange monster" are stored at the head position of the second dictionary 30, and the contents of the second dictionary 30 are the fifth. The state is as shown in FIG. Here, the storage capacity of the second dictionary 30 is assumed to be 4 words.

Next, the kana of "ki", "ka", and "i" are entered again from the keyboard 21, and when the conversion key is pressed, this time, the previously selected "kikai" and "bizarre" are entered in the second dictionary 30. Is stored (see Fig. 5 (A)), the "strange" is the first
, And “machine” and “opportunity” are second and third candidates, respectively. Therefore, as shown in FIG. 4 (E), first, a “strange monster” is displayed on the left screen of the display unit 35, and as the conversion key on the keyboard 21 is pressed, FIG.
As shown in (G), “machine” and “opportunity” are sequentially displayed on the left screen of the display unit 35.

As shown in FIG. 4 (G), if the selection key of the keyboard 21 is pressed while the “opportunity” is displayed on the left screen of the display unit 35, “quick” is displayed as shown in FIG. 5 (B). And "opportunity"
And are stored at the head of the second dictionary 30, and the “kikai” and “strange” that were previously at the head are stored in the second storage position.

At this time, when the kana, "ka", and "i" phonetic alphabets are keyed in, the "opportunity" and "opportunity" are displayed as shown in FIGS. Bizarre ",
Corresponding words in the order of “machine” are displayed on the left screen of the display 35.

When the second dictionary 30 is in the state shown in FIG. 5 (B),
When “morning” and “daytime” are sequentially selected, the state of the second dictionary 30 becomes the state shown in FIG. 5 (C). That is, the word selected later is stored at the beginning, and the previously selected word is sequentially stored backward in the backward position. next,
If "night" is selected, the state of the second dictionary 30 is shown in FIG.
The state shown in (D) is obtained. That is, "yoru" and "night" are stored in the first position of the second dictionary 30, and "hiru" is stored.
"Day", "Asa", "Morning", "Kikai" and "Opportunity" are stored in the rear position in sequence, and the "Kikai" in the last position.
The "bizarre" will be lost.

Although the first dictionary 25 is stored in the read-only memory 23 in the above-described embodiment of the present invention, it may be stored in another storage medium such as a floppy disk instead of the memory 23. The first dictionary 25 is a basic dictionary (not shown) and a writable memory stored in the read-only memory 23.
It may be configured by a registration dictionary (not shown) stored in 26 and registerable by the operator.

Further, in this example, the order of homonymous meaning words is determined by the second dictionary.
Although it was performed implicitly by using the order stored in 30, the score is given in the order stored in the second dictionary 30 instead, and the score of another evaluation means is added to this score. For example, the order of the homonymous meaning words may be determined based on the selected frequency information, the result of the calculation such as the score and the addition based on the grammar processing, and the like.

Further, in this example, the second dictionary 30 stores only readings and Chinese characters, but in addition to these, auxiliary information such as grammatical information may be stored. Further, in this example, the second dictionary 30 had a fixed length sequential table structure (see FIGS. 5A to 5D), but instead of this, another structure, for example, a variable length It may be a table structure or a table structure with a linear list.

Further, in the present example, the reading itself is not stored in the homophone meaning word memory 28, but this reading may be stored in the homophone meaning word memory 28. Further, the reading memory 27 may be used in common with the character memory 29 instead of being independent. Further, while the same-sound meaning word is being displayed on the display 35, the same-sound meaning word currently being displayed may be temporarily stored in the character memory 29.

In this example, the reading and homophone meaning display areas are separated from the display areas of the characters stored in the character memory 29 (see FIGS. 4 (A) to (J)). Alternatively, other methods such as reading and homonym and character memory 29
The display area may be shared without distinguishing it from the characters stored in. Also, a plurality of homonymous meaning words may be simultaneously displayed on the display device 35.

Furthermore, the conversion instruction means 3 and the selection instruction means 11 in FIG.
Is not limited to a dedicated key, but may be any other input method. For example,
It is also possible to input a character key while the homonym meaning word is being displayed on the display 35, and to perform both the selection instruction and the character input instruction. Also, instead of sequentially performing conversion or selection, other procedures, such as reading, may be entered first and conversion and selection may be performed later, or only conversion may be performed first and the homophone meaning word display remains. , The next reading may be input and the selection may be made later.

Furthermore, the conversion instruction means 3 and the selection instruction means 11 in FIG.
Other additional indicating function may be added. As an example, the selection instructing means 11 may instruct the selection, and after the selection is executed, another reading or a search for a homonym meaning word may be performed.

Further, in the present example, when a word stored in the second dictionary 30 is selected, the same word is stored in a plurality of positions having different ranks, but instead of this,
When a word stored in the second dictionary 30 is selected,
The word is stored only in the first position of the second dictionary 30, and the previously stored word is deleted even if it was not originally stored in the first position. Good.

Also, instead of performing kana-kanji conversion, input romaji to romaji-kanji or romaji-kana-
Needless to say, kanji conversion may be performed, and if there is only one kanji candidate, it may be directly stored in the character memory 29 without being treated as a homophone meaning word. Further, the processing procedure may be configured such that a plurality of candidates for the same Chinese character do not appear on the display screen of the display 35.

〔effect〕

As described above, according to the present invention, when selecting a conversion candidate in Kana-Kanji conversion, unlearned words are given as options at the same time, while words that have been used later are given priority as candidates. When it is used again, the selection operation becomes simple, and even when using an unlearned word, the necessary candidate can be obtained in a short time.

Further, in order to perform learning, since a learning word dictionary (second dictionary) that stores learned words among the words in the dictionary is provided, the total number of words in the original dictionary (first dictionary) is set. A learning function can be realized by a small-capacity storage area that is unrelated to.

In addition, regardless of whether or not the word selected in this way has been learned, the selected word is stored in the dictionary of learned words without duplication, and only one is stored as the highest-ranked candidate. Thus, repeated use of learned words will not be learned independently. Therefore,
Inefficient memory usage occurs because the same word appears multiple times as a priority candidate in the selection operation, and more than one identical word is stored in the limited learning word dictionary. There is an effect that can be avoided.

Further, according to the present invention, since the implementation of the learning function is irrelevant to the physical configuration of the dictionary, even if the dictionary is exchanged, it is not necessary to initialize the storage area for storing the information related to the learning function. A character processing device having excellent operability can be simply configured.

[Brief description of drawings]

1 is an overall configuration diagram of the character processing device of the present invention, FIG. 2 is a block diagram showing an embodiment of the character processing device of the present invention, and FIG. 3 is an example of a character processing procedure by the device of the present invention shown in FIG. 4A to 4J are explanatory diagrams showing sequential display states on the display unit during character processing, and FIGS. 5A to 5D are second diagrams during character processing. FIG. 8 is an explanatory diagram showing a sequential storage state of storage areas of the dictionary. 1 ... reading input means, 2,27 ... reading memory, 3 ... kanji conversion instruction means, 4,25 ... first dictionary, 5,30 ... second dictionary, 6,28 ... homogeneous meaning Word memory, 7 ... Evaluation means, 8 ... Kanji conversion means, 9 ... Display means, 10,29 ... Character memory, 11 ... Homophone meaningful word selection instruction means, 12 ... Homophone meaningful word selection means, 21 ...... Keyboard, 22 ... CPU, 23 ... Read-only memory (ROM), 24 ... Program memory, 26 ... Writable memory (RAM), 35 ... Display unit.

Claims (1)

[Claims] 1. Corresponding input means for inputting a reading of a word, a first dictionary in which the reading and a notation of a word are associated and stored, and a reading and a notation of a word selected from the first dictionary. A second dictionary to be additionally stored, and words with a reading that matches the reading input by the input means are sequentially searched from the higher-ranked words in the second dictionary, and then sequentially searched from the first dictionary. Searching means, a candidate storing means for storing the readings of the reading words that match the input readings, searched by the searching means, in a descending order of priority, and stored in the candidate storing means. Candidate display means for sequentially displaying the notations of the selected words in accordance with the priority order, selection means for selecting the candidates displayed by the candidate display means, and the words selected by the selection means are stored in the second dictionary. Determine whether or not Determining means for controlling the reading and notation of the word selected by the selecting means so as to store the reading and notation of the word in the second dictionary at the highest rank; A second storage control means for controlling, when it is determined that the selected word is read and written, to store only one in the highest rank in the second dictionary. Character processing device characterized by.