JPS6275761A - Character string processor - Google Patents

Abstract

PURPOSE:To reduce the capacity of a dictionary by registering the first kind of notation and a flag of three bits on the dictionary and generating and displaying the notations of three kinds of OKURI-KANAs (KANA added to a Chinese character to show its Japanese declension) to make unnecessary the registration of all three kinds of the notations on the dictionary. CONSTITUTION:On the dictionary, for example, only the reading of 'uketsuke' (displayed by Japanese syllabary) and the notation of 'U ke TSU ke' (displayed by Japanese syllabary and Chinese caracter) (acceptance) are registered, and other OKURI- KANAs are displayed by the flag of three bits. When all of three bits 0-2 are '1's, the OKURI-KANAs 'uke-tsu-ke', 'uke-tsu-ke' and 'uke-tsuke' are displayed as the candidates of the three kinds of OKURI-KANAs and when the bit '0' is '0' and the bits 1 and 2 are 1s, the OKURI-KANAs 'uke-tsu-ke' and 'uke-tsuke' are displayed as the candidates. When the reading is inputted from an input device 2 and an inputting by a conversion key is detected at a conversion key detecting part 8, a dictionary readout part 10 performs the retrieval of a KANJI (Japanese syllabary) corresponding to an inputted read data from a dictionary 12 and a OKURI-KANA processing part 14 generates one or plural OKURI-KANAs and a display memory 20 stores an input data from an input data output part 18 and the data from a candidate output part 16, sending them to a display device 24.

Description

DETAILED DESCRIPTION OF THE INVENTION Technical Field The present invention relates to a character string processing device, particularly a character string processing device for converting an input character string into a corresponding character string, such as a word processor with memory, a typewriter with memory, an office computer, a translation machine, etc. This invention relates to a character string processing device that derives and outputs character strings.

In the conventional technology, for example, the ``kana-kanji conversion'' method is widely adopted in Japanese word processors.

There is a method of generating a converted string from an input string in units of words or units of phrases. There may be multiple types of kanji/kana mixed character strings corresponding to the input reading character string, depending on how the okurikana is added. For example, as an input string "
When you input ``uketsuke'' and convert it to kana-kanji, there are ``reception,''``reception,'' and ``ukewa tsuke'' as candidates for character strings containing kanji and kana.In Japanese, okuri-kana is either added or not. I often use different things.

In the past, it was safe to register all of the candidates for character strings containing a plurality of kanji and kana characters based on different okurikana characters in a dictionary stored in internal memory or external memory.

Therefore, there is a drawback that the dictionary has a large capacity.

the purpose The present invention overcomes these drawbacks of the prior art.

It is an object of the present invention to provide a character string processing device that can select and display a plurality of converted character strings without having a large-capacity dictionary.

Configuration In order to achieve the above object, the present invention includes an input means for inputting a first character string and an instruction, and a plurality of candidates for a second character string corresponding to the first character string input from the input means. In a character string processing device having a storage means for storing and a candidate search means for retrieving a candidate to be displayed from a plurality of candidates for a second character string, the storage means stores one notation for the second character string. and data instructing candidates to be retrieved, and the candidate retrieval means reads one notation and data stored in the storage means to retrieve candidates to be displayed. This is what I did. Hereinafter, a detailed explanation will be given based on one embodiment of the present invention.

Referring to FIG. 1, an embodiment in which the present invention is applied to a kana-kanji conversion processing device is shown in a conceptual functional block diagram.

As shown in the figure, this embodiment has an input device 2 such as a keyboard. In this embodiment, the input device 2 includes character keys for inputting kana characters and conversion keys for instructing display of candidate kanji obtained as a result of kana-kanji conversion.

The device also has a display 24, which can be displayed, for example by C.
An RT character display device may be used, and the reading character string input to the tree system, the character string resulting from the kana-kanji conversion, the candidate kanji, etc. are visually displayed.

The device also has a dictionary 12, which is a file storage device in which conversion dictionary data to be indexed during kana-kanji conversion is stored, such as an internal memory such as RAM or ROM, a fixed disk, or a floppy disk. Elements other than those shown in FIG. 1, which may use external storage such as a disk, are advantageously implemented by a processing system, such as a microprocessor, and are shown in blocks according to their functions in the figure.

From the input device 2, a reading input generated in response to the scanning of the reading character key is inputted, and an instruction using a conversion key for instructing kana-kanji conversion is inputted. These inputs are
The key is sent to the input data buffer 6 through the manual input section 4. The conversion key detection unit 8 detects whether or not there is an instruction for kana-kanji conversion using a conversion key in the input from the input data puff 7B, and if there is an instruction, the dictionary reading unit lO
reads data from the dictionary 12, and causes the input data output section 18 to output the input data if there is no instruction.

When the conversion key detection unit 8 detects a kana-kanji conversion instruction, the dictionary reading unit 10 generates an internal address, that is, a physical address, of the dictionary 12 from the read data from the input data buffer 6, and inputs it into the dictionary 12. It requests the search for the kanji corresponding to the reading data.

In the dictionary 12, a flag is registered at the storage location of each address to display one notation and the other notation of a plurality of candidates for kanji and okurikana corresponding to the reading.

For example, for the reading ``uketsuke,'' there are three types of okurikana: ``ukewatsuke,''``reception,'' and ``reception.'' However, as shown in Figure 2, the dictionary 12 has the reading ``uketsuke,'' and the above. Of the three types, the notation “Ukeha Tsuke”,
For example, 3-bit flags, part-of-speech information, and other information are registered. In other words, the dictionary 12 has the above 3! ! Rather than registering all okurikana of the same type, in this embodiment, only the one with the most okurigana is registered, and other okurikana are indicated by 3-bit flags.

The flags are displayed as shown in Table 1, for example.

Table 1 When the 3-bit flag bito~2 are all O, it is displayed as shown. In other words, it is displayed as "Uke wa Tsuke". When bitO of the 3-bit flag is 1, all okurikana are added as shown, that is, "Uke wa Tsuke" is displayed. When bitl is 1, all okurigana between kanji characters are removed, that is, "reception" is displayed. When bit 2 is 1, all okurikana characters are removed, that is, "reception" is displayed.

Therefore, it is displayed as shown in Table 2.

Table 2 When bits O to 2 are all 1, all of the three types of okurikana described above are displayed as candidates. In other words, "Reception", "Reception", and "Reception" are displayed. Also, bi
When t O is 0 and bits 1 and 2 are 1, the candidates are displayed with Okorigana between Kanji characters and all the Okurigana.

That is, "f reception" and "reception" are displayed as candidates.

The okurikana processing section 14 performs okurikana processing to create one or more okurikana from one notation retrieved from the dictionary 12 and the 3-bit flag, and sends them to the candidate output section 16. The candidate output section 16 sends the okuri kana candidates sent from the okukana processing section 14 to the display memory 20 . The display memory 20 stores input data from the input data output section 18 and data from the candidate output section 16, and sends the data to the display device 24 through the 1 display circuit 22.

Explain the operation.

The reading is input from the input device 2. For example, "uketsuke" is input. This input is sent from the key input input unit 4 to the input data buffer B. The input data from the input data buffer B is detected by the conversion key detection unit 8 as to whether or not there is an input using the conversion key, and if there is no input using the conversion key, the input data is input as "receive".
is sent to the input data output section 18. Input data output i1B
The input data "receipt" sent to is stored in the display memory 20.

When the conversion key detection unit 8 detects that there is an input using the conversion key, the input data is sent to the dictionary reading unit 10, and the dictionary reading unit 10 retrieves the kanji corresponding to the reading data input from the dictionary 12. As mentioned above, one type of notation and 3-bit flag information are read from the dictionary 12. In this example, the notation ``acceptance'' and 3-bit flag information are read out. The 3-bit flag indicates, for example, information indicating the most recently used okurikana.

1 read out from the dictionary 12 by the dictionary reading unit lO
The notation of the type and the 3-bit flag are shown in the okurikana processing section 1.
4, and is sent to the display device 24 in the sending kana processing section 14.
A display of the okurigana to be displayed is created. This okurikana processing will be explained with reference to the flowchart shown in FIG.

It is necessary to detect whether or not all three bits (bits 0 to 2) of the flag are 0 (100), and if they are all 0, the display is as written, that is, "acceptance is accepted" as a candidate and sent to the candidate output unit 1B. Output (114) ends the sending kana processing. If there is something that is not 0 in 3 bits) bit O ~ 2, judge whether the first bit bit O is 1 or not, and if it is 1, add all the okurikana as shown, In other words, the display "Reception is accepted" is output as a candidate to the candidate output unit 16 (104).
If not, do nothing and proceed to step 106.

Next, judge whether the second bitl is 1 or not (10B). If it is 1, select the display that removes all the kana between the kanji characters, that is, "reception", and output it to the candidate output section lθ. Output (10B). If it is not 1, do nothing and proceed to step 110. Next, determine whether the third bit bH2 is 1 (110).
When the value is 1, the entire okuri kana, that is, the display of "reception" is output as a candidate to the candidate output unit 16 (112); when it is not 1, nothing is done and the okuri kana processing is ended.

In this way, candidates for displaying okurigana are created from one notation registered in the dictionary 12. ”, then this “
"Reception" is output to the candidate output unit 1B. The candidate output unit 16 sends this display to the display memory 20. The display circuit 22 outputs the reading input data stored in the display memory 20, that is, a display of "uketsuke" and a display of okuri kana candidates (for example, "reception"). One or both of the displays are sent to the display device 24, and the display device 24 stores the display memory 2.
The data sent from 0 is displayed.

In addition, when displaying all of the candidate okurikana in the area (not shown) for displaying kanji candidates on the display device 24, N number of okurikana candidates are displayed as indicated by #. For example, three types of candidates such as "reception", "reception", and "reception" are displayed by setting all of bits O to 2 of the three vias to 0. If there are only two types of kanji, for example, bits O and 1 may be set to 1, and bit 2 may be set to 0 to display the two types of okrigana.

According to this embodiment, dictionary! 2, register the iM type notation and 3-bit flag, and create and display three types of okurikana notations from this. Therefore, compared to the conventional method in which all three types of notations are registered in the dictionary 12,
The capacity of 2 can be reduced. In addition, necessary okurigana candidates can be selected, created, and displayed using flags.

Effects According to the present invention, when there are multiple okuri kana candidates, by registering one of them and a flag in the dictionary, it is possible to select and create the required okurikana candidate. Dictionary capacity can be reduced.

[Brief explanation of drawings]

Fig. i1 is a functional block diagram conceptually showing an embodiment in which the present invention is applied to a kanji-kana conversion processing device, Fig. 2 is a diagram showing an example of contents registered in the dictionary of Fig. 1, and Fig. 3 2 is a flowchart showing the flow of processing of okurikana by the apparatus shown in FIG. 1. FIG. Explanation of the symbols of main parts) 200. Input device 890. Conversion key detection unit 10. ,,Dictionary reading unit 12, ,Dictionary+4. ,, Kana processing unit 1B, candidate output unit 24, display device

Claims (1)

[Claims] 1. An input means for inputting a first character string and an instruction; a storage means for storing second character string candidates corresponding to the first character string; and candidate retrieval means for reading out candidates for a second character string corresponding to the first character string from the storage means, wherein the storage means reads one representation of the second character string. and data instructing candidates to be retrieved;
1. A character string processing device, comprising candidate processing means for creating candidates to be displayed from the two notations and the data. 2. In the device according to claim 1, the first character string is a kana, the instruction is an instruction for converting kana to kanji, and the second character string is a kana character string, and the second character string is a kana character string. A character string processing device characterized in that the character string is a character string. 3. In the device according to claim 2, one representation of the second character string stored in the storage means is a character string with the most okurikana characters, and the data is a 3-bit flag. A character string processing device characterized by: 4. The character string processing device according to claim 3, wherein the flag indicates a character string used most recently among the candidates for the second character string. 5. The character string processing device according to claim 3, wherein the flag indicates a plurality of character strings among the candidates for the second character string.