JPS62251961A - Word processor - Google Patents

Abstract

PURPOSE:To preferentially display the latest candidate in all dictionaries by providing a common learning buffer where a conversion candidate of a learnt Kana(Japanese syllabary) character string is registered together with the priority level in the latest use and the classification of a used dictionary for Kana-Kanji(Chinese character) conversion. CONSTITUTION:If there is not a header word of a selected conversion candidate in the table of a learning buffer 7, another table is generated in the buffer 7, and the identification code and the dictionary number of a dictionary where the conversion candidate selected at this time should be stored are stored in this generated table. If there is said header word there, the dictionary number of the conversion candidate selected at this time is retrieved in the table; and if it is not stored, the identification code and the dictionary number of the dictionary are stored in the lowest address of the table as data of the latest use, and already stored data are shifted down to lower addresses successively. If data selected at this time is already stored in the table, this conversion candidate is stored in the lowest address again and original data is erased.

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 Generally, 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 homophones are registered in order of priority, starting with the used homophones, and when selecting subsequent homophones, the homophones are output in the order in which they are registered in the learning buffer, that is, in the order of the homophones used at the closest point. There are word processors that do homophone selection.

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

Reference numeral 1 is 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 kanji-mixed sentence, and also a key that is operated when the converted and displayed kanji or kanji-mixed sentence is not the desired homonym. 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.

14-1.14-2 is a dictionary memory device +5-1 which will be described later.
．． The kana/kanji conversion devices provided corresponding to the kanji/kanji conversion devices 15-2 convert the kanji or kanji-mixed sentences for the kana data transferred from the CPU 12 into the dictionary memory devices +5-1.
Search from 15-2, store the corresponding candidate in a conversion buffer 16-1.
Store in 2.

The dictionary memory device 15-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 15-1 and 15-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 16-1.16-2 is provided corresponding to the kana-kanji conversion device +4-1.14-2,
All homophone conversion candidates corresponding to the input kana characters are temporarily stored.

The learning buffer 17-1.17-2 is a kana-kanji converter +4-1.14-2. It stores the headwords of previously used words.

Reference numeral 18 denotes 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, the conversion candidate is the conversion candidate buffer, +6-1°16-2
To explain the operation when stored in the dictionary, the input kana data first enters the kana-kanji conversion device, then the kana data is transferred to the dictionary memory device 15-1 or +5-2,
A search for conversion candidates is performed. The searched conversion candidates are stored in the conversion candidate buffer 16-1 or 16-2 via the kana-kanji conversion device 14-1 or 14-2. Conversion candidate buffer 16-1 at this time. f) Ruiha 1
The ranking stored in 6-2 is the dictionary memo IJ I 5-!
Alternatively, the appearance frequency ranking is fixedly determined in advance in 15-2.

Next, using FIG. 5, the conversion candidate buffer 16-1゜16-
The internal configuration of 2 and the operation of arranging conversion candidates in the order in which they were used most recently will be described.

FIG. 5(a) is a diagram showing the internal structure of the conversion candidate buffer 16-1, which is a proper noun memory. The conversion candidate buffer +6-1u includes an area (a) indicating the appearance frequency ranking for all conversion candidates, and a dictionary number area (a) storing the dictionary number indicating the position of the dictionary in which the conversion candidates are stored.
B) and a conversion candidate code area (/　) for storing character codes of conversion candidates, and are stored in a configuration in which a group of conversion candidates indicated by the same kana characters is given one entry word. When called from the dictionary memo 1J15-1 and stored in the conversion candidate buffer +6-1, the conversion candidates are arranged in a predetermined order of appearance frequency.

(b) is a diagram showing the internal structure of the learning buffer 7-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-1 shown in b) stores that "Takeda" and "Takeda" have already been used, and that "Takeda" was used at the closest point in time.

Here, the operation of arranging the contents of the conversion candidate pack 777-I in the order of the conversion candidates used most recently will be described.

First, when a kana character is input, the conversion candidates are dictionary memory 1.
5-1 and stored in the conversion candidate buffer l6-1. 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. And learning buffer 17
If the corresponding word exists within -1, the order of conversion candidates is changed according to the order of use. That is, according to the usage order in the learning buffer 17-1 shown in (b), (a)
The contents in +6-Ll of the conversion candidate pamphlet shown in (c) are rearranged in the appearance frequency ranking area.

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. When compared with the internal configuration of the conversion candidate back 716-1, the area (a) indicating the appearance frequency ranking for all conversion candidates and the conversion candidate code area eυ indicating the character code of the conversion candidate have similar configurations, but The part that stores the stored dictionary number is the address area (e) that shows the address position.
This is because, as mentioned above, the word meaning numbers stored in the addresses are quite different, so the data compression formats are 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 is provided with 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 stores words in order from the most recent one. In the learning buffer l7-2 shown in Figure 5(e), we have already used ``takeda'' and ``jouda''
Moreover, it is remembered that ``takeda'' was used at the closest point in time than ``jōda.''

The operation of arranging the contents of the conversion candidate buffer 17-2 in the order of the conversion candidates used most recently is the same as that for the conversion candidate buffer 17-1, and will therefore be omitted.

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

Conventional word processors, such as those with two units, 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. is provided. Therefore, although it is possible to learn with each individual dictionary memory device, it is not possible to learn with all dictionaries, so the disadvantage is that the original effect of the learning function decreases as the number of types of dictionaries increases. There is.

<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 that can perform learning for all dictionaries even in a word processor having a plurality of dictionaries by configuring a single learning buffer.

<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, a group of editing control keys including a top key, a conversion key, a previous candidate key, and the like. The conversion key is a key that is operated when converting a kana sentence into a kanji or kanji-mixed sentence, and also a key that is operated when the converted and displayed kanji or kanji-mixed sentence is not the desired homonym. This is the key you operate when calling up a word. 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). 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.
A conversion buffer 6-1.6-2 searches the dictionary memory device 5-1.5-2 for kanji or sentences mixed with kanji for the kana data transferred from the CPU 2, and selects relevant candidates as described below.
Further, the address of the designated candidate is stored in a learning buffer 77, 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. In both 5-2, the kana sentence is used as a headword and the corresponding kanji or kanji-mixed sentence is memorized, and the homophones corresponding to each kana sentence are stored in advance in a fixed order of appearance frequency. There is.

The conversion candidate buffer 76-1.6-2 is provided corresponding to the kana-kanji conversion device 4-1.4-2, and temporarily stores all conversion candidates for homophones corresponding to the input kana characters. is housed in.

The learning buffer 77 is a kana-kanji converter 4-1゜4-2.
Kana-kanji conversion device 4-
1 and 4-2, the address of the conversion candidate designated for selection is stored.

That is, the learning buffer 17 stores the conversion candidates selected by all the kana-kanji conversion devices 4-1 and 4-2 of the current word processor.

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.

Note that conversion candidates are sent from the dictionary memory device 5-1 or 5-2 to the conversion candidate buffer 6- based on the input kana data.
The operation to be transferred to 1 or 6-2 is the same as that shown in the conventional example.

Next, with reference to FIG. 2, the internal structure of the exchange candidate buffers 76-1 and 6-2 and the operation of arranging conversion candidates in the order in which they were used most recently will be described.

FIG. 2(a) is a diagram showing the internal structure of the conversion candidate bag 76-1, which is a proper noun memory. The conversion candidate buffer 76-1 includes an area (()) indicating the appearance frequency ranking for all conversion candidates, a dictionary number area ((()) for storing the dictionary number indicating the position of the dictionary in which the conversion candidate is stored, and a It is provided with a conversion candidate code area (HA) for storing character codes, and is stored in a structure in which a group of conversion candidates indicated by the same kana characters is given one entry word.

FIG. 2(d) is a diagram showing the internal structure of the conversion candidate bag 16-2 which is a memory for general terms. Compared to the internal configuration of conversion candidate back arrow 1, the area (i) indicating the appearance frequency ranking for all conversion candidates and the conversion code area (ha) indicating the character code of conversion candidates have similar configurations. The part that stores the dictionary number is an address area (ha) that indicates the address position,
It consists of a segment area (to) indicating which segment of the address.

The array of conversion candidates when both conversion candidate buffers 6-1.6-2 are respectively called from the dictionary memo +75-1.5-2 and stored in the conversion candidate buffer 76-1.6-2 is as follows. They are in the order of predetermined frequency of appearance.

(b) in FIG. fS2 is a diagram showing the internal structure of the learning buffer 77 that collectively imports and stores data of previously used words from all the kana-kanji conversion devices 4-1, 4-2. The learning buffer 7 includes a dictionary identification area (1) for determining the type of word used in which dictionary, and a dictionary number storage area (2) for storing the dictionary number of the word, in the order of the words used at the closest point in time. I remember. That is, it remembers which dictionary the word was used from (1) and in what order it was used throughout the device.

In addition, in order to store dictionary numbers compressed in different formats for each dictionary memory in a common dictionary number storage area, the 8-bit dictionary number of the conversion candidate buffer 6-2 is stored in the conversion candidate buffer 6-2. In order to match the 6-bit dictionary number of -1, 0'' is added to the lower 2 bits of the 6 bits of the conversion candidate puff 716-1 to make it 8 bits, and the 8-bit dictionary number storage area of the learning buffer 17 is stored. It is configured so that both can be memorized.

Here, the operation of changing the arrangement of the contents of the conversion candidate buffers 7-1, 7-2 to the conversion candidates used most recently will be described.

First, when a kana character is input, the conversion candidates are dictionary memo 1.
15-1.5-2 and stored in the conversion candidate buffer 6-1.6-2, respectively.

Next, in order to check whether there are any words that have been used before among the conversion candidates, the 1 learning buffer 77 is checked to see if there is a corresponding dictionary number. If the corresponding word exists in the learning buffer 7, the order of the conversion candidates is changed according to the order of use. That is, (a) according to the usage order of the learning buffer 77 shown in (b).

The contents of the conversion candidate buffers 76-1 and 6-2 shown in (d) are rearranged in the appearance frequency ranking areas as shown in (c) and fe), respectively. After this replacement operation is completed, the items are displayed on the display according to the rankings in the appearance frequency ranking area (i) shown in (c) and (e).

In order to make the above content more concrete, the flow will be explained using the flow shown in FIG. 3. The operator first inputs kana characters to be converted into kana-kanji (Sl). The input kana characters are temporarily held in a kana data buffer (not shown) in the text memory 3 (S2).

When converting the input kana characters into kanji or a sentence mixed with kanji, a conversion instruction command is given to the CPU 2 (S3).

As a result, the CPU 2 first transfers the kana characters held in the kana data buffer 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 IJ 5-1 for homophones corresponding to the input kana characters. This search is performed by referring to the word corresponding to the conversion candidate stored in the dictionary memory 5-1 (S5). Then, sequentially read out the conversion candidates and convert the conversion candidate/<rough 16-
1, the fixed appearance frequency ranking, dictionary number, and conversion candidate code of each conversion candidate are stored, and the search is completed (S6), (S7), and (S8).

When the search for conversion candidates is completed, the conversion candidate buffer 76-1
Check whether the conversion candidates stored in the learning buffer 7 are stored in the learning buffer 7 (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 rewrite the ranking in the appearance frequency ranking area (i) according to this ranking (Sl
l).

When the candidate search process in the dictionary memory 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 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-2 (SMI). 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 puff 776-2, and the search is ended (314). , (S15), (S1
6).

When the search for conversion candidates is completed, the conversion candidate buffer 76-2
Check whether the conversion candidates stored in the learning buffer 77 are stored in the learning buffer 77 (in other words, whether they have been used before) (S17), (S18), and if so, what is their storage order? (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 (S19).

By performing the following operations, for example, the appearance frequency ranking area of the conversion candidate buffer 76-1. The ranking of is rewritten.

The candidate with the rank "1" is the kana-kanji converter 4-1.
Alternatively, it is read out via the I″i4-2 and the display control unit 8
(S2) is displayed on the CRT display device 9 via
0). The operator judges whether the displayed conversion candidates are the desired ones (521), and if so, issues a selection instruction from the keyboard device (S22). In response to this selection instruction, the CPU 2 stores the displayed selection candidates at a predetermined address in the text buffer 3 (523).
.

This means that the conversion candidate selection process has ended, but the learning buffer 77 is further made to learn the currently selected conversion candidate (S24).

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

This operation is repeated until a desired conversion candidate is called up, and when a desired conversion candidate is called up, a selection instruction is given from the keyboard device 1 (S22).

Here, the operation of causing the learning buffer 77 to learn the currently selected conversion candidate will be described in more detail.

First, a search is made to see if the headword for the currently selected conversion candidate exists in the table in the learning buffer 77. If this table does not exist, a table is created in the learning buffer 7, and the currently selected conversion candidate is included in that table. The identification code of the dictionary in which the dictionary is stored and the dictionary number are stored.

Also, if there is already a table in the study buffer 77,
This table is searched to see if the dictionary number of the conversion candidate selected this time is stored, and if it is not stored,
The dictionary identification code and the dictionary number are stored at the highest address of this table as the data used at the closest point in time, and the already stored data is sequentially shifted down to the lower addresses.

Furthermore, if the currently selected conversion candidate is already stored in the table, this conversion candidate is stored again at the highest address and the original data is deleted. Then, the data located above the address where the original data was stored is sequentially moved down 7 feet to the lower address.

'' - The above-described operation of causing the learning buffer 7 to learn is performed every time a conversion candidate is selected, and the learning buffer 7 stores the sequentially selected conversion candidates for learning.

<Effects of the Invention> As described above, the word processor of the present invention includes a plurality of kana-kanji conversion dictionaries that store in advance conversion candidates that are kanji corresponding to kana character strings or character strings mixed with kana-kanji, and a plurality of kana Registers conversion candidates for kana character strings that are commonly provided and learned for kanji conversion dictionaries, along with priorities assigned in the order of most recent use and the type of kana-kanji conversion dictionary used. Since it is equipped with a learning buffer, it is possible to study across all kana-kanji conversion dictionaries, so the latest candidates for all dictionaries can be displayed preferentially.

[Brief explanation of drawings]

FIG. 1 is a diagram showing the configuration of a word processor according to the present invention, FIG. 2 is a diagram showing the internal configuration of the conversion candidate buffer and learning buffer of the word processor, and FIG. 3 is a diagram showing the operation of the word processor during kana-kanji conversion. FIG. 4 is a diagram showing the configuration of a conventional word processor, and FIG. 5 is a diagram showing the internal configuration of a conversion candidate buffer and a learning buffer of the conventional word processor. 4-1.4-2: Kana-kanji conversion device, 5-1゜5-2:
Dictionary memory device 7: Learning buffer. Agent Patent Attorney Takeshi Sugiyama (and 1 other person) No. 1vA Fig. 4

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 or a character string containing kana-kanji, A plurality of kana-kanji conversion dictionaries in which certain conversion candidates are stored in advance, and conversion candidates for kana character strings that are commonly provided and learned for the plurality of kana-kanji conversion dictionaries, and which are used at the closest point in time. By providing a learning buffer that is registered together with sequential priorities and the type of kana-kanji conversion dictionary used, it is possible to prioritize frequently used conversion candidates across the plurality of kana-kanji conversion dictionaries. A word processor characterized in that priorities can be changed for display.