JPS60136864A - Extracting method of word - Google Patents

Abstract

PURPOSE:To extract a specific word without accessing a dictionary by detecting the initial character of extracted words and setting up a prescribed register when an honorific word ''O'' or ''GO'' is arranged on the head of the input characters. CONSTITUTION:The input characters are stored in an input character string temporary storage part 2. A ''kanji'' (Chinese character) phonetic processing part 3 detects whether segmenting section for enabling the word extracting operation is to be executed or not on the basis of a ''kanji'' phonetic table storage part 5. A character to be retrieved string forming part 4 sets up several characters started from an analysis starting position in a previously prepared buffer to segment characters at a ''kanji'' phonetic level. At the execution of the word extracting operation, that an honorific word exists in the head of the segmented characters is set up in a register in a specific word processing part 6 by using matching processing for the specific word to recognize the honorific word. The succeeding word is extracted and its characters are retrieved from a word dictionary 8 by a dictionary retrieval part 7.

Description

[Detailed Description of the Invention] Technical Field The present invention relates to a word extraction method in a Japanese word processor, etc., and in particular, introduces a pre-kanji concept into the word extraction process and sets the search string to the minimum necessary when searching in a dictionary. This invention relates to a word extraction method that can reduce erroneous analysis and improve dictionary search speed by not extracting unnecessary candidates.

Prior Art In conventional kana-kanji conversion processing methods, the algorithm for extracting words from input kana character strings is generally 1.
It was something like this:

(1) Setting the analysis start position for a character string Except for special cases, general numbers first set the first character (first character) of a character string as the start position for analysis, and then use that position as the first character. Once the word has been successfully extracted, the first character of the character string after word extraction is then set as the starting position for a new analysis.

(Example) Input string i! \Iseki by Tanto ~ ↑: Initial analysis start position Here, if the extraction of "Kaiseki (analysis)" is successful, the result will be as follows.

↑: Next analysis start position (2) Creating a search string for dictionary search Assuming that the maximum reading length in the dictionary is 6 characters, in the example sentence above, The following string to be searched is set.

a) Cutting out the first word ■Kaisekiyo■Kaisekini■Kaiseki■Kaise■kai■or b) r analysis” Word extraction after successful extraction Part (3) Extraction of candidates by determining the matching between the set character string to be searched and the index character string in the dictionary In the case of the above example, the process is as follows.

■Unable to extract candidate i by "Kaisekiyo" ■Cannot extract candidates by "Kaiseki Ban;" ■Extract "Kaiseki", [Analysis], and "Kaiseki" by "Kaiseki" ■ Extract ′ candidate by "Kaise" Not possible ■ Extracts “kai”, “kai J, r kai”, [kai], etc. with “kai” ■ Extracts “oka”, “ka”, “mosquito J, r@J, etc.” with “ka” (4) (3)
Various evaluations are performed on the candidate group extracted in , and the candidate considered to be the most appropriate is determined.

However, the word extraction method described above may extract an extremely large number of candidate groups depending on the input character string.
There was a problem that it caused erroneous analysis and slowed down dictionary search speed. In addition, the often used polite words [o], ``
Another problem is that it is difficult to prevent word extraction errors caused by erroneous recognition of words such as "go".

Purpose The present invention has been made in view of the above circumstances, and its purpose is to solve the above-mentioned problems in conventional word extraction methods, reduce erroneous analysis, and improve the speed of dictionary searches. The purpose of this invention is to provide a word extraction method that makes it possible.

Configuration The configuration of the present invention will be explained in detail below based on examples.

Fig. 1 is a block diagram showing an overview of a kana-kanji conversion/processing device that is an embodiment of the present invention, and Fig. 2 shows a part of the inside of the kanji-on table, which is the main part. .

In FIG. 1, l is a keyboard input section, 2 is an input character string temporary storage section, 3 is a kanji sound processing section, 4 is a searched string creation section, 5 is a kanji sound table storage section, and 6 is a special word processing section. ,
Reference numeral 7 indicates a dictionary search section, and reference numeral 8 indicates a word dictionary. Note that FIG. 2 merely shows an example of a kanji sound table, and the present invention should not be limited to this.

The kanji sound processing unit 3 has a classification module for classifying processing results according to conditions described later and a register for holding the classification results. below.

This register is called rTYPEJ. Further, the special word processing unit 6 performs matching processing with predetermined special words, which are the contents of a special word table to be described later. Note that the word cut out (extracted) in the searched character string creation unit 4 is the so-called polite word "o".

Prepare a register that will set [1] if it is "go". From now on, this register will be referred to as rTE T NE TJ
It is called.

The operation of this embodiment will be explained below. In order to explain the general operation of the searched character string creation unit 4, the following example sentence (according to the analysis result) will be used.

The searched character string creation section 4 sets six characters starting from the analysis start position, which was set at the same time as the conventional method, in a buffer prepared in advance (see FIG. 3). This buffer only needs to be able to set six characters one-dimensionally, and hereinafter this buffer will be referred to as "WINDOWJ".

Next, a matching process is performed between the character string in the above WINDOW and each element of the kanji front table shown in FIG.
A method that delimits the string in INDOW at the element level before the kanji and expresses the result concretely.
Set it in a buffer prepared in advance. Here, W.I.
A buffer called NDOW2 is prepared that has the representation of an array of size 6 in the - dimension.

Of course, FIG. 4 shows an example of the delimiters applied to the character strings in WINDOW and the contents of WINDOW2. W.I.
The arrow attached to NDOW indicates a break at the Kanji sound level, and the number that is the content of WINDOW2 indicates that the Kanji front corresponding to the number of characters exists in the Kanji front table.

For the example sentence above, WINDOW2 (1) = 2 (corresponds to "rkai") WI
NDOW2 (2) = 2 (corresponding to r cough) WIND
OW2 (3) = 1 (corresponds to "r") WINDOW2
(4) = 1 (corresponds to rke) WINDOW2 (5)
=0 WINDOW2(6)=0.

The results of the above processing are classified according to the following conditions.

(1) WINDOW2(1)≧2, and WINDOW2
(2) If ≧2, set TYPE to [1].

(2) WINDOW2(1)≧2. AND WINDOW2
If (2)=1(7), set TYPE to [2].

(3) WINDOW2 (1) = 1 and WINDOW
If 2(2)≧2, set “3” to TYPE.

(4) In cases other than the above categories (1) to (3), enter “TYPE”.
4”.

As a result of the above processing, the value force 1 "3" set in TYPE
Or only in the case of [4], the word extraction operation of the present invention is executed.

FIG. 5 shows an outline of the processing blow of this embodiment.

The operation of this embodiment will be described below with reference to FIG.

As a result of classification based on kanji sound processing, the value of TYPE is "3"
or if it is "4", the register rTE
Refer to INE IJ and check the value set to 6. If this value is [1], the WINDOW
The first character of ``o'' or ``go'' is recognized as a polite word, and the process moves on to extracting the next word.

In Figure 6 About Goseiei~ (About Gosei~) This shows the case where the analysis is performed.

In this example, TYPE=3 and the first word is "
Since it is ``go,'' it recognizes this as a polite word and moves on to the next sentence, ``go'' and ~.

As a result of the above-described processing, V) so-called polite words "o" and "go" in the example sentence can be appropriately extracted without accessing a dictionary.

Thereafter, a dictionary search is performed in the same way as in the past using the searched character string created by the above-described processing.

In each of the above embodiments, WINDOW is a buffer having a size of six characters, but this is not necessarily limited to six characters. Furthermore, instead of a buffer such as the above-mentioned WINDOW, a buffer for setting an input character string, a plurality of pointers indicating positions in the buffer, and a register capable of sectoring the values of the pointers may be provided.

Effects As described above, according to the present invention, when there is a polite word ", o" or "go" at the beginning of an input character string, the special word is processed without accessing a dictionary by special word processing. This has the remarkable effect of speeding up the extraction of words containing kanji.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention, FIG. 2 is a diagram showing part of the contents of the kanji pre-table, FIG. 3 is a diagram showing an example of the contents of the input character string buffer, and FIG. Figure 5 is a flowchart of the process, and Figure 6 is a diagram showing a specific example of processing. 1: Keyboard input section, 2: Input character string temporary storage section, 3
: Kanji sound processing unit, 4: Searched character string creation unit. 5: Kanji pre-table storage unit, 6: Special word processing unit. 7=Dictionary search section, 8: Word dictionary. Figure 1 Figure 6 ↓ TYPE = 3 Procedural amendment (method) % formula % 2. Title of invention Word extraction method 3. Relationship with the case of the person making the amendment 4 agents for the patent applicant

Claims (1)

[Claims] (1) word dictionary storage means for storing a plurality of words in correspondence with character strings representing their pronunciations; means for temporarily storing input kana character strings; In the kana-kanji conversion processing device, the kana-kanji conversion processing device has table storage means in which kanji fronts having two or more pronunciations are registered. means for separating the input kana character string using the kanji mae; means for morphologically classifying the processing result by the separation means; and the first word of the input kana character string is r-o" or [go" A word extraction method is provided with a means for recognizing a word, and extracts polite words "o" and "go" based on the classification result by the classification means.