JP3443239B2 - Character processor - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a computer device for processing Japanese, such as a Japanese word processor, a portable information terminal, etc., for converting Kana to Kanji.

[0002]

2. Description of the Related Art In a character processing device for processing Japanese, generally, a method of inputting a kana character string from an input device such as a keyboard, performing kana-kanji conversion processing, and converting to a kana-kanji mixed character string is known. It is taken. In the kana-kanji conversion process, when there is a kana-kanji conversion request, the system compares the input kana character string with the headword of the kana-kanji conversion dictionary prepared in advance, and outputs the notation of the headword. .

When creating a document, the same kanji or a mixture of kanji and kana characters often appears in one document. For this reason, for words having the same notation, the most recently used word is often used as the first candidate.

For example, if "Kouka" is input and converted, it is stored in the dictionary in the order of "expensive", "effect", "fall", and "coin", and once "effect" is adopted as a candidate ( In the case of (decided), when "conversion" is input next and a conversion instruction is given, "effect" is output as the first candidate.

Further, in Japanese Patent Laid-Open No. 59-100914, when converting a character string containing kanji or kanji and kana characters, the first character of the input character string and the conversion result are stored in association with each other, and only the first character is stored. There is disclosed a technique of outputting a conversion result corresponding to the stored first character when the input is input.

[0006] For example, "Tokkyo" is input to enter "patent".
When the confirmation operation is performed by converting to, the leading character “to” of the entry word and the confirmation candidate “patent” are stored in association with each other like “to: patent”. Then, when "to" is input next and a conversion instruction is given, the stored "to: patent" is read and "patent" is output as a candidate.

[0007]

DISCLOSURE OF THE INVENTION Problems to be Solved by the Invention
According to the technique of Japanese Patent Laid-Open No. 100941, the leading one character of the kana heading, which is the reading of the candidate, is stored in association with the candidate, thereby facilitating the input operation.

However, in this case, for example, symbols other than the kana are not targeted. Since candidates are basically managed for each bunsetsu, there is a problem that even if symbols and kana-kanji character strings are mixed, they are not recognized as one bunsetsu.

Further, since symbols such as parentheses are often accompanied by the same character strings, such as "(problem 1)", "(problem 2)", etc., such a character string is repeated many times. It is very wasteful to enter and convert all. In many cases, like the previous example, subsequent numbers are added and output sequentially. Therefore, in the present invention, the user's operation is facilitated when re-inputting the character string with a symbol.

[0010]

According to the onset bright SUMMARY OF THE INVENTION, input means for inputting a string of kana and symbols, corresponding notation consisting of headword and kana and kanji string of kana string A character processing device comprising stored kana-kanji conversion data, kana-kanji conversion means for converting a character string input from the input means into a kana-kanji mixed character string, and display means for displaying various character strings. in, the kana-kanji conversion by the kana-kanji conversion unit, when the character string input from said input means is enclosed in a pair of symbols, which is converted by the pseudonym kanji conversion, including the pair of symbol characters a symbol character string storage means for storing the string to a character string storage buffer with symbol, symbols of input from said input means
Input from the input means when a conversion instruction is given.
Stored symbols and stored in the symbol-added character string storage buffer.
String that contains the entered symbol by comparing
Converting means for outputting to the output means as a conversion candidate
The above problem is solved by providing

[0011] According to the present onset bright, consisting of kana and symbols character
Input means to input columns and entry words consisting of kana character strings
Correspond and memorize the notation consisting of mixed kana and kana character strings
Input Kana-Kanji conversion data and the input means
Kana to convert the converted character string to a mixed Kana character
A character conversion means and a display means for displaying various character strings are provided.
In character processing apparatus was example, search a document reading means for reading a document, a character string enclosed by a pair of symbols in the document read by the document reading unit
And, pre-SL and symbolic character string storage means for storing a character string to a character string storage buffer with symbols including a pair of symbols, said input means
When a symbol is input from the
The symbol input from the force means and the character string storage bar with the symbol.
The character string stored in the
Output a character string containing a symbol to the output means as a conversion candidate
And a symbol converting means for solving the above-mentioned problems.

Further , according to the present invention, the input means
The input character string or the document reading means
If the imported document contains a pair of symbols
Is a character string storage buffer with a symbol as a heading
Stored in, the symbol is input from the input means, conversion instruction
When the is done, the symbol input from the input means,
Headings stored in the character string storage buffer with symbols
And compare the headings that match the
By providing the symbol conversion means for outputting to the output means
The above problems are solved .

Further, according to the present invention , the symbol converting means
With the conversion candidates displayed by
A character with a certain permutation rule is included in the replacement candidates, and
When a candidate display instruction is issued, the characters with the permutation are ordered.
The next candidate who changes according to the column rules and outputs the next candidate
To solve by Riue Symbol challenges to be provided with a forming means.

[0014]

[0015]

BEST MODE FOR CARRYING OUT THE INVENTION The present invention will be described in detail below with reference to the drawings. FIG. 1 is a block diagram showing the configuration of the present invention. Reference numeral 1 is an input device including a keyboard and the like. The input device 1 is a means for inputting kana characters, a conversion key for instructing to convert a kana character string into a kana-kana mixed character string, a non-conversion key for directly outputting the input kana character, and a next candidate for sequentially sending conversion candidates. A key, a forward candidate key for reverse feeding, and a function key for performing various processes are provided.

A character input from the input device 1 is once stored in the input buffer 2 and output to the display device 4 through the central processing unit (CPU) 3. The display device 4 is composed of a CRT or LCD. The document buffer 5 is a buffer for storing document data. The output device 7 comprises a printer or the like and can output document data and the like.

The central processing unit 3 receives the conversion command input from the input device 1 and executes the kana-kanji conversion system 8 to display candidate kanji or kana-kanji mixed character strings from the kana-kanji conversion data 6. Output to the device 4. In the present invention, when a character string with a symbol is input / converted, the character string storage buffer 9 stores the character string and the symbol associated with the character string. Further, at the time of conversion by a symbol, the stored data is read from the character string storage buffer 9 with a symbol.

The process flow of the present invention will be described below with reference to the flow chart shown in FIG. When a character string is input (step S1) and a conversion instruction is given from the input device 1 (step S2), the kana-kanji conversion system 8 determines whether the beginning of the input character string is a symbol such as parentheses. (Step S3). If the beginning of the input character string is not a symbol, normal kana-kanji conversion processing is performed (step S7).

If it is a symbol, it is judged whether or not the input character string is only a symbol (step S4).
If it is only the symbol, the process proceeds to the symbol conversion process in the present invention, and if it is not the symbol, the ordinary kana-kanji conversion process is performed (step S7).

When the conversion instruction is given by inputting only the symbol, the symbol conversion processing in the present invention is performed. Input character string (symbol) and character string storage buffer with symbol 9
The heading contents of are compared (step S5). If there is matching data, the symbol-added character string is read from the symbol-added character string storage buffer 9 (step S6). If there is no matching data, normal kana-kanji conversion processing is performed (step S7).

When the conversion process as described above is performed, the candidates are output to the display device 4. If the displayed candidate is a character string requested by the user, the user gives an instruction to confirm the candidate (step S8). If the candidate is not the required character string, or if another candidate exists, the candidate is selected by the next candidate / previous candidate key of the input device, and the confirm operation is performed. The confirmation operation is performed by inputting the next character string, or by inputting a line feed key or a cursor key.

When the confirmation process is performed, it is determined whether the first character of the candidate character string is a symbol (step S).
9). Here, if the first character is not a symbol, the processing ends. When the first character is a symbol, it is further determined whether the character at the rear end of the candidate character string is a symbol (step S10). When both the leading and trailing ends of the candidate character string are symbols, the candidate is stored in the symbol-equipped character string storage buffer 9. Therefore, the storage buffer is searched (step S11), it is determined whether the character string is already stored, and if it is not stored, it is stored in the character string storage buffer 9 with symbols (step S12).
This character string is retrieved in step S5 described above and used for symbol conversion.

Next, an actual processing flow will be described with reference to FIG. In this example, (invention), "implementation", and (invention) are continuously input.

First, when "(hatsumei)" is input (a) and a conversion instruction is given (b), normal conversion processing is performed and "(invention)" is displayed on the screen. In this state, when a confirmation operation is performed by inputting the next character string or the like, since both ends of the character string are symbols, the symbol-added character string storage buffer 9 (hereinafter, simply referred to as the storage buffer 9) has " ) ”Is stored (c).

Subsequently, "done" is input (d) and a conversion instruction is given (e), "done" is displayed on the screen, and when the confirmation operation is performed, the storage buffer is displayed. “Implementation” is stored in 9 (f).

Then, enter "(" here (g),
When the conversion instruction is given (h), since the conversion instruction is for only one character, it is assumed that the kana-kanji conversion system 8 is for symbol conversion, the storage buffer 9 is searched, and "(invention)" is read from the storage buffer 9. , Is displayed (i). The above is the registration and symbol conversion (read) processing in the storage buffer 9 according to the present invention.

FIG. 4 is a view showing the contents of the character string storage buffer 9 with symbols in the above example. Initially, when nothing is stored in the character string storage buffer 9 with symbols (hereinafter simply storage buffer 9) (a), "(hatsume)" is input to perform conversion and confirmation. “(Invention)” is stored in 9 (b). Further, when "" is entered "" is input to confirm the conversion, "" is executed "is further stored in the storage buffer 9 (c).

When "(" is input and a conversion instruction is given, the character string with "(" is searched for in the storage buffer 9. First, "" is executed, but "(" Since it does not exist, the next "(invention)" is read and output (d).

The symbol-added character string storage buffer 9 in the example of FIG. 4 stores all the symbol-added character strings, but a plurality of symbol-added character string storage buffers may be provided for each type of symbol. FIG. 5 shows an example in which a symbol-added character string storage buffer is provided for each type of symbol. By providing a plurality of character string storage buffers with symbols, it becomes possible to quickly select a desired candidate when displaying candidates for symbol conversion.

Next, an example of retrieving a character string with a symbol from the document file 5 and storing it in the character string storage buffer 9 with a symbol will be described based on the flowchart of FIG. Step S21
First, specify the document to be called. In step S22, it is searched whether or not there is a character string with a symbol in the designated document. If there is a character string with a sign, the character string storage buffer 9 is sequentially called and stored in step S23. Then, in step S24, the document data is called into the document buffer 5 to perform edit processing and the like.

For example, there is document data as shown in FIG. 7. When this is called, [symbol], [document],
The (conversion) is stored in the character string storage buffer with symbol 9 and can be used in the subsequent symbol conversion.

Next, the process of updating and converting the numeral portion of the character string with a symbol will be described with reference to the flowchart of FIG. One symbol is entered (step S3
1) When a conversion instruction is given (step S32), the symbol-added character string storage buffer 9 is searched for symbol conversion, and candidates are read and displayed (step S33).

Next, the instruction is awaited (step S34), and when the confirmation instruction is given, the candidate is confirmed as it is and the processing is terminated. When the next candidate output is instructed from the input device 1, it is searched whether or not the candidate has a numeral portion (step S35). The numeral part is, for example, the part of "1" when the candidate is "[Example 1]". When the numeric part is searched in step S35, the numeric part is added (step S36), the candidate character string is updated (step S39), and the process returns to step S34.

When the previous candidate output is instructed in step S34, the numeral portion is similarly searched (step S37), the numeral portion is subtracted (step S38), and the candidate character string is updated (step S38). (Step S39), the process is returned to step S34.

An actual example is shown in FIG. Here, an example of inputting continuously with [Example 3] and [Example 4] is shown. First of all, "[Joshikai 3]" is input (a) and a conversion instruction is given (b). The conversion process is performed, and "[Example 3]" is output on the screen. Here, since both ends of the candidate character string are symbols, "[Example 3]" is stored in the character string storage buffer with symbol 9 (c). After that, when "[" is input (d) and a conversion instruction is given (e), "[Example 3]" is read from the character string storage buffer 9 with symbols and displayed. Up to this point, the processing is the same as that described above.

Subsequently, when a conversion instruction / next candidate output instruction is given (g), the numeral part "3" of the candidate character string "[Example 3]" is searched and the part is added. “4” is displayed, and the entire candidate character string is displayed as “[Example 4]” (h).

Further, FIG. 1 shows an example in which there are a plurality of numeral parts.
It shows in 0. When inputting "<< 5-1 >>" (a) and performing a conversion instruction (b), "<< Fig. 5-1 >>" is displayed on the screen, and "<< 5-1 >>"is stored (c). Subsequently, when "<<" is input (d) and a conversion instruction is given (e), "<< FIG. 5-1 >>" is read from the character string storage buffer 9 with symbols and displayed (f). In this state, move the cursor to the character you want to change (g) and give a conversion instruction (h), the number of the specified part is added and "<< Figure 5-2 >>" is displayed (i) . The processing is basically the same as the processing in FIG. After step S33,
There is a cursor specification operation process, and it is not necessary to perform a search in the processes of steps S35 and S37.
It is only necessary to add or subtract to the specified character.

In the above examples, numbers are used as targets, but similar processing is possible as long as it has a permutation such as alphabet or kana. If the JIS code is adjusted, for example, the conversion of “Figure A” → “Figure B” → “Figure C” is possible. FIG. 11 shows an example of this processing.

First, by inputting "<< zu A >>" (a) and performing a conversion instruction (b), "<< figure A >>" is displayed, and "<< figure A >>" is displayed in the character string storage buffer 9 with symbols. Is stored (c). In this state, when "<<" is input (d) and a conversion instruction is given (e), "<< Figure A >>" is read from the character string storage buffer 9 with symbols and displayed (f). here,
Further, when a conversion instruction such as the display of the next candidate or the display of the previous candidate is given (g), the alphabet portion having the permutation is changed and displayed as "<< Figure B >>" (h).

In this way, it is possible to sequentially create not only numbers but also character strings including characters having a permutation such as alphabets and kana as candidates.

[0041]

According to the present invention, when a character string with a symbol is re-input, it is possible to re-input with a very simple input. Further, since the character string with a symbol can be automatically read from the document, the character string with the symbol can be converted according to the document.

Furthermore, a number having a permutation in a character string with a symbol,
When a character such as an alphabet is included, the character can be changed to create a candidate by the next candidate / previous candidate instruction. For example, when inputting “(FIG. 1)” → “(FIG. 2)”, etc. Input can be simplified.

[Brief description of drawings]

FIG. 1 is a block diagram of a character processing device according to the present invention.

FIG. 2 is a flowchart showing the flow of processing of the present invention.

FIG. 3 is a diagram showing correspondence between screen display and operation in the processing of the present invention.

FIG. 4 is a diagram showing correspondence between buffers and operations in the processing of the present invention.

FIG. 5 is a diagram showing an example of a plurality of buffer storage methods.

FIG. 6 is a flowchart showing a flow of buffer storage processing by calling a document.

FIG. 7 is a diagram showing an example of document data and character string data with symbols in buffer storage processing by calling a document.

FIG. 8 is a flowchart showing a flow of processing of generating a next candidate / previous candidate in candidates including numbers.

FIG. 9 is a diagram showing correspondence between screen display and operation in a process of generating a next candidate / previous candidate in candidates including numbers.

FIG. 10 is a diagram showing correspondence between screen display and operation in a process of generating a next candidate / previous candidate in candidates including numbers.

FIG. 11 shows a candidate including characters having a constant permutation.
It is a flowchart which shows the flow of the process which produces | generates a next candidate / previous candidate.

[Explanation of symbols]

1 input device 2 input buffer 3 Central processing unit (CPU) 4 display device 5 document buffer 6 Kana-Kanji conversion data 7 Output device 8 Kana-Kanji conversion system 9 Character string storage buffer

Claims (4)

(57) [Claims] 1. Kana-Kanji conversion data in which an input means for inputting a character string composed of kana or symbols, and a kana-kanji conversion data in which a notation consisting of a kana character string and a notation composed of a kana-kanji mixed character string are stored in association with each other, in character processing apparatus having a kana-kanji conversion means for converting the character string input from the input means to the kana-kanji mingled string, and display means for displaying various character string, a kana-kanji conversion by the kana-kanji conversion means in the case where the character string input from said input means is enclosed in a pair of symbols, which is converted by the pseudonym kanji conversion, stores the character strings in the character string storage buffer with symbol including the pair of symbols A symbol character string storage means and a symbol are input from the input means, and a conversion instruction is given.
At this time, the symbol input from the input means and the character string with the symbol
Inputs after comparing with the character string stored in the storage buffer
The output means as a conversion candidate, which is a character string including the selected symbol
And a symbol converting means for outputting to a character processing device. 2. An input for inputting a character string consisting of kana and symbols.
Is it a mixture of force words and kana and kana kanji?
Kana-Kanji conversion data stored in correspondence with the notation
And the character string input from the input means is a kana-kanji mixed sentence.
A character processing device provided with a kana-kanji conversion means for converting to a character string and a display means for displaying various character strings.
In the document, the document reading means for reading the document and the inside of the document read by the document reading means
A symbol character string storage means for searching a character string that is enclosed in a pair of symbols, and stores a character string containing the previous SL pair of symbols in the character string storage buffer with symbols, the symbols from the input means is input to, Conversion instruction was given
At this time, the symbol input from the input means and the character string with the symbol
Inputs after comparing with the character string stored in the storage buffer
The output means as a conversion candidate, which is a character string including the selected symbol
And a symbol converting means for outputting to a character processing device. 3. A character string input from the input means
Or the document read by the document reading means
Where a pair of symbols is included, find the symbol
It is stored in a character string storage buffer with a symbol, and a symbol is input from the input means, and a conversion instruction is given.
At this time, the symbol input from the input means and the character string with the symbol
The headings stored in the storage buffer are compared and the headings are
Output to the output means the notation that matches
Character processing apparatus 請 Motomeko 1 or 2, wherein you comprising: a symbol converting means for. 4. A conversion candidate is displayed by the symbol converting means.
In this state, the conversion candidate includes a character having a certain permutation rule,
When the next candidate display instruction is issued, the character having the permutation is changed based on the permutation rule, and the next
It is characterized by comprising a next candidate generating means for outputting a candidate .
Character processing apparatus as claimed any of that請 Motomeko 1 to 3.