JPH0350669A - Information processor - Google Patents

Abstract

PURPOSE:To realize the KANA (Japanese syllabary)/KANJI (Chinese character) conversion of a compound word of good operability through the use of the dictionary of small capacity by adding compound word information in which information capable of succeeding to every word is made succeeding word information to a word dictionary, and retrieving a corresponding succeeding word. CONSTITUTION:KANA input data is given from an input device 1 to a reading input control circuit 4 through a next process determination circuit 2, and is stored in a reading character string storage area 5. It is assumed that a reading character string stored in the area 5 is 'JOUHOSHIYORIGATSUKAINIOITE'. A reading candidate corresponding to this character string does not exist in the word dictionary 7. Then, re-retrieval is repeated as cutting off successively every one character from a rear part. Then, when 'JOHO' is found in the dictionary 7 as the reading candidate corresponding to the reading character string of 'JOUHOU', a grammar analysis circuit 9 takes out the information of the word preceding by one word from a converted result storage area 11, and executes grammatical connection check between the preceding word and the information of this time. These operations are repeated, and the final result of 'JOHO SHORI GAKKAI NI OITE (in an information processing society)' can be obtained.

Description

[Detailed Description of the Invention] This invention relates to the improvement of information processing devices such as word processors, personal computers, DPS, etc., and particularly to information processing devices equipped with Japanese processing functions through kana-kanji conversion. The present invention relates to an information processing device that has high operability and low cost by adding a dictionary of small capacity and short search time to the device.

Specifically, compound word information is added to the word dictionary as information that can be followed for each word as subsequent word information, and subsequent words are converted using this compound word information, thereby saving a small amount of memory. The present invention relates to an information processing device that realizes a dictionary with a short search time.

In recent years, Japanese language processing functionality has become essential for information processing devices such as word processors and personal computers.
In particular, in the kana-kanji conversion process necessary for inputting kanji peculiar to the Japanese language, there is a strong desire to reduce the capacity and cost of dictionaries.

Until a few years ago, dictionaries held word information;
The algorithm handles compound word input by checking grammatical connections between words.

However, with this compound word input method, not only is it not possible to obtain a conversion rate that is satisfactory to the user, but even though it is grammatically correct,
In practical terms, strange compound words (coined words with no meaning) keep appearing,
The need for compound word dictionaries is on the rise.

A compound word is a word made up of multiple words and includes a lot of character string information such as pronunciation and notation, and storing this requires a significant increase in dictionary capacity.

FIG. 6 is a diagram showing an example of a conventional word dictionary.

As shown in Figure 6, the ``reading'' and ``notation'' of compound words
All of these are stored in the word dictionary in advance. For example, for the compound word ``johoshiyori'', which is the word ``read'',
Make the "Information Processing" display compatible.

In this way, for the necessary compound words, their "reading" and "
If you memorize all the notations in the word dictionary in advance, it will be extremely easy to convert compound words into kanji.

and can be executed quickly.

However, in this compound word input method, the storage capacity of the dictionary inevitably increases, so cost amplification is inevitable.

To solve such problems, conventionally, compound word input methods have been used in which a word dictionary and a compound word dictionary are used in combination, or a word dictionary and previous word information are used in combination.

Figures 7 (1) and (2) are diagrams showing an example of a compound word input method that uses a combination of a conventional word dictionary and a compound word dictionary, where (1) is a word dictionary and (2) is a compound word input method. It is a dictionary. In the drawing, . and . 2 indicate pair information.

This word dictionary shown in Figure 7 (1) stores the minimum necessary information for each individual word, and separately, as shown in Figure 7 (2), a compound word dictionary is stored. Set it up.

Then, in this compound word dictionary, the compound word "yomi" and the pair information of compound words, that is, address information are stored, and by searching this compound word dictionary,
Deal with the conversion process of compound words.

For example, in the case of "Jiyou Hoshiyori", give the compound word dictionary as pair information, 2, which corresponds to the notation of "information", and 2, which corresponds to the notation of "process". .

According to this input method, the capacity of the word dictionary can be reduced considerably compared to the method shown in Figure 6 above, but since it is necessary to search two dictionaries, the search takes time and processing efficiency decreases. .

The following Figures 8 (1) and (2) are diagrams showing an example of a compound word input method that uses a combination of a conventional word dictionary and previous word information, where (1) is a word dictionary and (2) is This is the previous word information.

In the compound word input method shown in Fig. 8 (1) and (2),
For each word in the word dictionary, in addition to the "reading" and "notation", address information indicating information on the word that can be the previous word is stored, and the "reading" of the previous word and its name are stored in that address. This is handled by storing candidate numbers among homophones for ``read''.

In this input method, the following word is used as a base, and the previous word for that word is searched.

Therefore, it is meaningless unless the subsequent word is detected correctly.

However, conversely, if the subsequent word is detected correctly, it means that the previous word will also be detected with a fairly high probability, so it is not necessary to go to the trouble of searching for the previous word information. , simply to prevent conversion into meaningless neologisms.

In short, the input methods shown in FIGS. 8(1) and (2) are less effective in dealing with compound words.

Moreover, like the method shown in FIG. 7, it is necessary to search two dictionaries, which takes time and reduces processing efficiency.

As described above, in the conventional compound word input method, if all compound words are stored in the word dictionary as shown in Figure 6, the dictionary capacity will increase, and as shown in Figures 7 and 8. However, if two dictionaries are prepared and searched, the search time is long, the processing efficiency is reduced, and the dictionary capacity cannot be saved much.

This invention aims to solve the disadvantages of conventional information processing devices such as Japanese word processors, especially the compound word input method that uses two dictionaries for searching, as shown in Figures 7 and 8. It is an object of the present invention to provide an information processing device with a built-in dictionary at low cost by solving the inconveniences, making it possible to shorten search time, improving operability through highly efficient conversion processing, and reducing the capacity of the word dictionary. purpose.

This invention for teaching the lesson includes at least an input means, a display means, a word dictionary, a word information storage means for storing information on words consisting of character strings containing kanji corresponding to kana and kana, and the corresponding word information storage means. and a kana search means for searching the word information storage means using kana as a key, and an information processing device having a kana-kanji conversion function for converting kana input from the input means into kanji, wherein each word is stored in the word dictionary. A subsequent word search that adds compound word information to each possible successor as subsequent word information, and searches for a corresponding subsequent word when there is compound word information that follows the word information detected by the kana search means. means, ζ, when converting a subsequent word into Kanji, the compound word information is searched by the subsequent word search means to convert the compound word into Kanji.

DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, embodiments of the information processing apparatus of the present invention will be described in detail with reference to the drawings.

FIG. 1 shows an information processing apparatus according to the present invention.

FIG. 2 is a functional block diagram showing an example of the configuration of the main parts thereof.

In the drawings, 1 is an input device, 2 is a next process determining circuit, and 3 is an input device.
4 is the editing circuit, and 4 is the reading input control circuit.

5 is a reading character string storage area, 6 is a conversion processing control circuit, and 7 is a reading character string storage area.
is a word dictionary, 8 is a dictionary search circuit, 9 is a grammar analysis circuit, 1
0 is a compound word information search circuit, 11 is a conversion result storage area,
12 is a character string display data creation circuit, and 13 is a display device.

The functions of each part in the block diagram of FIG. 1 are outlined as follows.

The input device 1 includes a keyboard and the like, and has the function of inputting characters, ruled lines, control information, and other data.

The next process determining circuit 2 determines the data from the input device 1, determines the next process to be performed, and sends the input data to the corresponding circuit at the subsequent stage.

The editing circuit 3 has a function of editing input characters, ruled lines, and the like.

The reading input control circuit 4 has a function of controlling the input of reading character strings based on the character information from the next process determining circuit 2.

The reading character string storage area 5 holds character information from the reading input control circuit 4.

The conversion processing control circuit 6 controls the entire reading conversion process.

The word dictionary 7 is an area for storing word pronunciation, part of speech, frequency, and subsequent word information.

FIG. 2 is a diagram showing several examples of data in the word dictionary 7. In the drawings, A1 to A6 indicate addresses, and 0 indicates that there is no corresponding address.

As shown in FIG. 2, the word dictionary 7 includes:

In addition to "reading" and "notation", "part of speech", "frequency", and "subsequent information" are stored.

For example, the part of speech information for "read" is "katsukai" is [noun]
The frequency information is "1" and the subsequent information is "O".

In addition, the part of speech information for "kensaku" is "suhenname side",
Its frequency information is "1", and its subsequent information is address rA3. A
6.0".

Similarly, for "r side", the part of speech information is "su pseudonym side", the frequency information is "2", and the subsequent information is address rA1. O.J.
It is.

In addition, the subsequent information of "Jyouhou" is at address rA3.
A2. This is O.J. There is no limit to the number of subsequent word information, and "0" is information indicating the final word, that is, a "mark."

In this way, the subsequent word information in the case of "Jiyouhou", that is, "information" is rA3. A2. It is oJ,
The following two words, ``process'' (address A3) and ``search'' (address A2), are registered as words that can be connected.

Therefore, in the example of FIG. 2, the compound word "information processing"
and r information search" are registered.

The conversion process of compound words using these "parts of speech,""frequency," and "successive information" will be described later.

The dictionary search circuit 8 searches the word dictionary 7 using the read character string as a key.

The grammar analysis circuit 9 has a function of checking grammatical connections between words.

The compound word information search circuit 10 has a function of searching the word dictionary 7 for subsequent word information.

The conversion result storage area 11 is an area for storing the results of conversion processing.

The character string display data creation circuit 12 creates pattern data for displaying characters.

The display device 13 is a display device such as a CRT or LCD, and has a function of visualizing input characters, ruled lines, and the like.

The above are the functions of each part in the block diagram of FIG.

Next, the operation of the information processing apparatus of the present invention shown in FIG. 1 will be explained.

When a key is input from the input device 1, the next process is determined in the next process determining circuit 2 according to the input contents, and necessary data is output to the corresponding circuit.

FIG. 3 is a flowchart showing the flow of main processing at the time of reading input in the information processing apparatus of the present invention. In the drawings, #1 to #4 indicate steps, and ■ indicates a connection.

First, in the input table W1 in Figure 1, there is a key human power (
Step #1), and the next process determining circuit 2 determines the type of key human power (Step #2).

If it is determined in step #2 that the input data is input data, the process advances to step #3, where it is determined whether the input is a reading input.

If the input is a reading input, the process advances to reading input processing, where the kana input data from the input device 1 is given to the reading input control circuit 4 and reading editing is performed.

The input read character strings are sequentially stored in the read character string storage area 5. These processes are similar to conventional processes.

If it is determined in step #3 that the input is not a reading input, the process proceeds to step #4, where it is determined whether the input is a conversion request.

Generally, in the kana-kanji conversion process, a conversion request is input after some characters have been read and input.

If it is determined in step #4 that this conversion request has been input, the process proceeds to conversion processing.

In FIG. 1, from the primary process determination circuit 2 to the conversion processing control circuit 6.
A conversion command is generated (see FIG. 5 below for detailed flow).

If it is determined in step #4 that a conversion request is not input, the process proceeds to other editing processes. An editing command is given from the next process determining circuit 2 to the editing circuit 3.

Incidentally, the connection ■ indicates an input from the flow shown in FIG. 5, which will be described later.

In this way, in the information processing apparatus shown in FIG. 1, necessary data is sent from the next process determining circuit 2 to the corresponding circuit according to the input content in response to each key input for reading input, conversion request, and editing processing. .

Since the information processing apparatus of the present invention has a feature in this dictionary search, it will be described in detail by showing a specific embodiment.

FIG. 4 is a diagram illustrating a specific example of the procedure of compound word conversion processing performed by the information processing apparatus of the present invention.

FIG. 4 shows an example of conversion when the reading character string is ``Jōhoshi yori gakkai ni''.

In FIG. 4, the left side shows the reading character string storage area 5, the center shows the conversion result storage area 11, and the right side shows the subsequent word information of the word dictionary 7.

First, in the first state 1, there is no reading candidate in the word dictionary 7 that corresponds to the reading character string ``Jiyouhoushi yori gakkai ni'' in the ``reading character string storage area 5'' on the left. .

So, I cut off one letter from the end of ``Jiyouhoushiyori ga kai ni'' and wrote ``Jiyouhou...''
``...gakkai ni'', ``johohou...gakkaini'', ``johohou...gakkaini'', ``johohou...gakkaini''
, . . . , repeat the search for “Jyouhou”.

Then, when "information" is found in the word dictionary 7 as a reading candidate that corresponds to the reading character string "Jiyouhou", 1
The grammar analysis circuit 9 takes out the information of the previous word from the conversion result storage area 11 and checks the grammatical connection between the previous word and the current "information".

In this embodiment, since "information" is the first input character, there is no word corresponding to the previous word.

If the grammatical connection check determines that "connection is possible (OK) J," all information related to the word "information" is stored in the conversion result storage area 11.

At the same time, the beginning of the sentence ``r joho'' is deleted from the reading character string ``johoushi yori kakkai te'' in the ``reading character string storage area 5''. Further, the subsequent word information in the word dictionary 7 on the right side is rA3. A2J (see "Jouho" in word dictionary 7 in Figure 2 above).

Through such processing, state 2 in FIG. 4 is obtained.

Next, the compound word information search circuit 10 searches for word information subsequent to the converted "information".

The subsequent word information of this "information" is rA3. A2゜0'', and there are two connected words: ``process'' and ``search.''

In state 2 of this figure 4, the reading character string on the left side.

``Shiyori Kakkai te'' still remains.

Subsequent words in this string are examined.

The compound word information search circuit 1o searches for subsequent word information rA3. By A2J, the word information of "process" and "search" is taken in as subsequent words and compared with the remaining read character strings. In this case, "shiyori" matches.

Therefore, this word information of "process" is stored in the conversion result storage area 11, and "shiyori" is deleted from the reading character string. Therefore, state 3 in FIG. 4 is reached.

In other words, "Kakakai de" remains in the reading character string on the left, and the subsequent word information of this character string is "A1".
”.

Therefore, when the word dictionary 7 is searched using this subsequent word information "A1", "academic society" is discovered.

When the above processing is completed, the state will be as shown in state 4 in FIG.

[te] remains in the reading character string on the left.

And in the central conversion result storage area 11.

All information of ``johou'', ``shiyori'', and ``katsukai'' is stored.

Note that the subsequent word information for "gakkai" is 0 (no successor), so the subsequent analysis ends.

FIGS. 5(1) and 5(2) are flowcharts showing the flow of processing when converting a reading character string. In the drawings, #11 to #29 indicate steps, and ■ to ■ indicate connections.

In the input device 1 shown in FIG. 1, when there is a conversion request (
(Judgment at step #4 in FIG. 3), the flow shown in FIG. 5 (1) starts.

The conversion processing control circuit 6 that has received the conversion command from the next process determination circuit 2 reads data of the read character string from the read character string storage area 5 in step #11.

For example, in the example shown in FIG. 4 above, as in state 1, the data of the reading character string ``Johoshi yori Kakkai ni'' is imported.

In step #12, it is determined whether there is data for a read character string.

If it is determined in this step #12 that there is no reading character string data, then the third
Return to the connection shown in the diagram and wait for input.

On the other hand, if it is determined in step #12 that there is data of a read character string, the grammar analysis circuit 9 is requested to analyze it in the next step #13.

The grammar analysis circuit 9 that has been requested to perform the analysis requests the dictionary search circuit 8 to search the dictionary corresponding to the current pronunciation.

The dictionary search circuit 8 takes in the current read string from the read string storage area 5 and performs a dictionary search.

In the flow shown in FIG. 5(1), in step #14, it is determined whether or not there is a corresponding candidate kanji.

If it is determined in step #14 that no candidate with the same pronunciation as the read string is found, proceed to step #15, delete the last character of the read string, return to step #128 again, and proceed to step #15 to delete the last character of the read string. Perform another dictionary search for the reading string.

If the judgment in step #14 is that there is a candidate kanji that corresponds to the same reading as the reading character string, proceed to step #16 and retrieve the word information of the previous word as in state 2 in Figure 4. .

In the next step #17, the first grammar analysis circuit 9 checks the grammatical connection between the currently discovered candidate and the previous word.

If the judgment in step #18 is that grammatical connection is not possible,
Proceed to step #15, delete the last character of the read character string, return to step #12, and repeat the same process.

If it is determined in step #18 that grammatical connection is possible, the process advances to the next step #19, and candidate information is stored in the conversion result storage area 11.

In step #2o, the candidate reading is deleted from the reading character string (see state 2 in FIG. 4).

Proceeding to step #21, it is determined whether there are any remaining reading character strings.

If there is no remaining reading character string, proceed from connection ① in Fig. 5 (1) to step #27 in Fig. 5 (2).

The character string display data creation circuit 12 takes out the conversion result data from the conversion result storage area 11, creates display data, and displays it on the display device 13.

The flow returns from connection (2) in FIG. 5(2) to connection (2) in FIG. 3, and enters a state of waiting for input.

On the other hand, if there are any remaining reading character strings as determined in step #21 of FIG. 5 (1), in the next step #22,
Search for subsequent word information.

In step #23, it is determined whether there is any subsequent word information.

If there is no subsequent word information, similarly, Fig. 5 (1)
Proceed to step #27 in Figure 5 (2) from connection ■, but
If there is subsequent word information, the connection ■ to 5 in Figure 5 (1)
Proceeding to step #24 in Figure (2), the actual word information of the subsequent word is fetched.

In step #25, the pronunciation of the subsequent word is compared with the remaining read character string, and in the next step #26, it is determined whether the pronunciation of the subsequent word is included at the beginning of the remaining read character string.

If the pronunciation of the subsequent word is included at the beginning of the remaining pronunciation character string, the process advances to step #28, and the word information of the subsequent word is stored in the conversion result storage area 11.

In step #29, the reading of the subsequent word is deleted from the remaining reading character strings, and the process returns to step #21 again from the connection 2, and the same process is repeated until there are no remaining reading character strings.

These steps #21 to #29 (excluding step #27)
The processing is the processing of states 2 to 4 in FIG. 4 above.

Steps #11 to #29 in Figure 5 (1) and (2) above
Through this process, the required compound words can be quickly converted using the smallest word dictionary.

According to the information processing device of the present invention, it is possible to realize a dictionary that has a large amount of compound word information, has a small memory capacity, and has a short search time. Kana-kanji conversion becomes possible.

Specifically, compared to conventional information processing devices that have a built-in dictionary that stores all compound words.

The effect of reducing the capacity of the dictionary is remarkable.

You can also use a combination of word dictionary and compound word dictionary,
Compared to conventional information processing devices that use a compound word input method that uses a combination of a word dictionary and previous word information, there is no need to search two types of dictionaries, so the search time is shortened.
Since there is no need for two dictionaries to contain the information on read character strings, many excellent effects can be achieved, such as reducing the capacity of the dictionaries accordingly.

[Brief explanation of drawings]

FIG. 1 is a functional block diagram showing an embodiment of the main configuration of an information processing apparatus of the present invention. FIG. 2 is a diagram showing several examples of data in the word dictionary 7. FIG. 3 is a flowchart showing the flow of the main processing at the time of reading input for the information processing device of the present invention. FIG. 4 is a specific example of the procedure of compound word conversion processing by the information processing device of the present invention. Figure 5 (1) and (2) are flowcharts showing the flow of processing when converting reading character strings; Figure 6 is a diagram showing an example of a conventional word dictionary; Figure 7 ( 1
) and (2) are diagrams showing an example of a compound word input method that uses a combination of a conventional word dictionary and a compound word dictionary, where (1) is a word dictionary, (2) is a compound word dictionary, and FIG. (1) and (2)
is a diagram showing an example of a compound word input method that uses a combination of a conventional word dictionary and previous word information; (1) is a word dictionary;
(2) is previous word information. In the drawings, 1 is an input device, 2 is a next process determining circuit, and 3 is an input device.
4 is an editing circuit, 4 is a reading input control circuit, 5 is a reading character string storage area, 6 is a conversion processing control circuit, 7 is a word dictionary, 8 is a dictionary search circuit, 9 is a grammar analysis circuit, and 10 is a compound word information search circuit. , 11 is a conversion result storage area, 12 is a character string display data creation circuit, and 13 is a display device. Word Dictionary Kamizu/Isobori%], 1 Kamizushi (2) (1) Kano (2) (2)

Claims (1)

[Scope of Claims] At least an input means, a display means, a word dictionary, a word information storage means for storing word information consisting of character strings including kanji and kanji corresponding to kana and kana, and the word information storage. an information processing device comprising a kana search means for searching the means using kana as a key, and having a kana-kanji conversion function for converting kana input from the input means into kanji; a subsequent word search means that adds compound word information to possible information as subsequent word information, and searches for a corresponding subsequent word when there is compound word information that follows the word information detected by the kana search means; An information processing device comprising: When converting a subsequent word into Kanji, the subsequent word search means searches for the compound word information and converts the compound word into Kanji.