JPS62251962A - Word processor - Google Patents

Abstract

PURPOSE:To preferentially display the latest used conversion candidate by converting the order of use so that conversion candidates of high frequency in use among plural dictionaries for Kana(Japanese syllabary)-Kanji(Chinese character) are preferentially displayed. CONSTITUTION:A Kana-Kanji converting device 4-1 retrieves homonyms corresponding to inputted Kana characters from a dictionary memory 5-1 and stores the order of frequency in appearance, the dictionary number, and the conversion candidate code in a conversion candidate buffer 6-1. It is checked whether the conversion candidate in the buffer 6-1 is stored in a learning buffer 7-1 or not, and the order of frequency in appearance is rewritten if it is stored there. Kana characters held in the buffer 6-1 are transferred to a Kana-Kanji converting device 4-2, and the device 4-2 retrieves corresponding homonyms from a dictionary memory 5-2 and stores a read-out conversion candidate in a buffer 6-2. It is checked whether the conversion candidate in the buffer 6-2 is stored in a learning buffer 7-2 or not; and if it is stored there, the order in a frequency order area is rewritten while referring to the storage order of the conversion candidate and is displayed on a device 9.

Description

[Detailed Description of the Invention] Technical Field> The present invention relates to a word processor that creates sentences by converting kana characters or kana sentences into corresponding kanji or kanji-mixed sentences. This invention relates to a word processor that has a learning function that displays and selects homophones in order of priority.

<Prior Art> In general, the selection of homophones is important in word processors, and various proposals have been made and put into practical use.

As an example of typical homophone selection that has been put into practical use, homophones are arranged and output in advance in order of frequency of appearance, while a table called a learning buffer is set up, and the point closest to this learning buffer is The homonyms used are prioritized and registered, and when selecting subsequent homonyms, the homonyms are output in the order in which they were registered in the learning buffer, that is, the homonyms used most recently. There are word processors that do homophone selection.

The configuration of this conventional example will be specifically explained using FIG.

Reference numeral II denotes a keyboard device, which is composed of a group of kana keys arranged in alphabetical order, and a group of editing control keys including conversion keys, previous candidate keys, etc. The conversion key is the key operated when converting a kana sentence into a kanji or a sentence mixed with kanji, and if a kanji or a sentence mixed with kanji that is displayed after conversion is not the desired homophone, then another homophone is used. This is the key you operate when calling up a word. The previous candidate key is a key that is operated when a homophone that has already been output and displayed is called up again and displayed in the homophone call operation using the conversion key.

Reference numeral 12 denotes an editing control unit (hereinafter referred to as CPU), which performs editing control according to an editing program stored in a program memory (not shown). A text memory 13 stores text data edited by the CPU 2.

+4-1.14-2 is a dictionary memory device described later +5-
1. The kana-kanji conversion device provided corresponding to 15-2 converts the kanji or kanji-mixed sentences for the kana data transferred from the CPU 12 into the dictionary memory device 15.
~1.15-2, the corresponding candidate is stored in the conversion buffer +6-1.16-2 described later, and the address data of the designated candidate is stored in the learning buffer +7-1.
17-2.

The dictionary memory device 15-1 is a proper noun dictionary memory, and the dictionary memory device 15-2 is a dictionary memory for general terms.Since the word significations stored in both dictionary memories are quite different, the format of data compression is different. It's different. However, both dictionary memories 151°15-2. ! ：Also uses kana sentences as headwords and memorizes the corresponding kanji or kanji-mixed sentences, and the homophones corresponding to each kana sentence are:
They are stored in advance in a fixed order of appearance frequency.

The conversion candidate buffer +6-1.16-2 is provided corresponding to the kana-kanji conversion device +4-1.14-2,
All conversion candidates for the input kana character (corresponding homophone) are temporarily stored.

The learning buffer +7-1.17-2 is the kana-kanji conversion device +4. -1, I4-2. It stores the headwords of previously used words.

+8 is a display control unit of the CRT display device 19, which has a built-in display memory for storing input kana sentences, converted and edited data, etc., and also displays the stored data etc. 1
Display on 9.

Here, to explain the operation when conversion candidates are stored in the conversion candidate buffer +6-1, the input kana data first enters the kana-kanji conversion device, and then the kana data is transferred to the dictionary memory device 15-1. , a search for conversion candidates is performed.

The searched conversion candidates are Kana-Kanji converter +4. −
1 and stored in the conversion candidate buffer 16-1. The order stored in the conversion candidate buffer +6-1 at this time is:
The order of appearance frequency is determined in advance and fixed in the dictionary memory 15-1.

Next, using Figure 5, the conversion candidate buffer +6-1°+6-
2 and the operation of arranging conversion candidates in the order in which they were most recently used. FIG. . The conversion candidate buffer 16-1 includes an area (a) indicating the appearance frequency ranking for all conversion candidates, and a dictionary number area (a) storing a dictionary number indicating the position of the dictionary in which the conversion candidates are stored.
B),! : and a conversion candidate code area (c) indicating character codes of conversion candidates, and a group of conversion candidates indicated by the same kana characters are stored in a structure having one headword. When called from the dictionary memory +5-1 and stored in the conversion candidate buffer, the conversion candidates are arranged in the order of predetermined frequency of appearance.

(b) is a diagram showing the internal configuration of the learning buffer 17-1 that stores previously used words. The learning buffer 1
7-1 is provided in an area for storing dictionary numbers of previously used words), and stores dictionary numbers in order from the word used at the closest time. In other words, Figure 5 (
The learning buffer 17-■ shown in I)) stores that "Takeda" and "Takeda" have already been used, and that "Takeda" was used at the closest point in time.

The operation of arranging the contents of the conversion candidate buffer +7-1 in the order of the conversion candidates used most recently will now be described.

First, there is a kana character input, the conversion candidate is Dictionary Memo IJ
It is called by I5-1 and stored in the conversion candidate buffer 16-■. Next, in order to check whether there are any previously used words among the conversion candidates, the learning buffer 17-1 is checked to see if there is a corresponding dictionary number. If the corresponding word exists in the learning buffer, the contents of the conversion candidates are replaced according to the order of use. That is, the contents in the conversion candidate buffer shown in (a) are rearranged into the arrangement shown in (c) according to the usage order in the learning buffer shown in (b). After this replacement operation is completed, the items are displayed on the display according to the ranking in the appearance frequency ranking area (a) shown in (c).

FIG. 5(d) is a diagram showing the internal structure of the conversion candidate buffer 16-2 which is a memory for general terms. Compared to the internal configuration of the conversion candidate buffer 16-1, the area (A) indicating the appearance frequency ranking for all conversion candidates and the conversion candidate code area (C) indicating the character needs of conversion candidates have similar configurations, but This is because the part that stores the dictionary number where the candidate is stored is the address area (e) that indicates the address position, and the word meaning number that is stored in the address is quite different, so the data compression format is different. .

(e) is a diagram showing the internal structure of the learning buffer 17-2 that stores previously used words. The learning buffer 1
7-2 includes an area (g) for storing the address of the dictionary number of the previously used word and an area (g) for storing the segment, and the words are stored in order from the word used at the closest point in time. In other words, the learning buffer 17-2 shown in FIG. 5(e) remembers that "Takeda" and "Jouda" have already been used, and that "Takeda" was used at the closest point in time than "Jouda". The operation of rearranging the contents of the conversion candidate buffer 17-2 in the order of the conversion candidates used most recently is the same as in the case of the conversion candidate buffer 17-1, and will therefore be omitted.

(f) is the conversion candidate buffer 16- after rearranging the array.
2 is a diagram showing the contents of No. 2.

Conventional word processors as mentioned above use different data compression methods, so the conversion program corresponding to each conversion dictionary is different, and the configuration of the learning buffer is also necessarily different, so a learning buffer is provided for each dictionary memory device. It is being Therefore, each dictionary memory device has the ability to learn, and since it is not possible to learn between all dictionaries, it has the disadvantage that the original effect of the learning function decreases as the number of types of dictionaries increases. are doing.

<Object of the invention> The present invention has been made in view of the above-mentioned drawbacks.
It is an object of the present invention to provide a word processor capable of learning by switching to all learning buffers even if the configuration includes a plurality of learning buffers.

<Embodiment> A word processor having two dictionary memories will be described below as an embodiment of the present invention.

FIG. 1 is a diagram showing the configuration of the word processor.

Reference numeral 1 denotes a keyboard device, which is composed of a group of kana keys arranged in alphabetical order, and a group of editing control keys including conversion keys, previous candidate keys, etc. The conversion key is a key that is operated when converting a kana sentence into a kanji or a kanji-mixed sentence. This key is used to call up the homophone of . Also, the previous candidate key is
In the operation of calling up a homophone using the conversion key,
This key is used to recall and display a homophone that has already been output and displayed.

Reference numeral 2 denotes an editing control unit (hereinafter referred to as CPU), which performs editing control according to an editing program stored in a program memory (not shown), and also controls multiple learning buffers 7-1, which will be described later.
．． 7-2, all learning buffers 7-1.
A series of operations for assigning the order of use are controlled from 7 to 2. 3 is a text memory that stores text data edited by the CPU 2;

4-1.4-2 is a dictionary memory device 5-1゜5- which will be described later.
Kana-kanji conversion devices are installed corresponding to 2.
The dictionary memory device 5-1.5-2 is searched for kanji or sentences mixed with kanji for the kana data transferred from the CPU 2, and conversion buffers 6-1 and 6-2 are used to select relevant candidates, which will be described later.
Further, address data of the designated candidate is stored in a learning buffer 7-1.7-2, which will be described later.

The dictionary memory device 5-1 is a proper noun dictionary memory, and the dictionary memory device 5-2 is a dictionary memory for general terms.Since the word significations stored in both dictionary memories are quite different, the data compression format is different. It's different. However, both dictionary memories 5-1 and 5-2 store kanji or kanji-mixed sentences corresponding to kana sentences with kana sentences as headwords, and homophones corresponding to each kana sentence are stored in advance in order of appearance frequency. They are stored in a fixed order.

The conversion candidate buffer 6-1.6-2 is provided corresponding to the kana-kanji conversion device 4-1.4-2, and all conversion candidates for homophones corresponding to the input kana characters are temporarily stored. The learning buffer 1.7-2 is stored in the kana-kanji conversion device 4.
-1.4-2, respectively, and store the headwords of previously used words.

8 is a display control unit of the CRT display device 9,
It has a built-in display memory in which input kana sentences, converted and edited data, etc. are stored, and the stored data, etc. are displayed on the CRT display device 9.

Here, to explain the operation when conversion candidates are stored in the conversion candidate buffer 6-1, the input kana data first enters the kana-kanji conversion device, and then the kana data is transferred to the dictionary memory device 5-1. , 0, where conversion candidates are searched, and the searched conversion candidates are stored in the conversion candidate buffer 1 via the kana-kanji conversion device 4-1. The order stored in the conversion candidate buffer 6-1 at this time is the dictionary memory 5
-1 in accordance with the appearance frequency order fixed in advance.

Next, using Fig. 2, we will explain the internal structure of the exchange candidate buffer pro 1゜6-2 and the operation of arranging conversion candidates in the order in which they were used most recently. FIG. 6 is a diagram showing the internal configuration of a certain conversion candidate buffer 6-1. The conversion candidate buffer 6-1 includes an area (i) indicating the appearance frequency ranking for all conversion candidates, and a dictionary number area (ro) storing a dictionary number indicating the position of the dictionary where the conversion candidate is stored.
and a conversion candidate code area (HA) for storing character codes of conversion candidates, and a group of conversion candidates indicated by the same kana characters is stored in a structure in which one headword is assigned.

FIG. 2(b) is a diagram showing the internal configuration of the learning buffer 17-1 that stores words previously used in the conversion candidate buffer 6-1. The learning buffer 7-1 includes an area for storing the dictionary numbers of previously used words and an area for storing the usage order indicating the time of use, and stores the used words in sequence. I remember.

FIG. 2(d) is a diagram showing the internal structure of the conversion candidate buffer 6-2, which is a memory for general terms. When compared with the internal configuration of the conversion candidate buffer 6-1, the area (i) indicating the appearance frequency ranking for all conversion candidates and the conversion code area (ha) indicating the character code of the conversion candidates have similar configurations. The part that stores the dictionary number where the candidate is stored is an address area (ha) that indicates the address position,
It is divided into a segment area (to) indicating which segment of the address. A group of conversion candidates indicated by the same kana character is stored with one headword.

FIG. 2(e) is a diagram showing the internal structure of the learning buffer 7-2 that stores words previously used in the conversion candidate buffer 6-2. The learning buffer 7-1 has an area (
), an area (chi) for storing addresses, and an area (su) for storing the order of use indicating the time of use, and used words are stored in order.

(c) in FIG. 2 shows the contents of the conversion candidate buffer 6-1 after changing the appearance frequency order (i) of the conversion candidate buffer 6-1 based on the usage order stored in the learning buffer 7-1. ing.

Similarly, (f) is the appearance frequency ranking (
2) shows the contents of the conversion candidate buffer 6-2 after changing the conversion candidate buffer 6-2.

Note that the above-mentioned changed appearance frequency ranking (i) is not a usage ranking for each dictionary memory device, but a usage ranking for all dictionary memory devices.

Here, we will explain the operation of rewriting the order of use of conversion candidate buffers 7-1.7 to 2 in the order in which they were most recently used.0 The operator first inputs the kana characters to be converted into kana-kanji. Do (Sl). The input kana characters are then stored in sentence memory 3.
(S
2) If you want to convert the input kana characters to kanji or sentences mixed with kanji, use 1. A conversion instruction command is given to the CPU 2 (S8). As a result, the CPU 2 first transfers the kana characters held in the kana data buffer example to the kana-kanji conversion device 4-1 in order to search for proper noun conversion candidates (S4
).

The kana-kanji conversion device 4-1 searches the dictionary memo +75'-1 for homophones corresponding to the input kana characters. This search is performed by referring to the headword corresponding to the conversion candidate stored in the dictionary memory 5-1 (S5). Then, the conversion candidates are sequentially read out, and the conversion candidate buffer 6-1
Store the fixed appearance frequency ranking, dictionary number, and conversion candidate code of each conversion candidate in , and end the search (
S6).

(S7), (S8).

When the search for conversion candidates is completed, the conversion candidate buffer 6-1
Check whether the conversion candidates stored in the learning buffer 7-1 are stored in the learning buffer 7-1 (in other words, whether they have been used before or not) (S9), (510), and if they are stored, what is their storage order? (In other words, what is the ranking used at the closest point in time?) and rewrites the ranking in the appearance frequency ranking area (i) according to this ranking (S11).

When the candidate search process for the dictionary memo IJ 5-1 is completed as described above, the kana characters held in the kana data buffer are transferred to the kana-kanji conversion device 4-2 in order to search for conversion candidates for general terms. (512).

The kana-kanji conversion device 4-2 searches the dictionary memory 5-2 for homonyms corresponding to the input kana characters. This search is performed by referring to the headword corresponding to the conversion candidate stored in the dictionary memory 5-2 (513). Then, the conversion candidates are sequentially read out, and the fixed appearance frequency ranking, dictionary number (segment, address), and conversion candidate code of each conversion candidate are stored in the conversion candidate buffer 6-2, and the search is ended (514). , (315), (51
6).

When the search for conversion candidates is completed, the conversion candidate buffer 6-2
517), (Sl8), and if so, what is the storage order? (In other words, what is the ranking used at the closest point in time?) and rewrites the ranking in the appearance frequency ranking area (i) according to this ranking (319).

By performing the following operations, for example, as shown in FIGS. 2(C) and 2(f), the appearance frequency ranking area of the conversion candidate buffers 6-1 and 6-2, which are the rankings used at the closest point in time, is determined. The ranking of is rewritten.

The candidate with the rank "1" is the kana-kanji converter 4-1.
Alternatively, it is read out via 4-2 and displayed on the CRT display device 9 via the display control unit 8 (520).
. The operator judges whether the displayed conversion candidates are desired ones (521), and if so, issues a selection instruction from the keyboard device 1 (S22). In response to this selection instruction, the CPU 2 stores the displayed selection candidates at a predetermined address in the text buffer 30 (528). This completes the conversion candidate selection process, but
Furthermore, the learning buffer 7 is made to learn the conversion candidate selected this time (S24).

If the desired conversion candidate is not displayed in S2+, the operator operates the conversion key on the keyboard device 1 to call up the next conversion candidate (S25).

This operation is then repeated until the desired conversion candidate is called up, and when the desired conversion candidate is called up, a selection instruction is given from the keyboard device 1 (S22). The learning operation of 7-1.7-2 will be explained using the flowchart of FIG.

First, it is determined to which dictionary memory device the newly selected conversion candidate belongs.

That is, in the embodiment, it is determined whether the candidate is a proper noun candidate or a general term candidate (341).

The conversion candidate is a proper noun candidate. ! 0: When identified, the learning buffer 7-1 is searched to see if a learning table for the conversion candidate exists (S42), and whether or not it exists is determined (S43).

If a learning table exists, the learning table is searched to see if the conversion candidate has been learned (S44), and whether or not the conversion candidate is learned is determined (S45).

If the conversion candidate has already been learned, the ranking of the conversion candidate in the usage ranking storage area is replaced with "1" (S46
). It is then determined whether any other conversion candidates are stored in this table (S47), and if no other conversion candidates are stored, the process advances to S5Q.

If it is determined that other conversion candidates are stored in step 547, the rankings of the conversion candidates that have priority over the ranking of the selected conversion candidate before replacement are shifted up by one (948). .49) The learning of the learning buffer 7-1 ends with this.

Next, the learning buffer 7-2 is searched to see if a learning table for the conversion candidate exists (550), and it is determined whether the learning table exists (551). If there is no learning table in the learning buffer 7-2, learning in the learning buffer 7-2 ends (S54
).

In step 551, if there is a learning table, the rankings of conversion candidates that have a priority over the ranking of the selected conversion candidate before replacement are shifted up by l (S
52, 58), the learning of the learning buffer 7-2 ends (S54).

If it is determined in step 345 that the selected conversion candidate does not exist in the learning table, the conversion candidate is stored (555) and the usage order of the conversion candidate is set to "1" (S56). It is then determined whether other conversion candidates are stored in the learning table (557), and if no other conversion candidates are stored, the process advances to S59.

If it is determined in S57 that other conversion candidates are stored, the ranks of the conversion candidates that have a higher priority than the selected conversion candidate's pre-replacement rank are shifted up by i (558). This completes the learning of the learning buffer 7-1.

Next, the learning buffer 7-2 is searched to see if a learning table for the conversion candidate exists (559), and it is determined whether the learning table exists (360). If there is no learning table in the learning buffer 7-2, learning in the learning buffer 7-2 ends (S54
)O If there is a learning table in 360, shift up the rankings of each conversion candidate whose ranking is prioritized over the ranking of the selected conversion candidate before replacement by one (5
61) At this point, learning of learning buffer 7-2 ends (
554).

If there is no corresponding table in step 343, a table is created (562), the selected conversion candidate is stored, and the learning of the learning buffer 7-1 is completed. The process then proceeds to S59, whereupon the learning buffer 7-2 is trained.Furthermore, when the conversion candidate is identified as a general term candidate in step 341, the learning buffer 7-2 is first trained;
Next, learning is performed on the learning buffer 7-1. That is, compared to when a proper noun is selected, the operation itself is the same as t, except that the learning order of the learning buffer is reversed.

<Effects of the Invention> As described above, the word processor of the present invention includes a plurality of kana-kanji conversion dictionaries in which conversion candidates that are kanji or kanji-mixed character strings corresponding to kana character strings are stored in advance, and the plurality of kana-kanji conversion dictionaries. A plurality of learning buffers are provided corresponding to each of the learning dictionaries, and register the learned kana character string conversion candidates along with the usage order indicating the order in which they were used. Since it is equipped with a control device that ranks a series of usage rankings, the usage ranking is changed so that the most frequently used conversion candidates are prioritized and displayed across all kana-kanji conversion dictionaries, so the most recently used conversion Candidates can be displayed with priority.

[Brief explanation of drawings]

FIG. 1 is a diagram showing the configuration of the word processor according to the present invention, FIG. 2 is a diagram showing the internal configuration of the conversion candidate bar 7a and learning buffer of the word processor, and FIG. 53 is the operation of the word processor during kana-kanji conversion. 4 is a flowchart showing the learning operation of the learning buffer, FIG. 5 is a diagram showing the internal configuration of the conversion candidate buffer and learning buffer of a conventional word processor, and FIG. 6 is a configuration diagram of the conventional word processor. . 2: CPU, 4-1.4-2: Kana-kanji conversion device,
5-1.5-2 + dictionary memory device, 7-1.7-2: Learning buffer agent Patent attorney Takeshi Sugiyama (and 1 other person) Figure 1 Figure 2

Claims (1)

[Scope of Claims] 1. In a word processor that creates a text by converting a character string input in kana to a kanji character string or a character string mixed with kana and kanji characters, the character string is a kanji character string or a character string mixed with kanji characters that corresponds to the kana character string. A plurality of kana-kanji conversion dictionaries in which conversion candidates are stored in advance, and a function that indicates the order in which the learned kana character string conversion candidates are used, which are provided corresponding to each of the plurality of kana-kanji conversion dictionaries. By providing a plurality of learning buffers that are registered with rankings and a control device that assigns a series of usage rankings across all the learning buffers when learning the learning buffers, the usage frequency can be determined across the plurality of kana-kanji conversion dictionaries. A word processor characterized in that the usage order of conversion candidates can be changed so that higher conversion candidates are displayed with priority.