JPS63106863A - Japanese language word processor - Google Patents

Abstract

PURPOSE:To increase the input speed of a document data, by enabling a KANJI (Chinese character) part in a clause to be converted at time of conversion by every clause unit in composite clause conversion. CONSTITUTION:The character string of the Japanese language consisting of a KANA (Japanese syllabary) or a Roman character inputted through an input means 3 is separated to plural clauses by using a first dictionary memory means 1 by a first conversion means 4, and after that, it is converted to a KANA/ KANJI mixed text. When the KANA/KANJI mixed text converted by the first conversion means 4 is desired to be changed, a desired clause is selected by a selecting means 5, and after that, a single KANJI conversion is applied on the clause by using a second conversion means 6, thereby, it is converted to a correct KANJI-mixed text. The second conversion means 6 performs the single KANJI conversion by using a second dictionary memory means 2. Thus, since the single KANJI conversion can be used in parallel even in the composite clause conversion, it is possible to increase the input speed of the document data by the composite clause conversion.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a Japanese word processor, and more particularly to a Japanese word processor equipped with a compound phrase conversion function that converts multiple phrases into sentences mixed with kana and kanji at one time. .

[Summary of the invention]

The present invention enables a Japanese word processor equipped with a multi-phrase conversion function to convert only the kanji part within a clause when converting in a bunsetsu unit during multi-phrase conversion, thereby improving the input speed of document data. This is what I did.

[Traditional technique]

Japanese word processors are relatively easy to operate, anyone can learn how to use them quickly, and documents can be easily proofread, so they are widely used within companies to process internal documents. . Furthermore, recently, there have been many low-priced models for individuals, and their penetration rate is increasing year by year.

In Japanese word processors, Japanese input is performed through kana-kanji conversion. In the early days, kana-kanji conversion was limited to single kanji conversion and compound word conversion, but recently bunsetsu conversion and multi-bunsetsu conversion have become mainstream. Among these, compound phrase conversion is particularly useful when the user inputs multiple consecutive phrases at once by entering kana-kanji or romaji, and then operates the conversion key once, and the system automatically converts them into kana-kanji and mixed phrases. This conversion improves document input speed and makes operations easier.

For this reason, compound phrase conversion is a very convenient function for users.

(Problem to be solved by the invention) However, in the multi-clause conversion of conventional Japanese word processors, input character strings are processed in phrase units, and phrases that are not registered in the phrase data conversion dictionary are converted. I couldn't.

For this reason, if you enter a phrase that cannot be converted, the correct kana-kanji conversion will not be possible, and you will have to use the cancel key to cancel the input character string and input it again from the beginning using single kanji conversion, etc. did not become.

In this way, when converting multiple phrases using conventional Japanese word processors, if you input a phrase that is not registered in the dictionary for phrase data conversion, you have to input it again from the beginning, which increases the input operation time. There was a problem that it would take a long time.

SUMMARY OF THE INVENTION In view of the problems of the prior art, it is an object of the present invention to enable single kanji conversion to be used in conjunction with complex phrase conversion, and to improve the input speed of document data through compound phrase conversion.

[Means for solving problems]

FIG. 1 is a functional block diagram of the present invention.

1 is a first dictionary storage means that stores a dictionary for converting compound phrases; 2 is a second dictionary storage means that stores a dictionary for converting single kanji; and 3 is a kana character. or an input means for inputting a character string consisting of Roman characters; 4 separates the character string input from the input means 3 into a plurality of clauses using a first dictionary storage means, and converts each separated clause into kana-kanji; 5 is a selection means for selecting a clause to be converted into kana-kanji again from among the plurality of clauses separated by the first conversion means 4; 6 is a selection means This is a second conversion means that converts the phrase selected in step 5 into a kana-kanji mixed sentence using the second dictionary storage means 2.

[For production]

To explain the operation of the present invention, a Japanese character string consisting of kana characters or romaji is input via the input means 3. The character string inputted through the input means 3 is separated into a plurality of clauses by the first conversion means 4 using the first dictionary storage means 1, and then converted into kana-kanji mixed sentences. When it is desired to modify a kana-kanji combination sentence converted by the first conversion means 4, after selecting a desired phrase by the selection means 5, the second conversion means 6 is used to convert the phrase into a single kanji. You can do this and convert it into a correct kana-kanji kori-bun. The second conversion means 6 performs the single kanji conversion using the second dictionary storage means.

〔Example〕

(1) Configuration FIG. 2 is a system configuration diagram of a Japanese word processor according to an embodiment of the present invention.

The input unit 11 is a keyboard-type input device equipped with various keys such as character keys for inputting characters such as hiragana, katakana, and romaji, a conversion key, a next candidate key, a non-conversion key, a single kanji conversion key, and a cursor movement key. It is. When each key on the input section 11 is operated, the operation signal is output to the CPU 12. CPUI2 is a central processing unit (Central ProcessingU) that controls the entire system.
nit ), and when an operation signal of a character input using the character keys of the input unit 11 is input from the input unit 11 , it is converted into a character code and stored in the input buffer 13 . The CG pattern storage unit 14 is a character storage 6 device that stores matrix-configured bit patterns (so-called character generator patterns) corresponding to each character code.

Next, the display memory 15 is an image data storage device that stores image data in a dot pattern format to be displayed on a display section 17, which will be described later, and the CPU 12 writes the image data therein.

The driver 16 controls the display memory 1 under the control of the CPU 12.
This is a control driver for screen display that reads out the image data of No. 5 and displays it on the display unit 17.

The display section 17 is a cathode ray tube (Cathode Ray T).
It is a screen display device such as ``ube'', and displays kana characters, kanji, etc. based on image data input via the driver 16.

Next, the compound phrase conversion Japanese language dictionary 18 is stored in an external storage device such as a floppy disk, or a ROM (Read Only).
It is stored in the main storage device such as ``Memory'', and it is stored in the main memory such as ``Memory'' and ``heading reading'' and ``notation (kanji)'' of Japanese word by word.
, "grammatical information (part of speech, conjugation, semantic classification, etc.)" is stored. Single kanji sound dictionary ■9, stroke number dictionary 20,
Radical dictionary 21 has "onkun reading" for each kanji character.
, "number of strokes", and "radical" are stored in this dictionary. The single kanji onkun dictionary 19, the number of strokes dictionary 20, and the radical dictionary 21 are also stored in an external storage device such as a floppy disk or a storage device such as a ROM, similarly to the Japanese language dictionary 18 for converting compound clauses. The program area 22 is a main storage device R.
A M (Random Access Memory
y), in which the processing program for kana-kanji conversion is stored. Further, a temporary work area used during execution of the kana-kanji conversion process is also provided in this storage area.

Furthermore, the clause storage memory 23 is a storage device that stores the clause results that have been converted into multiple clauses by executing the above-mentioned kana-kanji conversion processing program.

Next, FIG. 3 shows the storage format of phrase data in the phrase storage memory 23 after the input character string is converted into compound phrases by the kana-kanji conversion program of this embodiment.

When the character string "Migiran ni Reckisuru" is input using the hiragana key of the input unit 11, an operation signal for each character of the character string is output from the input unit 11 to the cpU 12,
It is converted into a character code by the PU 12, and is stored as a character code in the cover sofa 13 as shown in the figure. (each character is shown in hiragana).

In the phrase storage memory 23, each phrase data is AD which is a pointer indicating the address of the first character of each phrase on the input cover sofa 13, YM which indicates the number of characters in the phrase, and CO1 which indicates the number of kanji candidates that can be converted into kana-kanji in the phrase. The kanji candidates are classified and stored as KJ consisting of kanji codes to be converted into JR1 kana-kanji, which indicate the reading length of the kanji candidates. K.J.
Consists of multiple kanji codes (16 bits),
The 16th bit of the last kanji code (M S B (M
ostSignificant Bit) ) is 1”
(on).

Turning on this MSB indicates the end of KJ.

To explain more specifically using the example in the same figure, the compound phrase data ``Migiran ni Rekkisuru'' is converted into three phrases ``Migi'', ``Rani'', and ``Rekkisuru'' by =8- compound phrase conversion. After being separated into phrases, each phrase is stored in the phrase storage memory 23. That is, the AD of "MIGI" stores the address of "MI" which is the first character of "MIGI" on the input buffer 13.

Also, since "Migi" is composed of two characters, the YM indicating the number of characters is a2".Next, "Migi"
Since the kanji that is a candidate for Kana-Kanji conversion is one of the ``right'' characters, the number of candidates CO is 1''.Furthermore, the number of candidates CO is 1'' because the reading of ``right'' is two characters, ``migi''. JR is 2
”.

Finally, the kanji code (KJ) for "right" is stored. Similarly, in the case of "Rani", the pointer AD indicates the address of "Ra" in the input buffer 13, and YM
= 3, C0 = 1, J 'R = 2, KJ = If the kanji code for "Ran" is "Rekkisuru", pointer AD indicates the address of "Re" in the input buffer 13, and YM
Kanji codes of =5, C〇-1, JR=3, KJ-“listed” are stored. Although only an example where C0=1 is shown here, for example, in the phrase "Rani", there are two kanji that are candidates for kana-kanji conversion: "ran-1", "column"
If there is, C0=2, (¥M=2, 'right'
] followed by (YM=2, "r") is stored.

(2) Operation The operation of the Japanese word processor configured as in 2 will be explained below with reference to the drawings.

First, with reference to FIG. 4(a) to tel, an explanation will be given of an operating method when creating a document by compound clause conversion using the Japanese word processor of this embodiment. The figure shows an operation method for inputting "listed in stone tools" by compound clause conversion. Furthermore, the shaded area indicates inverted display.

(1) First, use the hiragana keys to input ``Migiran ni Rekkiru'' and then operate the conversion key ((a) in the same figure).

(2) Then, the display section 17 will display “Migiran ni Kisu”.
is converted to "List in right lung" and displayed.

Then, the first phrase "right" is displayed in reverse video. Next, use the cursor movement keys to move the cursor 30 to the next phrase "
Moved to "Ran ni". "Ran" is incorrect here, so the next "Ran" is incorrect.
Press the conversion key to find conversion candidates for Ranni 1 (
Figure (b)).

(3) At this time, since there is no phrase candidate to be converted that corresponds to "Rani", the display of "Rani" again changes to the display of "Rani" in hiragana only. Here, press the single kanji conversion key to display the kanji with the reading ``ran'' (see figure (C)
)).

(4) Then, a list of kanji with the reading ``ran'' is displayed.

Here, since the kanji character "column" is the desired kanji character, the user presses the numeric key 0 (FIG. 4(d)).

(5) As a result, "Rani" is converted to 91 in the "column,"
The cursor 30 moves to "Enumerate the next phrase" ((3) in the same figure).

FIG. 5 shows a CPU based on the processing program for kana-kanji conversion of this embodiment to enable the above-mentioned compound clause conversion.
12 is a flowchart showing processing operations performed under control of No. 12. Based on the same figure, the operation of the complex phrase conversion process in one embodiment of Book 11 will be explained. It is assumed that before the processing of this flowchart, an input character string is input using the hiragana key, and the input character string is converted into a character code by the CPU 12 and stored in the input buffer 13.

After inputting a character string using the hiragana key, if you operate the conversion key, the input character string will be converted into multiple clauses in step S+, the input character string will be broken down into middle clauses, kana-kanji conversion will be performed, and the conversion result will be displayed. is stored in the clause storage memory 23 in units of clauses (see FIG. 3 above).

Then, based on the conversion result, image data in a dot pattern format corresponding to the character code of each converted character is read from the CG pattern storage section 14 and stored in the display memory 15. Then, the image data stored in the display memory 15 is displayed on the display unit 17 via the driver 16. As a result, the result of compound phrase conversion is displayed on the display section 17 (see FIG. 4(b)).

Next, the CPU 12 advances to step S2 and waits for input of key input from input 12-part 11. If a single kanji key is pressed here (step S3), step S
Proceeding to step 4, single kanji conversion is performed on the character string of the currently selected bunsetsu, and the resulting kanji group is stored in a temporary work area within the program area 22. Details of the single kanji conversion process will be described later. After the single kanji conversion is completed, the process proceeds to step S5, where a list of kanji characters that have become candidates through the unit kanji conversion are displayed on the display section 17 along with their corresponding numbers (see FIG. 4 fd)). If conversion to kanji is not possible, an error message such as ``conversion impossible 1'' will be displayed on the display section 17. Then, in step S6, the key input from the input section 11 will be displayed. It will be in a waiting state.

If the key is pressed manually, the numerical value "0" is determined based on the operation signal sent from the input unit 11 in step S7.
” to “9” is input.

If a value other than rOJ to "9" is input, the process returns to step S6 and waits for key input from the input unit 11 again. If any of the numerical values "0" to "9" is input in step S7, the process advances to step S8, and the kanji having the number corresponding to that numerical value is read out from the temporary work area in the program area 22, In step S9, the kanji (if okuri-gana is required, “kanji” + “okuri-gana”)
) is displayed (see FIG. 4(e)).

On the other hand, if a key other than the single kanji key is operated in step S3, a process corresponding to that key is performed in step Sho. This process is not an important part of the present invention, so a description thereof will be omitted.

That is, when a character string of kana characters is input from the input section 11 and the conversion key is operated, multi-clause conversion is performed, the input character string is separated into phrase units, and then kana-kanji conversion is performed. Then, the conversion result is displayed on the display section 17. Then, when the single kanji key is operated next, the character string of the first bunsetsu is converted into a single kanji, and the candidate kanji group is displayed on the display section 17 along with the number corresponding to each kanji ( Steps 82-S5). At this time, in order to select the desired kanji, when the number (number) corresponding to the desired kanji is input, the first clause is converted by the selected kanji,
The conversion result is displayed on the display unit 17 (step 86~
S9).

As described above, by performing the processes of steps 82 to S9 on all phrases obtained as a result of compound phrase conversion, it becomes possible to perform single kanji conversion for each phrase after compound phrase conversion.

Next, FIG. 6 is a diagram showing the configuration of the single kanji onkun dictionary 19 used in the single kanji conversion process.

As shown in the figure, the single kanji onkun dictionary 19 has a reading part 19a.
and a kanji section 19b. The reading section 19a includes a reading notation section 19a-1 in which on-yomi or kun-yomi hiragana characters of up to six syllables are stored, and a reading notation section 19a-1.
A pointer 19a- that stores the address in the kanji section 19b where the on-yomi or kun-yomi kanji indicated by is stored.
The reading index data in which 2 is one set is stored in alphabetical order. In addition, the kanji code of the kanji corresponding to the reading notation section 19a-1 stored in the reading section 19a is stored in the kanji section 19b, and the kanji codes of the kanji corresponding to the reading notation section 19a-1 stored in the reading section 19a are stored, and kanji with the same sound are consecutively arranged in one group as the homonym kanji group 19b-1. is stored at the address. A counter 19b-2 indicating the number of kanji stored in the homophone kanji group 19b-1 is provided at the top address of the homophone kanji group 19b-1.

To explain in more detail based on FIG. 6, the pronunciation notation part 19a-1 of the reading part 19a contains the alphabetical order of 'a', 'ah', 'ai', . . . 'wai', 'wan'. , Onyomi or Kunyomi data is stored in Hiragana characters.

For example, the pointer 19a-2 of the pronunciation notation section 19a-1 for "a" points to the start address of the homophone kanji group 19b-1 for "a" consisting of [β, "A", "A", ...]. In the homophone kanji group 19b-1, 7!1 kanji having the reading "a" are stored in the form of kanji codes.

Similarly, there are 12 kanji with the reading ``ah'' in the homophone kanji group 19b-1, and 12 kanji with the reading ``wai'' and ``wan'' in the homophone kanji group 19b-1.19b-i. To,
ll11 and lln are stored, respectively.

Next, single kanji conversion (
The processing operation of step Sa) described above will be explained using the flowchart of FIG. Note that the reading unit pointer P shown in the figure is a pointer indicating the address of the reading index data of the reading unit 19a.

In the single kanji conversion process, first, in step TI, the value of the reading part pointer P is set as the start address of the reading part 19 (initialization of the reading part pointer P). Next, the process proceeds to step T2, and the input clause data stored in the input cover sofa 13 is compared with the pronunciation notation part 19a-1 of the pronunciation index data in the pronunciation part 19 indicated by the pronunciation part pointer P. The input phrase data is read out as follows. First, the pointer AD of the clause data in the clause storage memory 23 stored at the address indicated by the pointer CP is read. Then, based on the AT=18-res indicated by the pointer AD and the number of characters YM, the clause data to be converted into single kanji characters is read out from the input cover sofa 13 (see FIG. 3).

The bunsetsu data currently being converted in the input character string read out from the input buffer 13 as described above and the pronunciation index data indicated by the pronunciation part pointer P in the pronunciation notation part 19a-1. If they match, the process advances to step T4, and based on the pointer 19a-2 of the reading index data of the reading section pointer P, the homophonetic kanji group 19b- indicated by the pointer 19a-2 in the kanji section 19b is compared. From 1,
Kanji data corresponding to the number of characters stored in the counter 19b-2 is read out and written into the display memory 15.

On the other hand, if they do not match in Step T3 of ``1'', the process proceeds to Step T5, and after setting the value of the reading part pointer P to the address of the next reading index data, in Step T6, the value of the reading part pointer P is Determine whether the address range has been exceeded. If the address range of the reading unit 19a is exceeded (Y), there is no kanji corresponding to the phrase data in the single kanji onkun dictionary 19, so the single kanji conversion process is terminated.

On the other hand, if the value of the reading section pointer P has not yet exceeded the address of the reading section 19a, the process returns to step T2 and the steps T2 to T60 are repeated.

In other words, when the kana-kanji conversion is not performed correctly for each phrase, select the phrase you want to correct using the cursor movement keys, use the conversion key to return to hiragana display, and use the single kanji keys (see Figure 4 (b). ), (see C1),
If the kanji corresponding to the pronunciation of the phrase is stored in the single kanji onkun dictionary 19 through the processing of steps T1 to T6, the kanji group corresponding to the reading is read out from the single kanji onkun dictionary 19, and A list is displayed in step S5 (see FIG. 4+d)).

In this embodiment, an example of converting a single kanji when selecting a phrase was explained using an example of inputting hiragana for on-yomi and kun-yomi. It is possible to perform unit kanji conversion using the head dictionary 21 and input the correct document.

〔Effect of the invention〕

As explained above, according to the Japanese word processor of the present invention, even if there is a phrase for which the correct kana-kanji conversion is not performed during multi-phrase conversion, it is possible to correct that phrase into a correct sentence by single-kanji conversion. Therefore, unlike conventional Japanese word processors, there is no need to re-enter input from the beginning, improving input speed and operability.

[Brief explanation of the drawing]

FIG. 1 is a functional block diagram of an embodiment of the Japanese word processor of the present invention. FIG. 2 is a system configuration diagram of an embodiment of the Japanese word processor of the present invention. FIG. 3 is a functional block diagram of an embodiment of the Japanese word processor of the invention. An internal configuration diagram of the storage memory 23, FIG. 4 is a diagram explaining the operation method of complex clause conversion, 2l- = 20- FIG.
-1 FIG. 6 is an internal configuration diagram of the single kanji onkun dictionary 19, and FIG. 7 is a flowchart 1 showing the processing operation of single kanji conversion in compound bunsetsu conversion. DESCRIPTION OF SYMBOLS 1... First dictionary storage means, 2... Second dictionary storage means, 3... Input means, 4... First conversion means, 5... Selection means, 6... Second conversion means. Patent applicant Casio Computer Co., Ltd. = 22- Figure 3 Column 0 1 Tongue 2 List 3 Tsukasa J flute AP Figure 5 71 J Go

Claims (2)

[Claims] (1) A first dictionary storage means for storing a dictionary for performing compound clause conversion, a second dictionary storage means for storing a dictionary for performing single kanji conversion, and a character string consisting of kana characters or romaji. an input means for inputting; a first conversion means for separating a character string inputted by the input means into clause units using the first dictionary storage means and converting the character string into a sentence containing kana and kanji; a selection means for selecting a phrase to be converted into kana-kanji again from among the plurality of phrases separated and converted by the conversion means; and a selection means for converting the phrase selected by the selection means into kana-kanji using the second dictionary storage means. A Japanese word processor characterized by comprising a second conversion means for converting into mixed sentences. (2) The Japanese word processor according to claim 1, wherein the second conversion means outputs a result of performing kana-kanji conversion on a phrase-by-phrase basis for the phrase selected by the selection means. .