JPS6246029B2 - - Google Patents

Description

[Detailed Description of the Invention] <Technical Field> The present invention relates to a kana-kanji conversion device, and particularly to a kana-kanji conversion device having a function of converting shortened kana characters or kana sentences into corresponding kanji or sentences mixed with kanji in response to an input of kana characters. Regarding a kana-kanji conversion device.

<Prior Art> Recently, Japanese document processing devices (Japanese word processors) have been put into practical use for the purpose of improving document processing efficiency. This Japanese document processing device inputs a kana sentence using an input device such as a kana keyboard, searches a kana-kanji conversion dictionary, and outputs the corresponding kanji or a sentence mixed with kanji. In such a device, when creating a document, 1.
The same kanji or sentences containing kanji may appear many times in one sentence.

Previously, it was necessary to input a kana sentence each time, regardless of whether the same kanji existed or not, so even if you input the same kanji several times, you had to input the number of kana characters for that sound. However, there was a problem that the operation was complicated. One way to solve these problems is for the operator to register frequently occurring characters or sentences in advance with specific keywords, and then input only the specific keyword each time that character or sentence appears. In some cases, methods of registering the characters or sentences have been considered. However, even with this method, it is necessary to predict in advance the characters or sentences that will appear frequently and register them, and it is necessary for the operator to remember the registered sentences for the keywords. For this reason, conventional kana-kanji conversion devices either require the operator to perform complicated operations, or the operator registers characters or sentences with specific keywords and then memorizes them to convert only the keywords. Since input is required, the operation becomes complicated and there is a problem that prompt input cannot be performed. Furthermore, since the operator has to remember the characters or sentences registered with a specific keyword, if the keyword is entered incorrectly, characters or sentences with completely different meanings will be registered, which may cause input errors. Become. Therefore, the number of characters or sentences that can be registered using keywords is limited to the range that the operator can memorize, and the number must necessarily be small.

<Purpose> Therefore, an object of the present invention is to provide a kana-kanji conversion device that facilitates operator operation, allows quick registration, and improves operability.

<Summary> In summary, when a certain kanji or a sentence mixed with kanji is input as a reading kana, the kanji or a sentence mixed with kanji corresponding to the reading kana is automatically generated using a certain number of characters shortened from the reading kana. Please register accordingly. When a kanji or kanji-mixed pronunciation is entered, the system searches to see if the same abbreviated kana sentence as the previous one is registered, and responds to it from the same abbreviated kana sentence. This system reads out kanji or sentences containing kanji and registers them.

Hereinafter, specific embodiments of the present invention will be described with reference to the drawings.

<Embodiment> FIG. 1 is a block diagram of a kana-kanji conversion device according to an embodiment of the present invention. In structure, the kana-kanji conversion device of this embodiment includes a kana keyboard 1, which is an example of a kana character input means.The kana keyboard 1 has kana keys arranged in the order of the 50 syllabary. Key signals input by operating the kana keyboard 1 are given to the encoding circuit 3. Key signals from the function keyboard 2 are further input to the encoding circuit 3 . This function keyboard 2 includes editing control keys. The editing control keys include a conversion key for instructing conversion of kana characters into kanji or a sentence mixed with kanji, a no-conversion key for instructing that there is no need to convert kanji, and a previous candidate key. The encoding circuit 3 encodes the key signals of the kana keyboard 1 and the function keyboard 2, and converts them into kana character data (kana character code).
is temporarily stored in an input buffer 4, and the coded signals of each key included in the function keyboard 2 are directly provided to a central processing unit (hereinafter referred to as CUP) 5. The CPU 5 functions as an arithmetic processing means by executing an operation program shown in FIG. 2, which will be described later, and includes a kana-kanji conversion function, a writing function, and a reading function. CPU5 has
A CRT display 6 and a printing device (printer) 7 are connected. CRT display 6 is
It is used to display kana sentences inputted in kana, and converted kanji or sentences mixed with kanji (hereinafter collectively referred to as sentences mixed with kanji). The printer 7 is used to print sentences mixed with kana or kanji.

Furthermore, the CPU 5 includes a kana-kanji conversion processing unit 8.
A document buffer 11 and a kana-kanji conversion dictionary section 12, which is an example of a first storage means, are connected. A shortening memory 13, which is an example of a second storage means, is connected to the kana-kanji conversion processing section 8.

Next, to explain these configurations in more detail, the kana-kanji conversion processing section 8 works as a kana-kanji conversion means in cooperation with the CPU 5, and includes an output buffer 8a, abbreviated data setting buffer 8b, and a register. Including area 8c. Output buffer 8a
is for storing data to be output, and
For example, data such as kana sentences, kanji, or kanji-mixed sentences displayed on one screen (one frame) of the CRT display 6 is stored. The abbreviated data setting buffer 8b allows abbreviated kana characters (hereinafter referred to as headwords) to be newly registered in the abbreviated memory 13, which will be described later.
and shortened kana-kanji conversion data (hereinafter referred to as conversion data) for converting it into a sentence mixed with kanji. The register area 8c includes a plurality of storage areas (registers) corresponding to each of the 50 sounds, and each register is used to store the number of converted data having the same sound headword (for example, one character in kana). It will be done. In addition, the kana-kanji conversion processing unit 8
In addition to this, it includes a plurality of buffer areas for kana-kanji conversion, but since they are not directly related to the present invention, their explanation will be omitted.

The document buffer 11 stores, as document data, a sentence mixed with kanji that is input in kana and converted by the kana-kanji conversion processing unit 8.

The kana-kanji conversion dictionary section 12 includes, for example, a read-only memory (ROM), and includes a storage area for storing a word dictionary, a storage area for storing a conjugation ending list,
It also includes a storage area for storing adjunct word tables.
This word dictionary storage area stores kana headers arranged in alphabetical order, kanji notation parts corresponding to the kana headers, part-of-speech data, and the like. In the kanji notation section,
Word stems and portions that do not change (hereinafter collectively referred to as word stems) are stored.

The shortened memory 13 includes multiple storage areas.
RAM etc. are used. In the shortened memory 13,
Conversion unit of input sentence (for example, phrase unit)
The converted kanji-mixed sentences are memorized using the first character of the reading kana (i.e., the kana input sentence) as a headword, and the frequency of use of the sentence (how many times the same clause-based kanji-mixed sentences, etc. are used in the sentence) is stored. (number of times representing the number of times) data is also stored. In other words, the shortened memory includes an area for storing a plurality of headwords, an area for storing kanji-mixed sentences corresponding to the headword corresponding to a storage area for each headword, and a storage area for storing the usage frequency of each kanji-mixed sentence. Contains an area for storing.

Next, the kana-kanji conversion process performed by the kana-kanji conversion processing section 8 will be briefly explained. The input kana sentence is searched in the word dictionary in order from the top of the kana characters, and part-of-speech data for the word stems searched in the word dictionary are read out. Based on this part-of-speech data, the conjugated word table and adjunct word table are searched, and sentences containing kanji that match the kana sentence are read out and stored in the output buffer 8a.

FIG. 2 is a flowchart for explaining the specific operation of the kana-kanji conversion device according to one embodiment of the present invention. Next, the specific operation of this embodiment will be explained with reference to FIGS. 1 and 2.

The CPU 5 determines in step 1 whether or not a kana character has been input. If the operator does not operate the kana keyboard 1 and does not operate the conversion key and non-conversion key included in the function keyboard 2, it is determined that no kana characters are being input in step 1, and step 1 is executed. In step 2, it is determined that the key is not a conversion key, in step 3, it is determined that it is not a non-conversion key, and in step 4, other processing is performed.

On the other hand, when the operator inputs a certain sentence through kana-kanji conversion, the operator operates the kana keyboard 1 to input a kana sentence for each clause. At this time, each time a kana character is input, it is determined in step 1 and the process proceeds to step 5. In step 5, the input kana characters are encoded by the encoding circuit 3 and stored in the input buffer 4. The operations of steps 1 and 5 are repeated each time a kana character is input. Therefore, the input buffer 4 stores a kana sentence of one clause. When the operator inputs a phrase, he presses a conversion key or a non-conversion key included in the function keyboard 2, depending on whether or not the kana sentence of the phrase needs to be converted into kanji.

Now, assuming that the conversion key is pressed,
This is determined in step 2 and the process proceeds to step 6. In step 6, the input buffer 4
It is determined whether the number of input characters stored in is a certain number (for example, one character) determined as abbreviated kana characters. If the kana sentence of one clause input this time is not the same as the one input previously, it cannot be abbreviated and input, so one or more characters should be input. Therefore, if it is determined that the number of kana characters is one or more, the process proceeds to step 7. In step 7, the word dictionary is searched in order from the top of the kana sentences of one clause stored in the input buffer 4, and sentences with the same reading kana mixed with kanji are read out. In step 8, the address value in the word dictionary corresponding to the read kanji-mixed sentence (word stem) is temporarily stored in an internal buffer (not shown) included in the kana-kanji conversion processing section 8. In step 9, the read sentence containing kanji (word base, conjugated ending, adjunct word) is stored in the output buffer 8a. The characters stored in the output buffer 8a are
Displayed on CRT display 6.

Next, the operator displays the CRT display 6.
It is determined whether the kanji-mixed sentence displayed in is the desired font, and if it is a different font, so-called a homophone, the conversion key is pressed again to command the reading of the next candidate kanji-mixed sentence. In response to this, it is determined that the key input in step 10 is a conversion key, and the process returns to step 7. As a result, the operations of steps 7 to 9 are repeated, and the next candidate sentence containing kanji is read out, stored in the output buffer 8a, and displayed on the CRT display 6.

When the desired kanji-mixed sentence is read out, the operator presses a key other than the conversion key (for example, a kana character key operated to input the next kana sentence). In response to this, it is determined in step 10 that a key other than the conversion key has been operated, and
Proceed to step 11. In step 11, the contents of the output buffer 8a are transferred to the document memory 11 and written into the storage area immediately following the text input so far. In step 12, the contents of the output buffer 8a are changed to the shortened data setting buffer 8b.
The shortened data (ie, the headword and the conversion data corresponding to the headword) is created.

Here, the shortened data creation process (step 1)
2) will be explained in detail. The shortened data setting buffer 8b has areas b1 to b4 as shown in FIG.
including. A delimiter code is written in area b1. Area b2 has frequency data (0 at the beginning)
is written. In area b3, input buffer 4
The first character of the kana sentence stored in is written as a headword.Furthermore, in area b4, each character code of the word base corresponding to the headword read from the word dictionary (or the word stored in the dictionary) is written. address data of executives) is written. In this case, the reason why only the word base is stored as shortened data is that since it changes depending on the conjugation, correction is required each time, and it is better to register only words that do not change.

Next, in step 13, 1 is added to the value of the register that has the same sound as the currently input headword contained in the register area 8c, and the number of shortened data to be converted into a sentence containing kanji corresponding to the headword is determined. Only 1 is added. As a result, the shortened memory 1
The number of abbreviated data of all the sounds stored in 3 is stored in the register for each entry word corresponding to each sound included in the register area 8c. Subsequently, in step 14, register area 8c
It is determined whether the number of abbreviated data stored in the register corresponding to the currently input sound among the registers included in the sound has reached a predetermined number (n).
If it is determined that the number is less than the predetermined number, the process advances to step 15. In step 15, it is determined whether or not the shortening memory 13 has any remaining storage capacity. When it is determined that the shortening memory 13 has a remaining storage capacity (that is, it is not full), the process advances to step 16. In step 16, the stored contents of the shortening memory 13 are shifted one by one to lower addresses, and the shortened data stored in the shortened data setting buffer 8b is written to the first address. After that, return to step 1.

In this way, when a phrase that has never been input before is input, the abbreviated data for that phrase is written into the abbreviation memory 13 using the first character of the phrase as a headword. The above operations are performed every time a new phrase is input.

Before writing the abbreviation data to the abbreviation memory 13, it is checked whether or not there is an identical phrase within the headword with the same sound. If a phrase that has already been written is input, this phrase cannot be written again. No, only the frequency data is set to +1.

Further, the operation when the number of abbreviated data of homophone entry words reaches a predetermined number (n) in step 14 will be explained. When the number of abbreviated data of homophone entry words reaches a predetermined number, it is determined in step 14 and the process proceeds to step 17. In step 17, the abbreviation memory 13 is searched to read out abbreviated data that is least frequently used among the same-sounding headwords. In step 18, it is determined whether there is a plurality of read shortened data, and if it is determined that they are not complex (that is, they are singular), the process advances to step 19. In step 19, this shortened data is deleted. Then, in step 21, the contents of the register storing the number of homophone headwords are subtracted by 1. In step 22, the contents of the compaction memory 13 are sequentially shifted to fill in the deleted areas.
After that, the process returns to step 15.

If it is determined in step 18 that there is a plurality of abbreviated data for the least frequently used homophone headword, the process proceeds to step 20. In step 20, among the selected abbreviated data of a plurality of infrequently used homophones, the oldest one registered in the abbreviation memory 13, in other words, the abbreviated data stored at the largest address is deleted. After that, proceed to step 21. This is based on the empirical rule that sentences containing the same kanji characters often appear in relatively close sentences.

To summarize the above operation description, this embodiment has the following features. That is, the number of abbreviated data of homophone headwords registered in the abbreviation memory 13 is limited to a predetermined number (n) or less. If the number of shortened data items for headwords with the same sound exceeds a predetermined number, the least frequently used shortened data item is deleted. Furthermore, if there are a plurality of abbreviated data for the same sound headword that is used less frequently, the oldest registered one (that is, the one stored at the lowest address) is deleted. Furthermore, even if the number of homophone entry words is less than a predetermined number, the shortening memory 1
When the storage capacity of 3 becomes full, similar processing is performed.

Next, using the registered data in the shortening memory 13, write a kana (for example, one character) corresponding to the headword.
We will explain the operation when inputting , and converting kana to kanji using abbreviated input.

The operator operates the kana keyboard 1 to
After entering one character of kana, press the conversion key. The operations in this case are similar to those in steps 1, 5 and 2 described above. And step 6
If it is determined that the number of kana characters stored in the input buffer 4 is one character, the process proceeds to step 23. In step 23, using the one-character kana input this time as a headword, the abbreviation data stored in the abbreviation memory 13 with the same sound is searched and all are read out. In step 24, it is determined whether there is a plurality of shortened data items that have just been read out. If a plurality of abbreviated data with the same sound are registered, in step 25, the abbreviated data stored in the upper address of the abbreviation memory 13 is selected. In other words, the abbreviated data of the most recently input kana that is the same as the headword of the currently input kana character is selected. Thereafter, the process proceeds to step 26. On the other hand, in step 24,
If it is determined that the shortened data is singular, the process directly proceeds to step 26. In step 26,
Kanji-mixed sentences (converted sentences) of the selected shortened data
The code data is transferred to the output buffer 8b and displayed on the CRT display 6.

Then, the operator checks the displayed sentence mixed with kanji and confirms that it is the desired sentence mixed with kanji, and then operates a key other than the conversion key and the previous candidate key, for example, the next kana character input key. In response, it is determined in step 27 that the key is not a conversion key, and in step 28 it is determined that it is not a previous candidate key, and the process advances to step 29. In step 29, 1 is added to the value of the usage frequency storage area corresponding to the shortened data read out from the shortened memory 13 this time. Then, in step 30, data such as a sentence mixed with kanji characters converted by the shortening process stored in the output buffer 8b is transferred to the document memory 11 and written therein.

On the other hand, in step 26, the output buffer 8a
When the content of is displayed on the CRT display 6, when the operator confirms that it is not the desired sentence mixed with kanji, he presses the conversion key again. In response, it is determined in step 27 that the conversion key has been operated, and the process returns to step 24. Then, the operations of steps 24 to 27 are repeated,
The abbreviated data that has the same homophone entry word and is stored at the next higher address after the abbreviated data read in step 24 is selected, and the sentence containing kanji corresponding to the abbreviated data is written to the output buffer 8a. be included. The process is repeated until the operator confirms that the desired kanji-mixed sentence is obtained and presses a key other than the conversion key or the previous candidate key.

By the way, depending on how the kana-kanji conversion device is used, it may be possible to perform normal conversion of one character. In that case, a key that means general conversion, called a previous candidate key, is operated. If the previous candidate key is operated, it is determined in step 28, and the process returns to step 7, where the above-mentioned normal conversion (conversion by processing other than shortening conversion) is performed.

Note that if the no-conversion key is operated, there is no need to convert the input kana sentence into a sentence mixed with kanji, so this is determined in step 3 and the process proceeds to step 31. In step 31, the contents of the input buffer 4 are directly transferred to the output buffer 8a, and then the process proceeds to step 11.

<Effects> As described above, according to the present invention, a certain number of characters (for example, one character) from the beginning of a kana sentence input as kana are used as headwords when converting into normal kanji or a sentence containing kanji. The system automatically registers kanji-mixed sentences (word stems), and when a headword is entered as a kana sentence with a predetermined number of characters, the corresponding kanji-mixed sentence is read out, making it easier to input kana characters. It has unique effects such as being able to simplify, quickly input, and greatly improve operability.

In addition, compared to a method in which the operator memorizes keywords and registers the converted kanji-mixed sentences corresponding to the keywords, input errors due to operator misunderstandings can be prevented, and input can be automatically performed. It also has the effect of greatly increasing the number of sentences containing kanji that can be shortened and converted.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a kana-kanji conversion device according to an embodiment of the present invention. FIG. 2 is a flowchart for explaining the operation of the present invention. FIG. 3 is a diagram schematically showing the storage area of the shortened data setting buffer 8b for explaining the operation of the present invention. In the figure, 1 is a kana keyboard, 2 is a function keyboard, 3 is an encoding circuit, 4 is an input buffer, 5 is a CPU, 6 is a CRT display,
7 is a printer, 8 is a kana-kanji conversion processing unit, 11 is a document buffer, 12 is a kana-kanji conversion dictionary unit, 13
indicates shortened memory.

Claims (1)

[Scope of Claims] 1. A first storage means for storing kana character input means for inputting kana characters and kana-kanji conversion data for converting kana characters or kana character strings into kanji or sentences mixed with kanji. and stores the entry word of the kana character that is shortened to a certain number from the beginning of the input kana character string, and the shortened kana-kanji conversion data for converting the shortened kana character into a corresponding kanji or a sentence containing kanji. a second storage means; converting a kana character or a kana character string input by operating the kana character input means into a kanji or a kanji-mixed character based on the kana-kanji conversion data stored in the first storage means; A kana-kanji conversion means for converting into a conversion candidate consisting of a sentence, and for all kana characters or kana character strings converted by the first storage means, when this conversion candidate is determined, the inputted character corresponding to the conversion candidate is Regarding kana character strings, headwords consisting of kana characters or kana character strings shortened to a certain number from the beginning,
automatic writing means for automatically writing and registering a kanji or a sentence mixed with kanji that has been converted into kana-kanji into the second storage means; As a headword, the second
1. A kana-kanji conversion device comprising: reading means for searching each storage area of the storage means and reading out a corresponding kanji or a sentence mixed with kanji. 2. The certain number of characters of the abbreviated kana characters is determined to be a constant number, and the reading means is configured to read the second kana characters in response to inputting a certain number of kana characters by operating the kana character input means. The kana-kanji conversion device according to claim 1, further comprising means for searching for abbreviated kana characters stored in the storage means. 3. The kanji or kanji-mixed sentences corresponding to the abbreviated kana characters registered in the second storage means are:
The kana-kanji conversion device according to claim 1, which comprises word stems and unchanged parts. 4. The readout means reads the most recently used second storage means when the second storage means stores the same sound as the abbreviated kana character input by operating the kana character input means. The kana-kanji conversion device according to claim 1, further comprising means for reading out corresponding kanji or kanji-mixed sentences registered in . 5. When the number of abbreviated kana characters registered in the second storage means exceeds a predetermined number, the automatic writing means writes the least frequently used abbreviated kana characters in the second storage means. The kana-kanji conversion device according to claim 1, further comprising means for deleting the registration of the converted kanji or the corresponding kanji-mixed sentence. 6. When the number of abbreviated kana characters registered in the second storage means exceeds a predetermined number, the automatic writing means writes the least frequently used and the most frequently used abbreviated kana characters in the second storage means. 2. The kana-kanji conversion device according to claim 1, further comprising means for deleting registration of previously registered abbreviated kana characters and corresponding converted kanji or sentences mixed with kanji.