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

Abstract

PURPOSE:To decrease the time for the 1st conversion candidate display, by performing conversion operation through the replacement of the retrieval with a word dictionary into the retreval with the word dictionary of the 2nd ranking, in depressing the next candidate key. CONSTITUTION:A Kana-Kanji conversion processing is done with an input preprocessing section 1, a word pickup section 2, synonym discriminting section 3, an output control section 4, and a conversion control section 5, and when a Japanese sentence is inputted in Kana, the sentence is outputted as a sentence mixed with Kanji and Kana. In this system, the section 2 has a word dictionary which is stepwise sectioned into a plurality of areas depending on the frequency of usage. In the Kana-Kanji conversion processing, when the next candidate key instructing the next candidate is depressed by the number of the conversion candidates or more, that is, the candidate wanted by the operator is not obtained at the retrieval with the 1st word dictionary, further retrieval is done by using the 2nd word dictionary. In this system, the 2nd and 3rd candidates can be displayed in succesion to the candidate by the word dictionary having the word group of the highest frequency of usage by only depressing the next candidate key one after another.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a kana to kanji conversion processing method in a Japanese word preprocessor, etc., and in particular improves the processing speed of document creation work in a kana to kanji conversion processing method that provides bunsetsu separation information. Processing methods Various methods have been proposed for the processing method of kana-kanji conversion (hereinafter simply referred to as "conversion"). ◎In the conventional conversion method, phrase specification is used.

Although there are differences in word specifications, etc., in general, all possible conversion character strings for an input kana character string are searched and the conversion results are output and displayed. and homophones (hereinafter “
If there is a conversion string (called a homonym), the most likely conversion string is displayed and the operator is asked to select and confirm. If the operator does not intend to use one conversion string, press the next candidate key to select another conversion string. The converted string will be displayed instead. During this process, if the operator finds something that he or she intended, the operator presses a selection key to confirm the converted character string.

However, the above-mentioned method always searches for all possible conversion character strings, so it has the serious disadvantage that the processing time is long, and it takes a long time until conversion candidates are displayed for the first time.

The present invention was made in view of the above circumstances, and its purpose is to eliminate the above-mentioned drawbacks of conventional conversion methods, shorten the time until the first conversion display, and improve usability for the operator. The object of the present invention is to provide a kana-kanji conversion processing method that can improve the processing speed of document creation work.

The purpose of the present invention is to provide a kana-kanji conversion processing method in which an input sentence is broken down into separated units centered on independent words and input as kana characters, and the corresponding kanji-kana-mixed sentences are sequentially obtained. By providing two or more word dictionaries divided by The following candidates are displayed one after another using the Next Candidate Key, and if the character string that the operator intends is not found among the runner-up candidates, by further pressing the Next Candidate Key, the next candidate word dictionary is displayed. This is achieved by using a kana-kanji conversion processing method that is characterized by switching to a search using , and then performing all conversion operations again.

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

FIG. 1 is a block diagram of kana-kanji conversion processing according to an embodiment of the present invention. In the figure, 1 is an input preprocessing unit, 2
ti word extraction section, 3 a homophone discrimination section, 4 company output control section, and 6 a conversion control section.

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

The input preprocessing unit 1 processes alphanumeric characters and phrase breaks in the input kana sentence.
Recognizes information etc. and extracts the kana character string to be converted,
Extract words under the control of the conversion control unit 5! Pass the kana character string that will be the conversion unit to 2. Two word extraction units The homophone discrimination unit 3 attempts to match the word string with the dictionary entry and extracts grammatically permissible word string candidates. Determine the most likely word string using information such as information. The output control unit 4 displays the corresponding characters of the clause determined as described above on the output 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 in place of the most likely candidate that was initially displayed.

The word extraction section 2, which is the main point of the present invention, will be explained below.

The word extraction unit has a word dictionary that is divided into stages according to the frequency of use as shown below, and extracts word strings by comparing them with input kana character strings.

(1) ■ Provisional words for independent words registered by users ■ Important words for independent words that appear frequently (1) Other independent words Here, ■ and ■ in (■) are words that are considered to be used frequently. (Brave is a word that is necessary but not used very often.

The word dictionaries having each of the above groups can be used individually, or in combination as appropriate.

In the kana-kanji conversion process of this embodiment, the next candidate key for instructing the next candidate for the excerpt (1) by the control key input to the input preprocessing unit shown in FIG. When the number of conversion candidates obtained by searching within the so-called first conversion candidate search range using the word dictionary having words of each group is If the operator does not find the desired candidate in the search using the word dictionary containing the word, the conversion candidate search range is switched to the word dictionary containing the word belonging to the phantom category, and further search is carried out.

In addition, the word dictionaries having words in groups ``■'' and ``■'' in (I) are used step by step, and a search operation is first performed using only the word dictionary having words belonging to group ``■'' in (1). If this is unsuccessful, a search is performed using the word dictionary containing words belonging to (D).1 If this is also unsuccessful, the search range is changed to It is also possible to extend the search to a dictionary.Furthermore, the above method may be combined with a search operation using a so-called longest match method and a matching method switching using a search operation using a brute force method. In the case of extraction using the longest match method, once an independent word of a certain length is matched, among the conversion candidates extracted from that clause, there are conversions whose constituent elements are shorter independent words than the independent word. Although character strings are not given, extraction by brute force method will not omit them.

In the conversion processing method of the above embodiment, by simply pressing the next candidate key one after another, the second and third most frequently used words are Since the conversion candidates obtained by searching the word dictionary are automatically displayed, the operator does not feel burdened. It goes without saying that turtles are limited to inventions.

As described above, according to the present invention, an input sentence is broken down into division units centered on independent words, input as kana characters, and corresponding sentences containing kanji and kana are successively obtained. 2, categorized by frequency of use.
If more than one word dictionary is provided, and the converted character string output and displayed as the most likely conversion candidate in the search using the first word dictionary is a character string that is not intended by the operator, the next candidate is selected as the next candidate key. If the character string intended by the operator is not found among the runner-up candidates, by pressing the next candidate key, the search is switched to the next word dictionary and the conversion operation is performed again. As a result, we have developed a kana-kanji conversion processing method that can shorten the time until the first henenryo hakama is displayed, improve usability for the operator, and increase the processing speed of document creation work. When realized, it will have a significant effect.

[Brief explanation of the drawing]

FIG. 1 is a pull diagram of kana-kanji conversion processing which is an embodiment of the present invention. 1: Input pre-processing unit, 2: Word extraction unit, 3 = Homophone discrimination unit, 4 = Output control unit, 5: Conversion control unit. se luck

Claims (1)

[Claims] In the kana-kanji conversion processing method, an input sentence is broken down into division units centered on self-contained candy and input as kana characters, and the corresponding sentences containing kanji and kana are sequentially obtained. A word dictionary is provided, and when the converted character string output and displayed as the most likely conversion candidate in the search using the first word dictionary is a character string not intended by the operator, the runner-up candidate is selected as the second candidate. In addition to outputting and displaying in the next layer, if the character string intended by the operator is not among the runner-up candidates, by pressing the next candidate key again, the search is switched to the next word dictionary and the search is performed again. A kana-kanji conversion processing method characterized by performing conversion operations.