JPS61173375A - Word processor - Google Patents

Abstract

PURPOSE:To facilitate selection of recently used symbols by indicating, when the relatively recently used symbols are re-used, on a list by code signals from a symbol learning buffer. CONSTITUTION:In an editing memory unit, there are provided, in addition to a sentence buffer, a symbol buffer memory for storing the code signals of symbols used at least once during formation of the sentence in order they are used recently, and a symbol buffer 18 for storing the code signals of the total of symbols in fixed preference sequence. In the selection of the targeted symbols, it is decided whether the code signals of the desired or targeted symbols exist in the buffer 17. If affirmative, list indication is performed on the basis of code signals from the buffer 17. If negative, list indication is performed on the basis of the code signals from the buffer 18. When the symbol D, for example, is selected, the symbol D is stored at the foremost address of the buffer 17 by re-charging of the buffer 17.

Description

Detailed Description of the Invention [Field of Industrial Application] The present invention relates to a word processor, and more specifically, when inputting various symbols such as various parentheses and symbols indicating addition, subtraction, multiplication, and division, a group of symbols is displayed on a display unit. This invention relates to a word processor that displays a list of symbols, and selects and inputs a desired symbol from the list.

[Conventional technology and its problems There are two ways to input symbols in a coword processor: one is to provide a key for each symbol, and the other is to input various symbols using codes such as numbers, but in both cases, the number of symbols is There is a problem in that when the number increases, the operability deteriorates.

On the other hand, a method is known in which a list of various symbols is displayed on a display unit in descending order of frequency of use based on code signals supplied from a symbol buffer, and a desired symbol is selected from the list and inputted. ing. In this way, when displaying a list of symbols, for example, in a device with a small display capacity such as a - line display, various symbols are divided and displayed a plurality of times by operating the repeat key or the like. In this case, displaying the symbols in a certain order as described above has the advantage that particularly skilled operators can quickly select the symbols they need to input because they remember the display order of the symbols they should input. However, on the other hand, if symbols that are displayed later in the display order are repeatedly input, the user must operate the repeat key each time, making the operation complicated.

On the other hand, in the symbol buffer, FIG. 6(a).

There are devices with a learning function as shown in (b).

That is, various symbols A and B are stored in the symbol buffer.

C1... (specifically (,), r, J, x,,
÷, ■, *, etc., but they are shown in alphabetical order for convenience. ) are stored in the order in which they are displayed on the display unit as shown in FIG. As shown in b), the addresses of the food signals corresponding to the symbols A-E higher than the symbol F are sequentially moved down, and the code signal of the symbol F, which has been input most recently, is moved to the first address and stored in the symbol buffer. The order is being changed.

However, although this learning method is convenient when a small number of symbols are used repeatedly, the address of the food signal of an unused symbol is moved down each time the storage order is changed. There is a problem in that when a new symbol is used, the display order of the symbol is delayed and it takes time to search for the symbol. Furthermore, since the display order is undefined, the operator cannot select symbols by relying on memory.

[Means for Solving the Problems 1] The present invention provides a symbol buffer that stores code signals of various symbols and supplies them to the display means in a predetermined fixed priority order, and a code signal of input symbols. The above problem is solved by providing a symbol learning buffer that stores symbols and supplies them to the display means in the order of the most recently input symbols, and selectively using the symbol buffer and the symbol learning buffer. Note that the number of code signals stored in the symbol learning buffer is set to be less than the total number of various symbols,
Preferably, only code signals for relatively recently used symbols are stored in the symbol learning buffer.

[Operations and Effects of the Invention] According to the present invention, when reusing a symbol that has been used relatively recently, the symbol can be easily selected by displaying a list using the code signal from the symbol learning buffer. On the other hand, when newly using an unused symbol, the symbol can be easily selected by displaying the list in a fixed priority order based on the code signal from the symbol buffer. Become.

Furthermore, by limiting the number of symbols stored in the symbol learning buffer in the form of code signals, it is possible to minimize the increase in buffer capacity due to the juxtaposition of symbol buffers and symbol learning buffers. Note that if you use many types of symbols while creating a document and then reuse one of them, it is better to search for symbols other than relatively recently used symbols by displaying them in a list using the symbol buffer. For convenience, as mentioned above, the symbol learning buffer does not necessarily need to store the code signals of all the symbols used, but may just store the code signals of a certain number of symbols that have been used relatively recently. It is.

[Example] The present invention will be explained in detail below.

As shown in FIGS. 1 and 2, the word processor according to the present embodiment has a keyboard l having a key group Kl for inputting letters such as alphabets and kana, numbers, etc., and a key group Kl for editing control. , a display unit 2 consisting of a one-line display, and a printer unit 3 consisting of a thermal printer. In the above edit control key group 2 is the cursor left to change the cursor (index) position.

It includes a right shift key 4.5, cursor up and cursor down keys 6.7, a symbol input key 8 for instructing symbol input, a symbol selection key to be described later, a normal symbol key, a symbol pattern number key, and the like.

The word processor has a built-in editing control section 11 (ROM, etc.) that performs editing control based on a system program unit 10 that stores an editing control program. A key control section 12 is interposed between the editing control section 11 and the keyboard 1, which supplies a corresponding key code signal to the editing control section 2 based on the operation of each key.

When a predetermined unit of kana characters (input in Roman characters is also possible) is input from the keyboard 1, a corresponding character code signal is supplied from the editing control section 11 to the display control section 13, and the character code signal stored in the display control section 13 is The input kana sentence is stored in the display buffer, and the input kana sentence is displayed on the display unit 2 based on it. - Subsequently, if there is an instruction for kana-kanji conversion, the kana-kanji conversion control unit 14 reads out the kanji-mixed sentence corresponding to the kana sentence in the form of a character code signal, and the kanji-mixed sentence is displayed on the display unit 2. , the desired kanji-mixed sentence is selected. The kanji-mixed sentence thus created is stored in a text buffer 16 in an editing memory unit 15 consisting of a RAM or the like.

In the editing memory unit 15, a text buffer 16 is stored.
In addition, the code signal of the symbol used (learned) at least once during sentence creation is added to the code signal of the symbol V used most recently.
, W, . Ranking A, B, C,... (for example, JIS
It includes a symbol buffer I8 for storing data in the code order (in the order of point codes) and an address control register 20 for controlling the addresses of each buffer 16, 17, and 18. The capacity of the symbol learning buffer 17 is set relatively small to the extent that it can store code signals of, for example, around 10 types of symbols, and if symbols of a type exceeding this capacity are used, the oldest used symbol will be stored. The symbols are deleted in the order of code signals. Further, although the symbol learning buffer 17 is normally left blank at the initial stage (at the start of writing), it may also store the code signal of the most frequently used symbol.

When using various symbols while creating a sentence, a list of symbols is displayed on the display unit 2 based on the code signal from the symbol learning buffer 17 or the symbol buffer 18, and the desired symbol is selected from the list. , the symbol is stored in the text buffer 20.

The text created in this manner can be printed by the printer unit 3 by supplying text data from the text buffer 16 to the print memory in the printer control unit 21 via the editing control unit 11.

The symbol input during text creation will be described in detail below.

When inputting a symbol, the symbol input instruction key 8 is operated,
When the symbol manual mode is selected instead of the normal input mode, control based on the flowchart of FIG. 3 is performed.

(i) That is, in step Sl, a code signal is transmitted from the symbol learning buffer 17 to the display buffer, and the code signal is stored in the display buffer.

(ii) Next, in S2, the code corresponding to the circle mark indicating that the symbol to be displayed in the list from now on is a symbol that has already been learned is stored in the display buffer.

(if) In S3, based on the storage contents of the display buffer, as shown in FIG. 4(a), the already used symbols V,
W, . . . are the above-mentioned wandering marks and selection numbers l, 2.・Both characters are displayed. In this case, in a word processor having a one-line display like the one in this embodiment, the symbol group is divided into, for example, every five symbols and displayed.

(iv) If the desired symbol is found in the displayed symbol group (symbol pattern), press the symbol selection key in S4, and then input selection numbers 1 to 5 corresponding to the desired symbol using the numeric keys. Note that the control when the target symbol is selected will be described later.

(V) If the target symbol is not found in the initially displayed symbol pattern, the process proceeds to S5 and the symbol pattern repeating key (for example, the cursor down key 7) is operated.

(vi) When the symbol pattern repeat key is operated, S
In step 6, it is further determined whether or not to display a list based on the code signal from the symbol learning buffer 17, that is, whether there are any undisplayed symbols among the symbols stored in the symbol learning buffer 17 in the form of a code signal. It is determined whether

(vii) In S6, if undisplayed symbols remain in the symbol learning buffer 17, the process returns to Sl, and the symbols in the symbol learning buffer 17 are displayed again in units of five.

In that case, the academic mark and selection numbers 1 to 5 are added to the displayed symbols as described above.

(viii) In S6, if there are no undisplayed symbols remaining in the symbol learning buffer 17, the process proceeds to S7 to display a list of symbols stored in the symbol buffer 18 in the form of code signals. The code signal from symbol buffer 18 is stored in the display buffer.

Furthermore, in S8, a code corresponding to the mark ◆ indicating that the symbol pattern to be displayed from now on is supplied from the symbol buffer 18 is stored in the display buffer, and the code is stored in the display buffer.
Return to

(ix) In S3, as shown in FIG. 4(c), the symbol pattern is displayed with a mark ◆ and selection numbers 1 to 5 added thereto, for example, every fifth symbol pattern as described above. If the desired symbol is in the symbol pattern displayed first, S4
If the symbol is not found, a new symbol pattern in the symbol buffer 18 is displayed using the symbol pattern repeating key, and when the desired symbol appears, the program advances to 84.

(x) In S4, if the target symbol is selected by operating the symbol selection key and the number key corresponding to the selection number of the target symbol, the symbol is stored in the text buffer 16, and symbol learning is performed at 69 or below. The code signal stored in the buffer 17 and its storage address are changed (refilling the symbol learning buffer 17).

(xi) That is, in S9, it is determined whether the target symbol has been selected from the symbol learning buffer 17, and if the target symbol is selected from the symbol learning buffer 17, the process proceeds to SIO and the code signal of the symbol is used for symbol learning. The symbol learning buffer 17 is only repacked so that it is stored at the leading address of the buffer 17.

At this time, the code signals stored at addresses higher than the code signal of the symbol are sequentially moved down in storage address. Upon completion of this repacking, the symbol input mode is ended.

(xii) At S9, the target symbol is in the symbol buffer 18
If it is determined that the symbol has been selected, the process proceeds to Sll, where it is determined whether the code signal of the symbol already exists in the symbol learning buffer 17.

(xiii) If the symbol selected from the symbol buffer 18 in S11 is already in the symbol learning buffer F, the SI
The process advances to O, and the symbol learning buffer 17 is refilled in the same manner as described above, and the symbol input mode is ended.

(xiv) In S11, if the symbol selected from the symbol buffer 18 is not in the symbol learning buffer 17, the process advances to S12, and each code signal in the symbol learning buffer 17 is The memory address is moved down sequentially. At this time, the code signal stored at the lowest address of the symbol learning buffer 17, that is, the code signal of the oldest used symbol, is deleted. Subsequently, in S13, the code signal of the selected symbol is stored in the first address of the symbol learning buffer 17, and the symbol input mode is ended.

Note that when selecting the target symbol in S4, the symbol selection key may be operated while the target symbol is indicated by the cursor.

Here, S12. Symbol learning buffer 17 in S13
A specific example of refilling will be explained.

That is, it is assumed that when symbols are stored in the symbol learning buffer 17 in the priority order shown in FIG. ) is selected, Figure 5 (
As shown in b), each symbol V, W in the symbol learning buffer 17
, X, .

In this way, when entering symbols again after repacking, the first list display will be as shown in Figure 4(b).
It will be like this.

The above control procedure is for the case where the operator performs the most common operation, but in this example, the control procedure is for experienced operators.
Another method of operation is available.

That is, if the operator originally intends to select the target symbol from the symbol buffer 18, 83 in FIG.
In , after the first symbol pattern from the symbol learning buffer 17 is displayed, if the normal symbol key is operated in S14, it is possible to skip S6 and immediately proceed to S7. In this case, even if undisplayed symbols remain in the symbol learning buffer 17, they will not be displayed, so the number of operations of the symbol pattern repetition key can be reduced, and the operation can be simplified.

In addition, when selecting from the symbol buffer 18, if it is known how many times the symbol pattern is displayed, the symbol pattern number input key and the number corresponding to the symbol pattern number are selected in S15. Operate the keys. In that case, the address of the symbol pattern including the target symbol is calculated in S16, and the symbol pattern is immediately displayed.

In addition, if a serial number is used as the selection number, as another operation method, if the operator has memorized the selection number of the target symbol, the operator can select the target by using the memorized selection number without displaying the list. It is also possible to enter the symbol.

In the above embodiment, the display unit 2 consists of a one-line display, and the present invention is particularly suitable for a device with a small display capacity and where a group of symbols must be divided and displayed. When embodying the present invention, the display unit 2 may be, for example, a multi-line display having a display capacity large enough to display various symbols at once. In that case, if the learned symbols are displayed first, those symbols can be easily selected.
Since all symbols are displayed in a fixed order, it is easy to select symbols that have not been learned.

Further, in the above embodiment, code signals of all symbols are stored in the symbol buffer 18, but in order to reduce the buffer capacity, the capacity of the symbol buffer 18 is set to a level that can store code signals of around five types of symbols, for example. It can also be reduced to In that case, a table for generating code signals of each symbol is provided, and the code signals are supplied from the table to the symbol buffer I8 in units of, for example, five in accordance with a predetermined priority order, and are stored in the symbol buffer 18 as necessary. Just update the content.

Further, the present invention is applicable not only to word processors of the kana-kanji conversion type, but also to word processors having keyboards consisting of kanji and kana tablets.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a word processor according to an embodiment of the present invention, FIG. 2 is a perspective view of the word processor of FIG. 1, and FIG. 3 is a flowchart showing a control procedure when inputting symbols to the word processor of FIG. 1. , FIG. 4 is a diagram showing a mode of symbol list display in an embodiment of the present invention, FIGS. 5(a) and (b) are diagrams showing a learning method of a symbol learning buffer in an embodiment of the present invention, The figure shows a symbol buffer learning method in a conventional word processor. 17...Symbol learning buffer, 18...Symbol buffer. Patent applicant Sharp Co., Ltd. Agent
Patent attorneys Aohaku, Boshi and 2 others Figure 1 Figure 4 (.) (b) 6I! 1 (a) 172 No. 1 Todoro (b) f2 No. 2 Kofa

Claims (2)

[Claims] (1) In a word processor that displays a list of various symbols on a display means based on code signals supplied from a symbol buffer, and selects and inputs a desired symbol from among the symbols, the code signals of the various symbols are displayed. a symbol buffer for storing and supplying the code signals to the display means in a fixed priority order determined in advance; The word processor is characterized in that the symbol buffer comprises a symbol learning buffer and a symbol learning buffer, and the symbol buffer and the symbol learning buffer are selectively used to display a list. (2) The word processor according to claim (1), wherein the number of code signals that can be stored in the symbol learning buffer is set to be smaller than the total number of various symbols.