JPS63318667A - Kana kanji converting device - Google Patents

Abstract

PURPOSE:To execute the KANA (Japanese syllabary) KANJI (Chinese character) conversion without instruction and to execute the correction with instruction by providing a means to check an input character string and execute the KANA KANJI conversion without the converting instruction of a user and a means to output a correcting caracter string with the instruction of the user. CONSTITUTION:A means to check an input character string and execute the KANA KANJI conversion without the converting instruction of user and a means to divide the KANA KANJI converting result into a clause unit are provided, a clause divided into the clause unit and the input character string are corresponded and stored into a memory. A means to add the information of a clause before a corrected clause and output a corrected character string with the correcting instruction of the KANA KANJI converting result of the user and a means to rewrite the above-mentioned memory so as to correspond to a new clause prepared by the correcting operation of the user are provided. Thus, in parallel to the input of a KANA character, a KANA KANJI converting processing can be executed. When the KANA KANJI conversion is executed to the character string not intended by the user, the correcting can be easily executed by the same operation.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a kana-kanji conversion device that converts kana input into sentences containing kanji and kana, and more specifically, the present invention relates to a kana-kanji conversion device that converts kana input into sentences containing kanji and kana. sentence.

without any special means of initiating conversion, such as a conversion key.

This invention relates to the improvement of a kana-kanji conversion device that performs conversion following input.

[Conventional technology]

There are several known methods for converting sentences that are input in kana (so-called solid input) that are not divided into sections (so-called solid input) into sentences containing kanji and kana. There is a method described in Publication No. 189565 "Kana-Kanji Conversion Device".

However, according to the kana-kanji conversion device described in Japanese Patent Application Laid-open No. 60-189565, it is possible to accurately convert kana input into sentences containing kanji and kana, and if there is ambiguity in the conversion result,
It is possible to extract and hold a plurality of candidates for that, and select the correct conversion result from among them.

Furthermore, the method described in JP-A-56-4832 ``Word Processor Input Method'' automatically identifies the breakpoints of clauses and phrases based on key human input time intervals, and uses them for conversion. This is a method of automatically converting at the timing, and there is no need for the user to press a conversion key to instruct the start of conversion.

[Problem that the invention seeks to solve]

However, among the conventional techniques mentioned above, the former method requires inputting the first kana sentence, and then pressing the conversion key to instruct the start of kana-kanji conversion. It took a long time to obtain the text, and even though it was not a phrase-by-phrase conversion method, the operator had to keep in mind the breaks in the input sentence when pressing the conversion key, which made the operation cumbersome. .

In the latter example, the user does not need to know the conversion key, but the system internally divides the input reading sequence without permission.
Since the conversion is performed continuously, it cannot be said that the Kana-Kanji conversion result that the user intended will always be obtained.

The present invention has been made in consideration of the above points, and includes:
The purpose of this is to input a kana character string that is not divided into bunsetsu units and convert it into kana-kanji without having to press a special conversion key. It is an object of the present invention to provide an improved kana-kanji conversion device that can correct the kana-kanji conversion result with a simple operation when the user cannot obtain the desired kana-kanji conversion result.

[Means for solving problems]

The purpose is to provide an input section for inputting the reading to be converted into kana-kanji, a storage section for storing the kana-kanji conversion candidates generated by the input character string kana-kanji conversion process, and a storage section for storing the kana-kanji conversion candidates generated by the input character string kana-kanji conversion process. a dictionary that stores information such as 9 parts of speech; a dictionary search means that extracts a partial string from the input character string and searches for a word with a corresponding pronunciation in the dictionary; The input character string is checked in a kana-kanji conversion device that is equipped with a kana-kanji conversion processing unit that includes means for testing connections with preceding and following words, and a display unit that displays the result of converting the characters input from the input unit into plain kanji. means for performing kana-kanji conversion without a user's conversion instruction; a means for dividing the kana-kanji conversion results into phrase units; a memory for storing the phrases divided into phrase units and their input character strings in correspondence; Based on instructions for correcting the Kana-Kanji conversion results,
This is achieved by adding means for outputting a corrected character string by adding information on the clause before the corrected clause, and means for rewriting the memory to correspond to a new clause created by the user's correction operation. .

[Effect]

Therefore, the present invention provides the above-mentioned means, that is, a means for checking an input character string and performing kana-kanji conversion without a user's conversion instruction, a means for dividing the kana-kanji conversion result into phrase units, and a means for dividing the kana-kanji conversion results into phrase units. and a memory for storing the input character string in correspondence with each other, a means for outputting a corrected character string by adding information of a clause before the corrected clause according to a user's instruction to correct the kana-kanji conversion result, and a user's correction operation. By providing means for rewriting the memory to correspond to the new clause created by the method, it becomes possible to perform kana-kanji conversion processing in parallel with the input of kana characters.

Furthermore, if a character string is converted into a kana-kanji character string that the user did not intend, the user can easily correct it by the same operation without having to be aware of changing the phrase break or changing the homonym.

〔Example〕

Hereinafter, the present invention will be explained based on an embodiment of the drawings. Fig. 2 is an overall hardware configuration diagram of a kana-kanji conversion device. In Fig. 2, 1 is an input section, 4 is a display section, and 2 is a 5 is a storage device, and 3 is an external storage device.

In the above configuration, the input unit 1 is an input reading sequence.

The display unit 4, which is an input device for inputting kana-kanji conversion 1 selection instructions, etc., is constituted by, for example, a CRT display 1, for displaying the input pronunciation and further the results of the kana-kanji conversion. The control unit 2 controls execution of kana-kanji conversion, and is composed of a CPU. Memory department @
5 is a place for storing programs, data, etc., and external storage device ii3 is a place for storing a dictionary used in kana-kanji conversion.

FIG. 1 is a brooch yard showing the overall operating system of kana-kanji conversion processing by the apparatus of the present invention, and the following is a diagram.

The contents of the kana-kanji conversion process will be explained based on FIG. 1 while referring to FIG.

In the key human power analysis process (step 10 in Figure 1), the input information from the input unit 1 is analyzed and corresponding to the input information is performed, such as performing kana-kanji conversion processing and creating character strings for candidate correction. Perform processing.

If a character string as a result of Kana-Kanji conversion is output as a result of the key human power analysis process (10), the conversion result character string process (20)
) to display the converted character string (hereinafter referred to as text string) on the display section 4, and to manage the input reading in the storage section 5 so that the input reading and the text string correspond to each bunsetsu unit. Store in buffer and text string management buffer.

If the result of key human analysis processing (10) is a conversion key,
The input reading and text string of the clause containing the text string indicated by the cursor and the input reading and text string of the clause preceding the clause are retrieved from the input reading management buffer and the text string management buffer of the storage unit 5. , and hand over to the selection candidate creation process (40).

In the selection candidate creation process (40), kana-kanji conversion processing is performed by adding the input reading of the previous clause to the input reading of the clause pointed to by the cursor, and the information of the previous clause is included and corrected from the beginning of the clause pointed to by the cursor. It is possible to output multiple text strings.

If the result of the key human analysis process (10) is to modify the conversion candidate, the candidate correction process Jul (50) is activated, and the text character string already displayed on the display unit 4 is changed to the text character selected by the user. Change to column.

If the result of the key human analysis process (10) establishes a part of the phrase being corrected, the partial establishment process (60)
) to establish the part of the text string being modified that is displayed on the display 4.

Also, if the result of the key human analysis process (10) establishes all the clauses that are being corrected.

The all-establishing process (70) is started to establish all of the text character strings displayed on the 1 display section 4.

Finally, if the result of the key human power analysis process (10) is an end key, document editing is ended, and in other cases, the key human power analysis process (10) is started again.

Below, the key human analysis process (10), the conversion result character string process (20), and the input reading character string extraction process (30) are explained below.
), selection candidate creation processing (40).

Candidate correction processing (50), partial establishment processing (60).

Each operation of the all establishment process (70) will be explained in detail.

FIG. 4 is a flowchart showing the operating system of the key human power analysis process (10).

In FIG. 4, first, in step 105, it is determined whether the input key has been evacuated or not. The input key is saved at the conversion key (902) shown in FIG. 3 while the text string for correction is being output.

This is when a key other than the change key (904) or partial establishment key (90G) is input. The reason is that it is necessary to output information for establishing text strings and to establish all text strings that are subject to modification. And the control of whether the input key is evacuated or not is as follows.
The input key performed at r/LG2 has not been saved when FLG2 is "0", has been saved when FLG2 is "1", and when FLG2 is "0", it is not saved in step 110. , takes out the information input by the user from the input unit 1, and when FLG2 is "1", takes out the input information from the save area and stores it in the memory of the storage device 5 (hereinafter referred to as INP).
UT$KEY).

In step 115, FLGI is used to determine whether the clauses in the text string are currently being edited by outputting a text string for correction, or are being created as a normal document. Make a judgment. When FLGI is "1", it is in a modification state, and when FLGI is rOJ, it is in a document creation state, and FLGI and FLG2 are cleared to rOJ as an initial setting when the system is started up. - In step 115, if FLGI is "0", that is, if document creation is in progress, in step 125, INPUT$KEY is set to the character key (
901) If it is a 6-character key (901), character input processing is performed in step 130.

FIG. 5 is a flowchart showing the operation flow system of character input processing (130).

In FIG. 5, first, in step 1310,
The information of INPUT$KEY is stored in the input reading storage area (hereinafter referred to as CHR$ROFF). In addition, in this case, CHR$ POINTER is used as a pointer to manage CHR$ B tJ FF, and CHR$
POINTER is set to "1" at system startup, and in step 132o, CHR$
POINTER is incremented by one, and in step 1330, the input reading character string stored in CHR$BtJFF is displayed on the display section 4.

For example, as shown in Figure 6, CHRtlBUFF is set to "
When the user presses the input section 1 while the
If you input the character key "ka" from step 131
At step 1330, "ka" is stored as shown in FIG. 7, and at step 1330, as shown in FIG.
6. In FIG. 8, the bottom of one screen shows the input line, and the top shows the text string output line.

In FIG. 4, after completing the character input process (130),
In step 140, it is checked whether the kana-kanji conversion process can be started with the current input character string.

FIG. 9 is a flowchart showing the operating system of the Hakana-Kanji conversion activation check.

In FIG. 9, first, in step 1410,
It is determined whether INPUT$KEY is a punctuation mark. If it is a punctuation mark, set the conversion flag to ``1'' to start the conversion.
If it is not a punctuation mark, determine whether it is a break between phrases (1420), and if it is determined to be a break between phrases, set rlJ to the conversion flag (1430).
, otherwise set the conversion flag to rOJ (1
440) Do.

In FIG. 4, in step 142, the conversion flag is set to "
1”, and if it is “1”.

Start the conversion process (80) and perform kana-kanji conversion.
If it is "0", the next input key is taken out (110).

In the conversion process (80) in FIG. 4, CHR$BUF
Based on the input pronunciation stored in F, search a dictionary that has the pronunciation, notation, and part of speech of the word in order from the beginning, and use the part of speech of the searched word to test the connection with the preceding and succeeding words. Repeat the operation to create Kana-Kanji conversion candidates.0 For example, Figure 11 shows a specific example of data formed as Kana-Kanji conversion candidates in CHR$BUFF shown in Figure 10. , a network-like data structure is adopted, and in this data structure, 1 notation and its corresponding pronunciation and part of speech are stored, reducing storage capacity. 0 Select the optimal candidate from the created network. For example, Japanese Patent Application Laid-open No. 6
As shown in FIG. 5 of Publication No. 0-189565, the candidate sequence with the largest likelihood is extracted from among the candidate sequences, and
A conversion candidate display buffer (hereinafter referred to as IIE) is displayed as a conversion result.
NKAN $BUFF). The likelihood here refers to the number of phrases multiplied by weights that take into account the style and frequency of occurrence, and the smaller the number, the higher the luminosity. verb.

Adjectives and adjective verbs are given a weight of 1, formal nouns, auxiliary verbs, adjunctive words, etc. are given a weight of 0.1, and prefixes and suffixes are treated as semi-independent words and given a weight of 0.5. In the case of , as shown in FIG. 12, "on mathematical analysis" is stored in HENKAN$BUFF.

In FIG. 4, in step 150, 1 (ENKAN
The text string stored in $BUFF is divided into clauses based on the parts of speech stored in the data structure on the network, and as shown in Figure 13, the number of divided clauses is equal to the number of effective clauses, and the number of clauses is equal to the number of effective clauses. The number of input readings is stored in the input number of readings management area for each clause, and the number of text strings is stored in the number of text strings management area for each clause. In the example shown in Figure 12, there are two clauses: "mathematics" and "analytical", so set "2" to the number of effective clauses and input reading count management area for each clause (1).
stores the number of characters r4J of the input pronunciation ``Sukaku'' corresponding to ``mathematics'', and similarly, the number of characters [8] of ``Kaisekijiyo'' is stored in the input pronunciation management area for each clause (2). . In addition, the text string count management aria for each clause (
In 1), the number of characters for "mathematics" is stored as "2", and in the clause unit text character string number management area (2), the number of characters for "analytical" is stored as "4".

In FIG. 4, the conversion process (80) is started by C
This process can also be performed when the conversion key (902) shown in FIG. 3 is input while the input reading is stored in HR$BUFF. Furthermore, if the conversion key (902) is input in a state where the input reading is not stored in CHR$BUFF, information on the conversion key is output.

Next, in FIG. 1, the conversion result character string process (2o) that is activated when the output of the key human power analysis process (10) is a conversion result character string will be described based on □FIG. 14.

In FIG. 1, in the conversion result character string processing (20), the input reading count management area for the number of valid bunsetsu (two phrases) set in the output character string creation (step 150 in FIG. 4),
Based on the text string number management area for each phrase, the 14th
As shown in the figure, the input reading from CHR*BUFF is
Each text string is extracted from ENKAN $ BUFF, and the input reading is stored in the storage device i! Input reading management buffer in 5.

The text strings are stored in a corresponding text string management buffer in the storage device I5. Specific examples of the input reading management buffer and the text string management buffer are shown in FIGS. 15 and 16. In FIGS. I wrote down. FIG. 17 shows an example of the display state of the display section 4 when outputting a text string. Following the flow shown in FIG. 17, the input reading is converted into a text string, and the display section of FIG. 4 will be displayed.

Here, the text string displayed on the display section 4 is
The following describes the flow of correction when the text string differs from the user's intended text string.

After moving the cursor to the text string that the user wants to modify, the user inputs the conversion key (902) shown in FIG. In the key human power analysis process (10) of FIG. 1, based on step 145 of FIG. 4, it is checked whether an input reading exists in CHR$BUFF. CHR$BUF
If there is no input reading for F, use the conversion key 902
output. After the determination in step 25 in FIG.
The manual reading character string retrieval process (30) is activated to retrieve the input reading corresponding to the clause containing the text string to be corrected.

FIG. 18 is a flowchart showing the operation system of the input reading process (30).゛In FIG. 18, first, in step 310,
Checking how many phrases the cursor position is from the beginning of the text string management buffer, and in step 315, extracting the corresponding input reading from the input reading management buffer;
Then, the input reading taken out from the input reading management buffer is set to 5UB1$CHR$BUFF (320
), and the number of characters set is SUB 1 $CHR$
Set to CNT (325). Similarly, step 33
0, the text string is retrieved from the text string management buffer, and in step 335.

SUB 1 Set $TEXT$BUFF, SUB
In step 3, set the number in I$TEXT$BUFF.
40, set to 5UB1$TEXT$CNT.

Next, in step 345, it is checked whether the clause before the clause to be modified is a clause that retains the input reading, and if the input reading exists, the reading is extracted from the input reading management buffer. 350), 5UB2
Set $CHR$BUFF (355). and,
S U B 2 Set the number of characters set in $CIIR$BUFF to 5UB2$C)IR$CNT (36
0). Similarly, extract the text string, 5UB2$
TEXT$BUFF and 5UB2$TEXT$CN'
1. - set (365, 370, 375), 5UB2$CHR$CNT and 5U132$T for a clause that does not have a preceding clause and does not hold an input reading;
Set rOJ in EXT$CNT (380).

In steps 385 and 390, the value of 5UB1$CHR$CNT and the value of SUB1$TEXT$CNT are set as initial values in the input reading length area and text string length area, respectively, which are used during the process of establishing a corrected clause. . Also, in step 395, the SE managing the input reading length area and the text character string length area
Set "1" to T$CNT. For example, with the text string shown in Figure 19 being output on the display section 4 in Figure 2, move the cursor to the position of ``Meeting'' and then input the conversion key (902) in Figure 3. In this case, input pronunciations and text characters corresponding to the clause at the cursor position, "kaiseki no jo" and the previous clause "mathematics", are obtained from the input pronunciation management buffer shown in Fig. 20 and the text string management buffer shown in Fig. 21. The column is taken out and the information is stored in each memory of the memory bag W15 as shown in FIG.

In the input character string extraction process (30) in FIG. 1, after the input character string is extracted, the selection candidate creation process (40)
t - Launch and output a modifiable text string.

FIG. 23 is a flowchart showing the operation system of the selection candidate creation process (40).

In FIG. 23, in steps 410 and 420, 5UB2$CHR$BUFF and 5UB1$C
Set HR$BUFF to CHR$BUFF and create an input reading for starting the conversion process (80). In the process (80), a conversion process is performed based on CHR$BUFF to create a network-like data structure as shown in FIG. In step 430, it is checked whether a text string identical to the text string stored in 5UB2$TEXT$BOFF exists at the corresponding position in the created network data structure. In step 430, 5UB2$TEXT$BU
If there is a text string that is the same as the text string stored in FF, then 5UB1 $T is added after it.
Check whether a text string that is the same as the text string stored in EXT$BUFF exists (460), go to step 460, 5UB1'$TEXT$BOFF
If the same text string as the text string stored in 5UB1 does not exist, in step 470, 5UB1
The contents of $CHR$BUFF are reset to CHR$BUFF and the conversion process (80) is restarted. Then, in step 470.

If 5UB1 $TEXT$BUFF4m is stored and the same character string as the tail text string follows, multiple text strings connected after the previous clause are stored, and in step 470, 5UB1$TEXT$BUFF
If there is no subsequent text string that is the same as the text string stored in , a plurality of text strings starting from the beginning are output in a matrix format, for example, as shown in the lower right corner of FIG. Then, as shown in Figure 24, the outputted multiple selectable text strings are converted into kana-kanji based on two pieces of clause information: the clause containing the character string instructed to be modified, and the clause before it. Since this is a character string output by performing the above process, the text string is a mixture of text strings that change phrase breaks and text strings that change homonyms. Therefore, the user can change both the one-segment break and the homophone with the same operation.

Next, a case will be described in which a plurality of candidate correctable text character strings are changed using the change key (904) shown in FIG. 3.

In FIG. 1, after starting the selection candidate creation process (40) and outputting a plurality of text character strings that can be modified, it is recognized that the state of modification has been reached.

In step 45, FLGI is set to "1" and
Start the power analysis process (10). When the user enters the third
By the change key (904) shown in the figure.

When the user selects the desired character string from among a plurality of text strings that can be modified, the modified character string creation processing system (160) shown in FIG. 4 is activated.

FIG. 25 is a flowchart showing the operation system of the modified character string creation process (160).

In FIG. 25, first, in step 1605, the optimal character string following the selected text string is extracted from the network data structure, and set to HENKAN $BtJFF, including the selected character string. (1610) Next, the text string set in IIENKAN$BUFF is divided into clauses, and the length of the input reading and the length of the text string corresponding to each clause are stored in the input reading length area and the text string. Store in the column length area.

Also, the number of phrases divided into one is stored in SET$CNT. For example, if you select "R family" in the state shown in Figure 24, the second
As shown in Figure 6, for IIHNKAN $ BUFF, ``on transfer'' is extracted from the network data structure and stored as one clause, and ``on transfer'' and ``on transfer'' are combined.
It is divided into two parts, and the respective information is stored in the input reading length area, the text character string length area, and SET$CNT. In the candidate modification process (50) shown in FIG. 1, the text string in IIENKAN $BUFF is displayed on the display section 4 as shown in FIG. 27th
In the state shown.

When the user inputs the partial establishment key (906) in Fig. 3, it starts the partial establishment character string creation (170) in Fig. 4 and displays the establishment of "department" as shown in Fig. 34. and displays it on the display section 4.

FIG. 28 is a flowchart showing the operation system for character string creation processing (170) in which a text character string is partially established.

In FIG. 28, step 1705 determines whether the text string to be established is part of the preceding clause. If the text string to be established is a prefix or an independent word without a prefix, it is treated as an independent clause and is marked with "0" in the clause information area.
", and if the text string to be established is an independent word with a prefix, a prefix, or an attached word, set "1" in the clause +lI area as part of the preceding clause. An independent word with a prefix here refers to a case where the text string to be established is an independent word and the text string immediately before it is a prefix. Next, the input reading length area and text character string length area are corrected (1765, 1770). Modification means subtracting the number of input readings and the number of text strings corresponding to the character string to be established from (1) in each area (1745), and if (1) in each area becomes "0", , memory is moved from (2) to (1) and from (3) to (2) in each area. Also, subtract 1 from SET$CNT (
1760), and in the case of the example shown in FIG. 26, the input reading length of "r family" is 1. Since the text string length is 1, when the "family" is established, the input reading length area (1) and the text string length area (1) become rOJ. Therefore, move (2) in each area to (1), and finally add "7" to the input reading length area (1) and text string length area (1).
``4'' is stored in SET$CNT, and ``1'' is stored in SET$CNT.

FIG. 29 is a flowchart 1 showing the operation system of the text character string part establishment process indicated by reference numeral 60 in FIG.

In FIG. 29, in steps 605 and 610, the input reading management buffer and the text character string management buffer are divided into segments. For example, in the state shown in Figure 27,
When established, ``Kaisekijiyono'' is divided into ``Ka'' and ``Isekijiyono'' as shown in Figures 30 and 31.

Next, in step 615, the phrase information area is set to “1”.
”, connect it to the previous clause. For example, in the case of "Ka", the phrase information area is [1] because it is the suffix of "Mathematics" in the previous clause, and as shown in Figures 32 and 33, "Suugaku" is the suffix of "Mathematics" in the previous clause. Connect the phrases ``ka'' to create a new phrase ``suukakuka''.

Finally, a case will be described in which a key other than the change key (904) or partial establishment key (906) in FIG. 3 is input to establish all text character strings. That is, FIG. 35 is a flowchart showing the operation system of the entire text character string establishment process indicated by reference numeral 70 in FIG.

In FIG. 35, in step 705, 5ET11C
The input reading management buffer is updated by the number of NT based on the input reading length area. In step 710, 5ETlCNT
Update the text string management buffer based on the text string length area for several minutes.

Next, in process 715, the part of speech of the first established character string is checked, and if it is an independent word with a prefix, a suffix, or an attached word, in processes 735 and 740, the input reading length area (1) and the text character Connect the character string corresponding to column length area (1) to the previous clause.

The kana-kanji conversion device according to the present invention is configured to sequentially convert kana character strings that are input in order into kana-kanji, and is configured so that the kana character strings are input sequentially, like an interactive voice input device. It is also effective for devices such as

〔Effect of the invention〕

The present invention is as described above, and as is clear from the explanation of the illustrated embodiment, the present invention provides an apparatus for converting a kana character string that is not divided into phrases into kana-kanji by inputting a kana character string that is not divided into phrases. , it becomes possible to perform kana-kanji conversion without pressing a special conversion key, and since the conversion follows the input, it becomes easy to check the conversion result.

Moreover, according to one aspect of the present invention, if the converted character string that the user intends is not output, simply by specifying the character string that the user wants to modify, the character string and the homophone character string that change the break of one phrase can be changed. and are output as selectable character strings, the user is able to make corrections in the same operation without having to be aware of changing phrase boundaries and homophones, making it easier to use than before. You can get an improved Kana-Kanji conversion device.

[Brief explanation of the drawing]

The drawings show an embodiment of the kana-kanji conversion device according to the present invention, FIG. 1 is a flowchart showing the overall operation system of the kana-kanji conversion process by the device of the present invention, and FIG. 2 is an overall hardware configuration diagram of the device of the present invention. FIG. 3 is a key arrangement diagram, FIG. 4 is a flowchart showing the operation and system of key human power analysis processing, FIG. 5 is a flowchart showing the operation system of character input processing, and FIGS. 6 and 7. FIG. 10 is a diagram showing a specific example of the input reading storage area, and FIGS. 8, 17, 19, 24, 27, and 34 are diagrams each showing a specific example of screen output information. ,
Fig. 9 is a flowchart showing the operation system of ephemeral kanji conversion startup check, Fig. 11 is a diagram showing a specific example of data formed by the ephemeral kanji conversion unit, and Fig. 12 is a diagram showing a specific example of the buffer for displaying ephemeral kanji conversion candidates. , Fig. 13 is a diagram showing a specific example of the management area when the buffer for displaying ephemeral-kanji conversion candidates is divided into clauses, Fig. 14 is a flowchart showing the operation system for character string processing as a result of ephemeral-kanji conversion, Figs. 15 and 20
30 and 32 are diagrams showing specific examples of the input reading management buffer, and FIG. 16. Figures 21, 31, and 33 are diagrams showing specific examples of text string management buffers, Figure 18 is a flowchart showing the operation system of input reading character string extraction processing, and Figure 22 is a diagram showing a specific example of a text string management buffer. A diagram showing a specific example of a memory for creating a character string, FIG. 23 is a flowchart showing the operation system of selection candidate creation processing, FIG. 25 is a flowchart 1 showing the operation system of changed character string creation processing, and FIG. 26 Figure 28 shows a specific example of the management area when the buffer for displaying ephemeral kanji conversion candidates is divided into clauses; Figure 28 is a flowchart showing the operation system for character string creation processing in which a text string is partially established; Figure 2
FIG. 9 is a flowchart showing the operation system of the text character string partial establishment process, and FIG. 35 is a flowchart showing the operation system of the text character string entire establishment process. 1... Input section, 2... Control section, 3... External storage device, 4... Display section, 5... Storage device. Thing 10 20th Sheep 3 Mouth opening 4 - Mouth opening 5 Closing 5 figure cH trunk βLIFF 8th prisoner war 8 flash φ9 prisoner 1st (0 mouth 11th prisoner graduate 12 countries) - IENMN$F3tJFF 13th effective ordinal early 1 cow Mouth house 15 misfortune +67 Swamp 190 Dormitory 1 [mouth 190 Figure LO Figure 21 Chill 11 length': fgu 11 vomit 1! Bar ° Sofa No. 22 5tlB1*CHR Baba CNT 5UBlp
TEXT%eNr2■koroeko5LIB1#(:HRkoBtUFF 5ttB details TpBttFFSt/B2%CHRptNT
5tleZpTEf, TpCNT Nieko
RoIkoSLlB2Pepm8uFF su s z
# rr:xrfs erut-F123 No. 25 concave (HENKAN F BtlFF of the second da prisoner 26 of the vague) Snuri and Ryo Etsua Chast length 1 character string table area SETφCNT ' Roeko $Zq's commission key 2. 'y's 3rd Q l ¥ 1 Human Power White Secret 1 [Rea 7 F 7 Dream 311! 1 $Jz country 33rd picture a4-rA

Claims (1)

[Claims] 1. An input unit for inputting the pronunciation to be converted into kana-kanji, a storage unit for storing kana-kanji conversion candidates generated by the input character string kana-kanji conversion process, and a word notation using the word pronunciation as an indexing means. A dictionary that stores information such as parts of speech, and partial strings are extracted from the input string,
a kana-kanji conversion processing section including a dictionary search means for searching for a word having a corresponding pronunciation in a dictionary, a connection test means with preceding and succeeding words based on the word searched by the dictionary search means, and the input section. In a kana-kanji conversion device, the kana-kanji conversion device is equipped with a display unit that displays the result of the conversion of input characters into kana-kanji. means for dividing into units; a memory for storing the phrases divided into phrase units and their input character strings in correspondence;
A means for outputting a corrected character string by adding information of the clause before the corrected clause according to a user's instruction to correct the kana-kanji conversion result, and rewriting the memory to correspond to a new clause created by the user's correction operation. A kana-kanji conversion device characterized by adding means.