JPS62145353A - Japanese word processor - Google Patents

Abstract

PURPOSE:To increase a key input speed by dividing characters and marks into plural groups, and displaying the names of the groups. CONSTITUTION:A code corresponding to a character key inputted from an input part 2 is stored at a character string buffer 4 in an inputting sequence. A character string decision part 5 decides whether the code stored at the character string buffer 4 is a numeric code or a character code, and sends a result to a control part 1. A code conversion part 6, when all of the codes stored at the character string buffer 4 are the numeric codes, converts them to mark codes, such as characters and marks, etc., corresponding to said numeric codes. At a mark dictionary 7, the name of the group and the character and the mark, etc., belonging to said group name are stored respectively in a form of the mark code. A dictionary read part 8, when all of the codes stored at the character string buffer 4 are character codes, reads the character and the mark, etc., belonging to said group from the mark dictionary 7 based on the group name represented by a string consisting of said character code and outputs.

Description

[Detailed description of the invention] (b) Industrial application field The present invention relates to a Japanese language processing device.

Conventional technology In Japanese language processing devices such as Japanese word processors that are currently in widespread use, when there is no key corresponding to a desired character or symbol on the input device, a symbol such as a kuten hood, etc. A method has been adopted in which a number assigned corresponding to the number is input and the corresponding characters, symbols, etc. are output and displayed based on the number data ('5
WP-3400 Operation Manual”).

However, with this method, there is a problem in that when the number of types of characters and symbols increases, it becomes difficult for the document creator to memorize all the numbers assigned to each character and symbol.

Taking these points into consideration, as an improved method, for example, Greek letters are written in the group named ``Greek yo'' (
Symbols such as KK), Dai, Oki, etc. are grouped into groups named ``Kigo'', the document creator is asked to enter the group name, and a list of characters and symbols within the group with that group name is displayed. There is a method in which desired characters and symbols are selected. As a result, even if the document creator does not remember the numbers assigned to each character symbol, it is now possible to recall the characters and symbols as long as the group name is memorized.

(c) Problems that the invention seeks to solve However, in reality, document creators often do not even remember the group name, and this has not been a fundamental solution.

(d) Means for solving the problem The present invention has been made in view of the above points, and its structural feature is that after inputting a Kuten hood or a group name, when the dictionary key is input, the Kuten A Japanese language processing device that displays characters/symbols corresponding to food or characters/symbols corresponding to Okuki group names, and a symbol dictionary storing multiple group names and symbols corresponding to each group name. , a dictionary reading section for reading out the contents of the symbol dictionary, a display control section for displaying the contents read by the dictionary reading section on a display, and an input section having the dictionary key, wherein the dictionary key is input in East Germany. The dictionary reading unit reads the group name in the symbol dictionary, and the display control unit displays the group name on the display.

(e) Effect With this configuration, the group name can be displayed on the display.

(f) Embodiment 1rXJ shows an embodiment of the present invention, in which (1) is a control section, which is composed of, for example, a microcomputer, and controls the various sections described below.

(2) is an input section consisting of a keyboard, which includes a plurality of character keys corresponding to letters and numbers, a dictionary key, an execution key, and a cursor key for instructing movement of a cursor on a display device, which will be described later. etc. (3) is a key determination unit, which determines whether the key input from the input unit (2) is a character key, sends the determination result to the control unit (1), and inputs Outputs the code corresponding to the pressed key. (4) is a character string buffer, and the characters corresponding to the character keys input from the input section (2) are stored in the character string buffer in the order of input.

(5) is a character string determination unit, which determines whether the code that has been stored in the character string buffer (4) is a numeric code or a character code, and transmits the determination result to the control unit. send to (6) is a code conversion unit, and when all the hoods stored in the character string buffer (4) are numeric hoods, this conversion unit converts a string of numeric codes (numeric code string) into a period code. It is regarded as number data assigned corresponding to characters, symbols, etc., and is converted into symbol hoods such as characters, symbols, etc. corresponding to the numeric hood string. Incidentally, such a hood conversion section has a comparison table between number data and symbol hoods for performing the above conversion.

7> is a symbol dictionary, and as shown in FIG. 2, group names and characters, symbols, etc. belonging to each group name are stored in the dictionary in the form of symbol codes. For example, group name r
The area corresponding to "Tenki" stores symbol codes corresponding to symbols such as "r*", rjuno, and '8J. (8)
is a dictionary reading section, and this reading section is a character string buffer (4)
If all the codes that can be stored in the code are character hoods, based on the group name represented by a string of character hoods (character code string), the characters, symbols, etc. belonging to the group with the group name are stored in the symbol dictionary (7 ) is read and output. (
9) is a menu creation section which edits and stores a plurality of input data into a predetermined form for display on the display (10). 11) is a menu selection section,
The menu selection section reads and outputs one of the data stored in the menu creation section (9). (12) is a display control unit, which converts input data such as symbol hood into a corresponding display pattern, and displays the data on the display (10).
to be displayed.

FIG. 3 is a flowchart showing the control method of the control section (1) of this embodiment, and the operation of the apparatus of this embodiment will be explained below based on this flowchart.

First, in step S1, a key input from the input section (2) is waited for, and if there is key input, it is determined in step 82 whether or not the input key is a dictionary key. This determination is made based on the hood sent out from the key determination section (3) in response to the input key.

In step S2 above, if it is determined that the input key is not a dictionary key but a character key, the process proceeds to step S3, where the code output from the key determination section (3) is stored in the character string buffer (4). be done. After that, the process returns to step S1. Note that the characters and numbers corresponding to the code t: stored in the character string buffer (4) are displayed on the display (10). Further, if it is determined in step S2 that the input key is a dictionary key, the process advances to step S4.

In step S4, the code string in the character string buffer (4) is a numeric code string, a character code string, or a buffer (4).
) is in a state where no food string exists or not is determined in the character string determination unit (5).

In the decision to decline, if it is determined that it is a numeric food string, the process proceeds to step 5100, if it is determined that it is a character code string, the process proceeds to step 5200, and if it is determined that there is no food string in buffer γ(4), the process proceeds to step 5200. Processing continues at step 8300.

Below, processing of steps 5100 to 5102, 520
0 to S 205 step processing and S 300 to 5
The processing of step 303 will be explained based on a specific example.

(1> If a numeric food string is stored in the string buffer (4), the string buffer (
4) Numerical code r1. which constitutes the symbol 'Number 11038 corresponding to OJ'. r□, r3゜ "8" is stored, and the display (10) displays the number corresponding to the code stored in the character string buffer (4) as shown in Figure 4 (a). shall be taken as a thing.

In the figure, (20) indicates the next input position, and (20) indicates the next input position.
1) is an underline indicating the code string that has currently been input into the character string buffer (4).

In such a state, at step 8100, the number food string ' 1 stored in the character string buffer (4) is
038 is sent to the code conversion unit (6), and the food string is converted into a corresponding symbol code (for example, rOAEB3H”), which is output from the code conversion unit (6).

The symbol code output from the code converter (6) is 510
It is sent to the display control section (12) in one step. Therefore, the display control unit (12) uses the symbol code 'OA
EB 3 HJ) on the display (
10). The display at this time is shown in Figure 4(b).
As shown in Figure 5, when the <54 step is completed, the symbol "ri-" is displayed in place of the numeric string that was completely displayed.

When step 5101 is completed, the process proceeds to step 5102, but in the step of refusing, the contents of the character string buffer (4) are cleared and the process ends.

(i) If the character code string is stored in the character string buffer <4) When the processing of step S4 is completed, the group name ``1 character hood 1 representing Tenki'' is stored in the character string buffer (4). It is assumed that "No. 1 Ki" is stored, and characters corresponding to the code stored in the character string buffer (4) are displayed on the display (10) as shown in FIG. 5(a).

In such a state, in step 5200, the character string buffer (characters that have been stored in 4>) - code string 1 tenki'' is sent to the dictionary reading section <8>, and the group name represented by this code string is read. The symbol code corresponding to the symbol belonging to the group can be read from the symbol dictionary (7).

The symbol code read in step 5200 is sent to the menu creation section (9) in step 5201, where it is edited, and then the symbol corresponding to the symbol code is displayed on the display (10).

Specifically, the menu creation section (9) attaches an auxiliary number to each of the received symbols, and sends the symbol code together with the auxiliary number to the display control section (12).

Therefore, the display control unit (12) uses auxiliary numbers (1 to 5 in the figure) and symbols (8 in the figure), ↑, 13, as shown in @5 figure (b).
, b, 8) are displayed as a pair on the display (10), and the fifth
The display shown in Figure (a) is erased.

Next, in steps 5202 and 5203, it is determined whether the keys corresponding to the auxiliary numbers 1 to 5 have been input from the input section (2>), and if the above input has been made, the process proceeds to 5204.
Proceed to step.

For example, if there is a key input corresponding to the number "1°" in step 5202, then in step 5204, the menu selection section (11) selects the symbol hood that has the above number 11 as an auxiliary number, that is, the symbol "register". The corresponding symbol code is read out from the menu creation section (9) and sent to the display control section (12).As a result, the display control section (12) displays only the symbol -> on the display (10) as shown in FIG. 5(c).
). Note that in the above step 5202, other numbers r2. ~ "When a key corresponding to any one of 5. is performed, the symbol 1+4,'c3", 1 color 1, "8
” is displayed in 8204 steps.

Then, in step 5205, the string buffer (4
) is cleared and the process ends.

(i) When no code is stored in the character string buffer (4) When no code is stored in the character string buffer (4) at the end of step S4, the dictionary reading unit (8) reads the symbol at step 5300. All group names stored in the directory 11(7) are read.

The read group name of refusal is sent to the menu creation section <9) in step S301. The menu creation section (9) edits the group names so that each group name can be displayed separately when displayed on the display (10) as shown in FIG. 6(a), and the display control section (12) ). At this time, the menu creation section (9) stores the group name and its display position information on the display (10) in association with each other.

In step <3302, any one of the group names displayed on the display (10) is selected.

The above selection can be made, for example, by moving the cursor <20) on the display (10) to the desired group name, as shown in No. 613i0(a), and then inputting - during execution. .

For example, when the group name 1 is selected by the above selection, the menu selection section (11
) reads the group name corresponding to the cursor position from the menu creation unit (9), stores the character code string "Tenkiyo" constituting this group name in the character string buffer (4), and the process proceeds to step S200.

Hereinafter, steps S200 to S5205 will be sequentially processed, but since the processing step of refusing has already been explained, its explanation will be omitted.

(G) Effects of the Invention The Japanese language processing device of the present invention can classify characters and symbols into a plurality of groups and display the group names on the display with a simple operation, so that the desired symbol can be displayed. There is no need to remember the name of the group to which it belongs, and therefore the input speed of characters and symbols for which there is no corresponding key on the input section is improved.
Hi.

[Brief explanation of drawings]

The figure shows an embodiment of the present invention, and FIG. 1 is a block circuit diagram;
2N is a schematic diagram showing the structure of the symbol dictionary, Figures 3(a)-
(d) is a flowchart showing the operation of this embodiment, and FIGS. 4 to 6 are schematic diagrams showing the display states of the display. (2)...Input section, (7)...Symbol dictionary, (8)...
...Dictionary reading unit, (10>...Display unit, (11>...
Display control section. 2nd cause Figure 8 Figure 5 (b) 1.9z+ 3.8 4e35.8)■ Handling (C) 91120 Figure 6

Claims (1)

[Claims] (1) After entering the Kuten code or group name, when the dictionary key is input, the characters and symbols corresponding to the above Kuten code or the characters and symbols corresponding to the above group name will be displayed on the Japanese language processing device. a symbol dictionary storing a plurality of group names and symbols corresponding to each group name; a dictionary reading section for reading out the contents of the symbol dictionary; and displaying the contents read by the dictionary reading section on a display. a display control section; an input section having the dictionary key; when the dictionary key is input alone, the dictionary reading section reads out a group name in the symbol dictionary, and the display control section reads out the group name in the symbol dictionary; A Japanese language processing device characterized by displaying information on a display device.