JPS59100941A - Kana (japanese syllabary)-kanji (chinese character) converter - Google Patents

Abstract

PURPOSE:To facilitate the operation of an operator by registering KANJI corresponding to the relevant KANA or a sentence containing KANJI in a certain number of characters obtained by abbreviated reading KANA when a certain KANJI or a sentence containing KANJI is supplied. CONSTITUTION:A KANA character is stored in an input buffer 4 as a block with operations of a keyboard 1, and it is decided whether the number of input characters is coincident with a fixed number decided as abbreviated KANA characters or not. When the number of input characters is larger than the fixed value, a word dictionary is retrieved to read out a sentence including KANJI, etc. This sentence is stored in an output buffer 8a to be displayed at a CRT6 and at the same time stored in a document buffer 11 with push of keys excepting a conversion key. While the sentence is transferred to an abbreviated data setting buffer 8a to produce an abbreviated data. Then an abbreviation memory 13 is retrieved to check whether the using frequency of phomophonous key words is plural or not. Then the abbreviated data is deleted or registered to the memory 13.

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 that has a function of converting shortened kana characters or kana sentences into corresponding kanji or kanji-mixed sentences in response to input. This invention relates to a conversion device.

2. Description of the Related 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, a large number of Shuichi's kanji or sentences containing kanji may appear in one sentence.

Previously, it was necessary to enter a kana sentence each time, regardless of whether the same kanji existed or not, so even if you entered the same kanji several times, you had to enter 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 to register frequently occurring characters or sentences in advance with specific keywords, and then input only the specific keyword each time the character or sentence appears. Therefore, 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 also necessary for the operator to remember the registered sentences for the keywords. For this reason, conventionally known kana-kanji conversion devices require the operator to perform complex operations, or the operator registers characters or sentences with specific keywords and remembers them. Since it is necessary to input the information, there is a problem that the operation becomes complicated and 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 a keyword is limited to the range that the operator can memorize, and the number must necessarily be small.

OBJECTIVES 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 kanji or a kanji-mixed sentence is input as a reading kana, a kanji or a kanji-mixed sentence corresponding to the kanji or kanji-mixed sentence is automatically registered using the shortened number of characters of the reading kana. I'll keep it. 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.

A specific embodiment of the present invention will be described below with reference to the drawings.

Embodiment FIG. 1 is a block diagram of a kana-kanji conversion apparatus according to an embodiment of the present invention. In the configuration, the kana-kanji conversion device of this embodiment has a kana keyboard 1 which is an example of a kana character input means.
In this kana keyboard 1, the kana keys are arranged in alphabetical order. Key signals input by operating the kana keyboard 1 are supplied to the encoding circuit 3. Key signals from the function keyboard 2 are further input to the encoding circuit 3 . This function keyboard 2
contains edit control keys. The editing control keys include a conversion key for instructing conversion of kana characters into kanji-mixed sentences, a no-conversion key for instructing that no kanji conversion is necessary, and a previous candidate key. The encoding circuit 3 includes a kana keyboard 1 and a function keyboard 2.
encodes the key signals, temporarily stores the kana character data (kana character code) in the input buffer 4, and directly provides the encoded signals of each key included in the function keyboard 2 to the central processing unit N (hereinafter referred to as CPU) 5. . C.P.
The LI5 functions as an arithmetic processing means by executing an operation program shown in FIG. 2, which will be described later.
Includes kana-kanji conversion function, writing function and reading function. C
A CRT display 6 and a printing device (printer) 7 are connected to the PU 5. The CRT display 6 is used to display human-generated kana sentences, and converted kanji or kanji-mixed sentences (hereinafter collectively referred to as kanji-mixed sentences, etc.). The printer 7 is used to print sentences mixed with kana or kanji.

Furthermore, the CPU 5 is connected to a kana-kanji conversion processing unit 8, a document buffer 11, and a kana-kanji conversion dictionary unit 12, which is an example of a first storage means. 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.

The output buffer 8a stores data to be output, and for example, one screen (one screen) of the CRT display 6.
This stores data such as kana sentences, kanji, or sentences with kanji mixed in, which are displayed in frames). The abbreviated data setting buffer 8b stores abbreviated kana characters for newly registering as abbreviated data, kanji conversion data for converting them into kanji-mixed sentences, etc. The register area 8C includes a plurality of storage areas (registers) corresponding to each of the 50 sounds, and each register stores the entry word () of the shortened data with the same sound.
For example, it is used to memorize the number of homophones for a single character in kana.

The kana-kanji conversion processing unit 8 also 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 has been manually written into kana characters and converted by the kana-kanji conversion processing unit 8.

The kana-kanji conversion dictionary section 12 has, for example, a read-only memory (
ROM), etc., and a storage area that stores word dictionaries;
Storage area that stores the usage Wakuo table.

It also includes a gl area for storing an adjunct word table.

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. The kanji notation section stores word stems and portions that do not change (hereinafter collectively referred to as word stems).

The shortening memory 13 is a RAM containing multiple storage areas, etc. 131 shortening files 1 Conversion unit of manually written sentences (for example, a sentence mixed with kanji converted in segment units, etc.) The first character of the reading kana (that is, the kana input sentence) is memorized as a kana header edict, and if necessary, the frequency of use of that sentence (the number of times the same segment unit of kanji-mixed sentences, etc. is used in the sentence) Data is stored.

That is, the shortened memory includes an area for storing a plurality of shortened kana sentences, and an area for storing kanji-mixed sentences corresponding to the shortened kana sentences corresponding to the storage area for each shortened kana sentence. Contains an area to store usage frequency.

Next, the kana-kanji conversion processing performed by the kana-kanji conversion processing section 8 will be briefly explained. The input kana sentence is searched in the single entry dictionary in order from the top of the kana characters, and the part-of-speech data for the word stem searched in the word dictionary is read out. Based on this part-of-speech data, the inflection idiom and adjunct table are searched, and sentences containing kanji and the like 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 in step 1 that the input is not a kana character, and in step 2 It is determined that it is not a conversion key, it is determined in step 3 that it is not a non-conversion key, and other processing is performed in step 4.

On the other hand, when the operator inputs a sentence formed by converting kana to kanji, the operator operates the kana keyboard 1 to input a kana sentence for each segment. At this time, each time a kana character is input, it is determined in step 1 and
Proceed 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 then repeated each time a kana character is input. Therefore, the input buffer 4 stores one segment of the kana sentence. When the operator inputs one segment, the operator 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 segment needs to be converted into kanji.

Assuming that the conversion key is pressed now, it is determined at step 2 d3 and the process proceeds to step 6. In step 6, it is determined whether the number of input characters stored in the input buffer 4 is a certain number (for example, one character) determined as abbreviated kana characters. If the one-segment kana sentence input this time is not the same as the one previously input, one or more characters should be input because it cannot be abbreviated. 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 one-segment kana sentences 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. Sentences mixed with kanji, etc. (word bases) read out in Suab 9.

(conjugated endings, attached words) are stored in the output buffer 8a.

The characters stored in the output buffer 8a are displayed on the CRT display 6.

Next, the operator determines whether the kanji characters displayed on the CRT display 6 are the desired font, and if they are different fonts, so-called homophones, press the conversion key again to select the next candidate. Commands to write sentences with kanji mixed in one after another. In response to this, it is determined that the key manually pressed 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 sentences are output one after another, 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, it is determined in step 10 that a key other than the "C conversion key" has been operated, and the process proceeds to step 11. In step 11, the contents of the output buffer 8a are transferred to the document memory 1.
1 and written to the storage area immediately after the sentences input so far. In step 12, the contents of the output buffer 8a are transferred to the abbreviated data setting buffer 8b, and a process of creating abbreviated data is performed.

Here, details of the shortened data creation process will be explained. The shortened data setting buffer 8b includes areas b1 to b4, as shown in FIG. A delimiter code is written in area 1b. Area b2 has frequency data (O at the beginning)
is written. In area b3, the first character of the kana sentence stored in input buffer 4 is written as a headword.

Roughly speaking, in area b4, each character code of the word root corresponding to the headword read from the word dictionary (or 29♀ address data stored in the dictionary may be used) is written. In this case, the reason why only the part 1j' 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 the one-day phrases that do not change.

Subsequently, in step ``i3, 1 is added to the value of the register that has the same sound as the headword edict input this time, which is included in the register area 8C, and the number of headwords is added by '1.As a result, the shortened memory The number of headwords for all the sounds stored in 13 is stored in the register corresponding to each sound included in the register area 18G.Next, in step 14, the number of headwords for each sound included in the register area 8C is stored in the register corresponding to each sound included in the register area 8C. It is determined whether the number of headwords stored in the register corresponding to the currently input sound has reached a predetermined number (n). If it is determined that the number is less than or equal to the predetermined number, Proceed to step 15. In step 15,
It is determined whether the storage capacity of the shortening memory 13 remains. When it is determined that there is a remaining storage capacity of the shortened memory 12 (that is, it is not full), step 16
Proceed to. In step 16, the contents of the shortening memory 12 are shifted one by one to lower addresses, and the data stored in the shortening data setting buffer 8b is written to the first address. After that, return to step 1.

In this way, when a segment that has never been input before is input, the first character of the segment is used as the headword and the abbreviated data for that segment (i.e., the headword and the headword are converted into a sentence with kanji mixed in, etc.). (converted data) will be written to the shortening memory 13. The above operations are performed each time a new segment is input.

Next, the operation when the number of homophones reaches a predetermined number (n) will be explained. When the number of homophones reaches a predetermined number, it is determined in step 14 and the process proceeds to step 17. In step 17, homophone headwords in the shortening memory 13 are searched, and usage frequency data for each kanji-mixed sentence converted from the homophone headword to kanji is read out. Then, through the operations of steps 17 to 22, the least frequently used heading edict with the same sound is selected, and its erasure processing (deletion) is performed. In this specific process, for example, the shortening memory 1.3 is searched to read out the usage frequency of one homophone headword. In step 18, it is determined whether or not the frequency of use is plural. If it is determined that the usage frequency is not plural (that is, it is singular), the process proceeds to step 19.

In step 19, abbreviated data corresponding to homophonetic headwords with a singular usage frequency are deleted. In step 21, the contents of the register storing the number of homophone headwords are subtracted by one. In step 22, the contents of the shortening 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 are a plurality of least frequently used headwords with the same sound, the process proceeds to step 20. In step 20, among the selected homophones with low frequency of use, the oldest one registered in the shortening memory 13, in other words, the bag from which the shortened data stored at the largest address has been deleted. 21
Proceed to.

This is based on the empirical rule that sentences containing the kanji ``Koji'' often appear in sentences that are relatively close to each other.

To summarize the above operation description, this embodiment has the following features. That is, the number of homophones in the shortened data registered in the shortened memory 13 is limited to a predetermined number (n) or less. If the number of homophones in the shortened data exceeds a predetermined number, the least frequently used shortened data among the shortened homophones 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 headwords is less than a predetermined number,
When the storage capacity of the shortening memory 13 becomes full, similar processing is performed.

Next, a description will be given of the operation when inputting a kana (for example, one character) corresponding to a headword using registered data in the abbreviation memory 13 and converting it into ``C'' from kana to kanji by human abbreviation.

The operator operates the kana keyboard 1 to input one character of the kana character, and then presses the conversion key.

The operations in this case are similar to those in steps 1.56 and 2 above. Then, in step 6, if it is determined that the number of kana characters stored in the input buffer 4 is one character, the process advances to step 23 by three. In step 23, the one-character kana input this time is used as the ``out'' to search for the same-sounding abbreviated data stored in the abbreviation memory 13, and the most frequently used abbreviated data is read out. In step 24, it is determined whether there is a plurality of shortened data items that have just been read out. If more than one abbreviated data with the same sound is registered, in step 25 the abbreviated data stored in the upper address of the abbreviation memory 13 is selected and read out. 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, if it is determined in step 24 that the abbreviated data is singular, the process directly proceeds to step 26. In step 26, the code data of the selected abbreviated data or the kanji-mixed sentence (converted sentence) of the abbreviated data corresponding to the one-character kana input this time is transferred to the output buffer gb, and is output by the CRT data C spray 6. Is displayed.

Then, the operator checks the displayed sentence with kanji mixed in, etc., and confirms that it is the desired kanji mixed sentence, etc.
A key other than the conversion key and the previous candidate key, for example, the next kana character entry key, is operated. In response, in step 27 it is determined that it is not the conversion key, in step 28 it is determined that it is not the previous candidate key,
Proceed 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. In step 30, data such as a sentence mixed with kanji that is converted by the shortening process and stored in the output buffer 18b is transferred to the document memory 11.
Transferred to and written to.

On the other hand, when the contents of the output buffer 8a are displayed on the CRT display 6 in step 26, if the operator confirms that it is not a desired sentence mixed with Chinese characters, he presses the conversion key again. In response, it is determined in step 27 that the conversion key has been operated, and step 2
Return to 3. Then, the operations of steps 23 to 27 are repeated, and another abbreviated data with the same homophone heading 'KB' stored in the lower address of the abbreviated memory 13 is selected. A sentence mixed with kanji, etc. is written to the output buffer %8a.The operation is repeated until the operator confirms that it is the desired sentence mixed with kanji and presses a key other than the conversion key or the previous candidate key.

By the way, depending on how you use the kana-kanji conversion device,
There may also be cases where a normal conversion of a single character is performed. In that case, a key called a previous candidate key, which means general conversion, is operated. If the previous candidate key is operated, step 28
This is determined in step 7, 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 to 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 transferred directly to the output buffer 8a, after which 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 manually inputted as a headword when converted into a normal kanji or a sentence containing kanji,
Converted kanji-mixed sentences, etc. (word stems) are automatically registered, and when a headword is entered in a kana sentence with a predetermined number of characters, the corresponding kanji-mixed sentences, etc. are read out.
It has the unique effects of simplifying the input operation of kana characters, allowing quick input, and greatly improving operability. .

In addition, the operator can memorize the keyword and register the converted kanji-mixed sentence corresponding to the keyword (compared to the input method, it is possible to prevent incorrect input due to misunderstanding by the operator, and the automatic It also has the effect of greatly increasing the number of sentences containing kanji that can be converted by reducing Vi.

[Brief explanation of drawings]

Figure Eg1 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 invention in detail. FIG. 3 is a diagram schematically showing the storage area of the shortened data setting buffer 8b for explaining the present invention in detail. In the figure, 1 is a kana keyboard, 2 is a function keyboard, 3 is an encoding circuit, 4 is an input buffer 1.5 is a CPU, 6 is a CRT display, 7 is a printer, 8 is a kana-kanji conversion processing unit, and 11 is a document buffer , 12 is a kana-kanji conversion dictionary section, 13 is a shortening memory 1゜

Claims (1)

[Scope of Claims] (1) Kana character input means for inputting kana characters; first storage means for storing kana-kanji conversion data for converting kana characters or kana sentences into kanji or sentences mixed with kanji; A plurality of storage areas for storing headings of abbreviated kana characters obtained by shortening the kana sentence to numbers consisting of the beginning, and data for converting the corresponding regular kana sentence from the abbreviated kana characters into kanji or kanji-mixed sentences. and arithmetic processing means, the arithmetic processing means converting the kana sentence inputted by the operation of the kana character inputting means into the kana-kanji conversion stored in the first storage means. a kana-kanji conversion means for converting kana-kanji based on the data; and a shortened kana character obtained by shortening the kana sentence to a number consisting of the first part as a headword, converting the shortened kana character and the converted kanji or a sentence mixed with kanji into the second one. a writing means for automatically writing and registering in a storage means; and when the abbreviated kana characters are input by operating the kana character input means, each of the second storage means stores the abbreviated kana characters as a heading edict; A kana-kanji conversion device comprising a reading means for searching an area and reading out a corresponding kanji or a sentence mixed with kanji. (2) The number of characters that the abbreviated kana characters consist of is determined to be a certain number, and the reading means is configured to read the second kana characters in response to a certain number of kana characters being input by operating the kana character input means. The kana-kanji conversion device according to claim 1, further comprising means for searching abbreviated kana characters stored in each storage area of the storage means. (3) The kana-kanji conversion device according to claim 1, wherein the kanji or kanji-mixed sentence corresponding to the abbreviated kana character registered in the second storage means includes a word stem and an unchanged part. . (4) The second storage means includes a frequency storage area for storing the usage frequency based on the input of the abbreviated kana character corresponding to the abbreviated kana character for each of the storage areas. The kana-kanji conversion device described. (5) When the same sound as the abbreviated kana character inputted by the operation of the kana character input means is registered in the second storage means, the successive reproducing means stores the frequency memory corresponding to the abbreviated kana character. 5. The kana-kanji conversion device according to claim 4, further comprising means for reading out the most frequently used words stored in the area with priority. (6) When a homophone of the abbreviated kana character inputted by the operation of the kana character input means is stored in the second storage means, the successive reproducing means selects a kanji or a kanji character corresponding to the abbreviated kana character. The kana-kanji conversion device according to claim 1, further comprising means for reading out the kanji which is a mixed sentence and has been most recently registered in the second storage means. (7) The writing means, when the number of abbreviated kana characters registered in the second storage means exceeds a predetermined number,
2. The kana-kanji conversion device according to claim 1, comprising means for deleting the registration of the least frequently used abbreviated kana characters and the corresponding converted kanji or kanji-mixed sentences. (8) The writing means, when the number of abbreviated kana characters registered in the second storage means exceeds a predetermined number,
2. The kana-kanji conversion device according to claim 1, comprising means for erasing the registration of the first-registered abbreviated kana character and the converted kanji or kanji-mixed sentences that follow the abbreviated kana character.