JPS58159133A - Kana (japanese syllabary)-to-kanji (chinese character) conversion processing system - Google Patents

Abstract

PURPOSE:To facilitate the processing of KANA-KANJI conversion, by changing the paragraph in accordance with the atribute for a Chinese character processing system in which an input sentence is decmposed into paragraphs centering on independent words and supplying them in the form of a KANA sentence and then by selecting the paragraph an operator desires. CONSTITUTION:An input sentence is decomposed into paragrahs centering on independent words by means of a control key and then supplied in the form of a KANA sentence. Then the information on English letter and numeric character paragraphs, etc. are recognized at an input preprocessing part 1, and then a KANA letter string to be converted is extracted to be sent to a word extracting part 2. Here the candidates of word strings which can be grammatically allowed are extracted with retrieval of a dictionary. While a homophone discriminating part 3 decides the most prominent candidate among word string candidates. An output control part 4 displays the corresponding characters for each paragraph. If the result of display is opposed to the desire of an operator, the decomposing method of paragraph is changed through the part 1. Then the extraction 2 of words and discrimination 3 of homophones for output control 4. As a result, the KANA-Chinese character conversion processing is facilitated.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a kana-kanji conversion processing method in a Japanese word processor, etc., and in particular to a kana-kanji conversion processing method that can improve the processing speed of document creation work in a kana-kanji conversion processing method that provides bunsetsu separation information. Regarding the Ru method.

Various methods have been proposed in the past regarding kanabakuji yukan (hereinafter also simply referred to as "conversion") processing methods. Conventional conversion methods generally search for all possible conversion character strings for an input kana character string and output and display the conversion results, even though there are differences in phrase designation, word designation, etc. And homophone candy (hereinafter referred to as ``homophone candy'').

), display the converted string from the most likely candidates.
(If you ask the operator to select and wih, and if it is an unintended conversion character string of 2 berators, press the next candidate key, and another conversion character string will be displayed instead. If there is one, the operator presses the selection key to confirm the converted character string.

In the conventional conversion method, if an input character string is converted with a certain conversion attribute, and if the output is not what the operator intended, that part is deleted and the input string is input again. I was trying to convert 0 with different conversion attributes. However, since this places too much of a burden on the operator, a method has also been proposed in which a cancel key is provided and the previous operation can be canceled by pressing the cancel key.

It is an object of the present invention to further improve this and provide a kana-kanji conversion method that can more easily change the conversion attributes as described above and reduce the burden on the operator.

The above-mentioned object of the present invention is to provide a kana-kanji conversion processing method in which an input sentence is broken down into division units centered on independent words and input as kana characters, and corresponding sentences containing kanji and kana are sequentially obtained. By providing multiple replacement keys that can specify different conversion methods depending on the attribute, when the conversion string that the operator intends is not among the conversion candidates output and displayed by the operator's first conversion key operation, other conversion strings can be used. This is achieved by a kana-kanji conversion processing method characterized in that an input character string is reconverted using a replacement method different from the original one by operating a conversion key having an attribute.

Embodiments of the present invention will be described in detail below with reference to the drawings.

FIG. 111 is a diagram of kana-kanji conversion processing according to an embodiment of the present invention. In the figure, 1 is an input preprocessing unit, 2
Reference numeral 8 indicates a single extraction section, 8 indicates a homophone discrimination section, numeral 6 indicates an output control section, and 6 indicates a conversion control section.

When a Japanese sentence is input as 4 sentences, it is output as a kanji mixed sentence through the following processing.

The input preprocessing unit 1 extracts a kana character string to be replaced by examining alphanumeric characters, bunsetsu delimiter information, etc. in the input flight number sentence,
Under the control of the conversion control section 6, four flight name character strings, which are conversion units, are passed to the word extraction section 2. The word extraction unit 2 extracts the kana character string from the kana character string by referring to a single dictionary with kana as the heading and a dictionary containing part-of-speech information of ■ added to the Mongolian word dictionary, connection information of the tone shoulder, etc. It attempts to match the sound string with the dictionary entry and extracts grammatically acceptable word string candidates. Hoson 1111111113 determines the most likely single string using the frequency information of the words, etc. when the candidates for the single string are present multiple times. The output control unit 4 displays the characters corresponding to the clause determined as described above on the appearance display device. Thereafter, when the input preprocessing section 1 receives a control signal instructing the next candidate for the control key, the second candidate is displayed instead of the most likely candidate that was initially displayed.

As shown in FIG. 2, the word extraction section 2 includes two clause unit kana character string storage sections, a word extraction control section 2's s candidate word storage section 20, a dictionary search control section 2D, and a replacement dictionary storage section 2m.
I'm afraid of this. Clause-based kana character string storage unit The two receive the clause-based character string signal and send it to the word extraction control unit 2B, which breaks it down into words and sends it to the conversion dictionary storage unit through the dictionary search control unit 2D. Check with the contents stored in 2m. The conversion candidates found through this process are stored in the candidate word storage section 20.

In the device of this embodiment, in addition to the control keys for selecting the next choice, there are also conversion keys according to the attributes of the words contained in the input phrase, as shown in the following example.

■Conversion key: Enter a kana character string and press this key.
The conversion system searches a single dictionary containing common words corresponding to the input kana string.

■Proper noun conversion key: When you enter a kana character string and press this key, the dictionary will search for words that include proper names.

(5) User dictionary conversion key When you input the Nikana character Ryo and press this key, the word dictionary containing the user registered words is searched.

(4) Technical term dictionary conversion key: When a kana character string is input and this key is pressed, the text in the word dictionary containing the specified technical term by user or field is displayed.

(5) No conversion key: When a kana character string is input and this key is pressed, the input kana character string is output and displayed as is without being replaced.

Further, for example, an input character string buffer area is provided in the input preprocessing section 1, and a kana character string inputted before the control key is pressed is stored here. This string remains unchanged even after the conversion corresponding to each conversion key is performed until the next string is input.

Below, the kana-kanji conversion process of this embodiment is shown in Figure 3.
0-Explain according to the chart.

First, select a key. Normally, a character key is selected and the kana character string of the phrase to be converted is manually entered.

The input string is stored in the input string buffer.

Next, perform key selection again. In this case, the key selection is to use the "conversion key" if the input character string is a general word, or 1 to select the "proper name conversion key" if the input character string is clearly a proper noun. ” is selected at the discretion of the operator. This has the effect of significantly improving the rate of correct conversion (conversion rate).

In this case, even if the operator makes a mistake in judgment, he can easily move on to another conversion operation by pressing the correct conversion key again after he has finished searching with the first selection key. . Furthermore, if the operator does not know which conversion key to select, he or she may operate to expand the search range sequentially from general to special keys.

In the search in the word dictionary using each of the above conversion keys, -, this may be performed in two stages, for example, a search using a so-called longest match method and a search using a brute force method. Thereby, the time required to output the first conversion candidate can be further shortened.

The conversion key is shown in the above embodiment. It goes without saying that conversion keys for further subdivided attributes can also be provided.

As described above, according to the present invention, in the kana-kanji conversion processing method, an input sentence is broken down into division units centered on independent words, manually inputted using kana characters, and corresponding sentences containing kanji and kana are sequentially obtained. , multiple conversion keys that can specify different conversion methods depending on the attributes of the input clause are provided, and the conversion string intended by the operator is not found among the conversion candidates output and displayed by the operator's first conversion key operation. By operating a conversion key with other attributes, the input character string is reconverted using a conversion method different from the original one, which not only improves the conversion rate but also prevents the operator from making a mistake in the operation. Even in the case of a certain situation, it is possible to switch to the correct conversion operation with a simple operation, and this has the advantageous effect of realizing a highly effective kana-kanji conversion processing method.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a kana-kanji conversion process according to an embodiment of the present invention, FIG. 2 is a diagram showing details of a word extraction section, and FIG. 3 is a 70-chart of the process. 1: Input preprocessing unit, 2: Word extraction unit, 2M: Clause unit kana character string storage unit, 2B = Word extraction storage unit, 20 candidate word storage unit, 2D = Dictionary search storage unit, 2: Conversion dictionary Storage unit, 3: Homophone discrimination unit, 42 output control unit, 5: Conversion control unit. Patent applicant Riko Kinsha Co., Ltd. Patent attorney Miyabi Tsubomura -, SE
1

Claims (1)

[Claims] In the kana-kanji conversion processing method, the input sentence is broken down into separated units centered on independent words and input as kana characters, and the corresponding sentences containing kanji and kana are sequentially obtained. Different conversions are performed depending on the attributes of the input clause. By setting up multiple conversion keys that can specify methods, when the conversion string that the operator intends is not found among the conversion candidates output and displayed by the operator's first conversion key operation, a conversion key with other attributes can be used. A kana-kanji conversion processing method characterized by re-converting an input character string using a conversion method different from the original one.