JPH03123961A - Character processor - Google Patents

Abstract

PURPOSE:To input KANA (Japanese syllabary) small letters as to an inputted character string which is inputted without depressing a conversion key with a simple operation method and without interrupting the rhythm of the operation by providing a pre-candidate key which functions before a conversion key is depressed. CONSTITUTION:When the pre-candidate key of a keyboard 15 is depressed in a KANA small letter conversion processing, CPU 10 judges whether the character string is the converted one or not. When the conversion key is not depressed, the KANA small letter conversion processing is executed. Namely, a pointer is once shifted to the final character of the character string, and the pointer is judged to be the head of the character string or not. When it is not, it is judged whether the position of the pointer can be converted into the KANA small letter or not. If it is possible as a result, the character in the position of the pointer is converted into the KANA small letter, and displayed. If it is not the desired character string, the pre-candidate key is depressed again and the operation is repeated. Thus, conversion into the character string including the KANA small letter is attained with the simple operation method and without interrupting the rhythm of the operation.

Description

DETAILED DESCRIPTION OF THE INVENTION (A) Field of Industrial Application The present invention relates to a character processing device, and more particularly to a character processing device equipped with a character editing function such as a word processor or an electronic notebook.

(b) Prior Art Conventionally, when performing kana-kanji conversion in a character processing device such as a word processor or an electronic notebook, a kana character string is usually input as information for conversion.

When inputting lowercase letters such as ``ya'', ``tsu'', and ``yu'' using a word processor, the user held down the shift key and pressed the letter key corresponding to the lowercase letter, ``ya'', ``tsu'', and ``yu''. Figure 5 shows the "
Fig. 6 shows the conversion procedure for the same content in a conventional electronic notebook.

(c) Problems to be Solved by the Invention However, in the above character processing device, the character key must be pressed while holding down the shift key each time a kana lowercase character is input. This requires an operator who is not accustomed to key operations to make an operational error, and even for an operator who is accustomed to key operations, the input operation may interrupt the flow of operations. It had the disadvantage of slowing down the process.

The present invention has been made in consideration of the above circumstances, and therefore provides a character processing device that can input kana lowercase letters using a simple operation method and without interrupting the rhythm of operation.

(D) Means for Solving the Problems This invention comprises an input means 1 for inputting a kana character string, a g200 million means 2 for storing the kana character string inputted from the input means 1, and a memory means 2 for storing the kana character string. a display means 3 for displaying a character string, a dictionary means 4 for storing kana lowercase letters, an instruction means 5 for inputting an instruction for converting kana lowercase letters, and a display means 3 for inputting an instruction for converting kana lowercase letters; 1 kana character
a determining means 6 for determining whether the extracted kana character can be converted into a lowercase kana character; and a dictionary means 6 for determining whether the extracted kana character can be converted into a lowercase kana character; This character processing device is provided with a kana lowercase character converting means 7 which reads out the kana lowercase character from 4, replaces the read kana lowercase character with the retrieved kana character, and stores it in the storage means 2.

Specific examples of the character processing device in the present invention include a word processor, an electronic notebook with a character input function, a computer with a character processing function, and the like.

It is preferable to use a keyboard or a pointing device as the input means in a word processor, computer, etc., but in a portable device such as an electronic notebook, an input key consisting of a membrane switch may also be used. The storage means can be composed of a RAM serving as a main storage device. The dictionary means 9 kana lowercase letters ``a'', ``i'', ``
It can be constructed from a ROM that stores ``u'', ``e'', ``o'', ``ya'', ``yu'', ``yo'', and ``tsu''. The instruction means may be assigned to the input means. Specifically, it is preferable to use the previous candidate key provided on the keyboard or the input key, but it is also possible to use the cancel key. In other words, it is sufficient to use keys that do not process input kana characters even if they are operated before conversion. The determination means and the kana/lowercase conversion means can be constructed from a CPU.

(E) Effect According to this invention, when kana characters are input from the input means, the kana characters are first displayed on the display means, and then each time a kana lowercase conversion instruction is input, each character of the displayed kana characters is It is sequentially determined whether the characters can be converted to lowercase kana characters, and if the characters can be converted to lowercase kana characters, the kana characters are sequentially converted to lowercase kana characters and are replaced with the displayed kana characters.

(F) EXAMPLES The present invention will be described in detail below based on examples shown in the figures. Note that this invention is not limited by this.

FIG. 2 is a block diagram of a Japanese word processor which is an embodiment of the present invention. In the same figure, the symbol A is the main body of the word processor, which mainly contains CPUIOROMI.
It consists of an ISRAMI 2 and an output control section 13, which are interconnected by a pass line 14. ROMI
The memory contents of I include a control program 211 for controlling cputo, a kana-kanji conversion dictionary 112 for performing kana-kanji conversion, and a kana-lower case dictionary 1 that stores kana lower-case letters.
It consists of 13. The RAM 12 stores kana character strings input from a keyboard (described later).

In addition, a keyboard 15 is externally connected to the CPU10, and this keyboard 15 includes character keys for inputting kana character strings, conversion keys for performing kana-kanji conversion, and previous candidate keys for calling the previous candidate in conversion candidates. , and execution keys for executing various processes.

In the past, the previous candidate key was a key that only functioned after the conversion key was pressed. However, in this embodiment, the previous candidate key has a special instruction. A special instruction means that when the previous candidate key is pressed before the conversion key is pressed, the character string that has been input and is being displayed on the CRT 16 is searched for characters that can be converted to kana lowercase letters, and the characters are converted to kana lowercase letters. This is an instruction to convert it. Note that a kana character string may contain two or more characters that can be converted into kana lowercase letters, and it is not always desirable to convert these characters into kana lowercase letters.

In this case, each time the previous candidate key is pressed, the character to be converted to lowercase kana letters is changed, thereby causing the CRT 16 to display combinations including all lowercase kana letters.

In addition, the CPU 10 is connected to a CRT via the output control unit 13.
16 is connected, and on this CRT 16, kana character strings input from the keyboard 15, words converted into kana-kanji, etc. are displayed.

The CPU 10 performs kana/lowercase conversion processing according to the control program 21. In other words, each time the previous candidate key is pressed, R
Take out the kana characters one by one from AM12, judge whether the kana characters can be converted to kana lowercase letters, and when it is determined that the extracted kana characters can be converted to kana lowercase letters, select the kana lowercase letter corresponding to the extracted kana character. Lowercase dictionary 11
3, and read out the kana lowercase letters from RAM 1.
RAM 12 by replacing it with the kana characters taken out from 2.
Please update your registration.

The operation of the kana/lowercase conversion process will be described below with reference to the flowchart shown in FIG.

Note that it is assumed that a character string is input from the keyboard 15.

First, when the previous candidate key on the keyboard 15 is pressed (step 30), the CPU 10 determines whether the character string is a converted character string (step 31). If YES, the previous candidate key is pressed as in the conventional process. (step 32). If the conversion key is not pressed in step 31, kana and lowercase conversion processing, which is a feature of this embodiment, is performed. In other words, the pointer is first moved to the last character of the string (Step 33), and then it is determined whether the pointer is at the beginning of the string (Step 34).Of course, the answer here is NO, so the next step is to move the pointer to the last character of the string. It is determined whether it is possible to convert to lowercase letters (step 35). If the result of the determination is No, it is further determined whether the character at the pointer position is a kana lowercase letter (step 36); if No, the pointer is moved to the previous character (step 37), and the process returns to step 34. Further, if YES, the process proceeds to step 38) in which the character at the pointer position is returned to an uppercase character (normal character), and step 37 is performed. Also,
If YES in the process of step 35, that is, it is possible to convert the character at the pointer position to a lowercase kana character, the character at the pointer position is converted to lowercase kana character (step 39) and displayed. If the character string is not the desired character string, press the Fu section sub key again and repeat from step 30.

Once the desired character string is obtained in this way, the character string can be further converted into Kanji by pressing the conversion key.

Note that the reason why the character at the pointer position is converted to uppercase if it is a lowercase kana character in step 36 is to return the character that has been converted to lowercase kana to its original character, even though it should not be converted to lowercase kana. .

Note that, in addition to the nine types of kana lowercase letters, various conditions may be added to the conditions for characters that can be lowercase kana letters in step 35, such as that if the previous character is a lowercase kana letter, it will not become a lowercase letter.

Although this embodiment has described the process of converting kana characters into kana lowercase characters, it goes without saying that the present invention can also be applied to the case of converting katakana characters to katakana lowercase characters.

Figure 4 shows the characters ``Kimiyo'' that contain kana lowercase letters by inputting the characters ``Kimiyou'' and pressing the previous candidate key repeatedly.
An example of the operation and display state for converting to is shown.

(G) Effects of the Invention According to the present invention, a character string consisting of normal characters input without pressing the shift key can be converted into a character string including kana lowercase letters with a simple operation.

Therefore, even an operator who is not familiar with key operations can easily and quickly input kana lowercase letters. Furthermore, for operators who are accustomed to the operation, they can efficiently input kana lowercase letters without interrupting the input rhythm.

[Brief explanation of the drawing]

Fig. 1 is a block diagram showing the basic configuration of the present invention, Fig. 2 is a block diagram of a character processing device showing an embodiment of the invention, Fig. 3 is a flowchart explaining the operation of the embodiment, and Fig. 4 is a block diagram showing the basic configuration of the invention. FIGS. 5 and 6 are explanatory diagrams showing operation examples and display states of the embodiment. FIGS. 5 and 6 are explanatory diagrams showing operation examples and display states for inputting kana and lowercase letters in a conventional character processing device. l...Input means, 2...Storage means, 3...Display means, 4...
・Dictionary means, 5... Instruction means, 6...
...Judgment means, 7...Kana lowercase conversion means. 6th bad circle 11; ζ work - + 2 + IJq trouble - - - 111 - - ↓ Low - - - - number

Claims (1)

[Claims] 1. An input means for inputting a kana character string, a storage means for storing the kana character string input from the input means, a display means for displaying the character string stored in the storage means, and a storage means for storing kana lowercase letters. a dictionary means, an instruction means for inputting an instruction for converting kana lowercase letters, and a judgment means for extracting kana characters one by one from the storage means each time an instruction for kana lowercase letters is received and determining whether the kana character can be converted to kana lowercase letters. and when it is determined that the retrieved kana character can be converted into a kana lowercase character, the kana lowercase character corresponding to the retrieved kana character is read from the dictionary means, and the read kana lowercase character is replaced with the retrieved kana character and stored. A character processing device comprising: means for converting kana to lowercase characters.