JPS61265664A - Homonym selecting mechanism in word processor - Google Patents

Abstract

PURPOSE:To improve operability in terms of selection of a homonym by calculating a displacement between the top position of a currently displayed homonym and the position shown by a cursor position memory element with the aid of them and providing a comparison character number counter storing said displacement. CONSTITUTION:When a cursor is shifted to a character different from a target to press a next candidate key, the cursor position memory element 31 is set, and a character string, which is the homonym of the character pointed by the cursor and is presently displayed on a CRT 6, is set to a current display character buffer 33. Then how many characters lie before the cursor point in the same homonym is calculated from the top position of the homonym and the position of the cursor point, and the result is set to the comparison character number counter 32. In the subsequent actions, it is assumed that the string before the cursor point is secured, and the operation is aimed only at the homonym after the cursor point. Then the string after cursor point is again displayed, thereby reducing the number of times pressing the next candidate key.

Description

TECHNICAL FIELD OF THE INVENTION The present invention relates to a homophone selection mechanism in a word processor.

[Technical background of the invention and its problems]

Today, as offices become increasingly automated, it is true that Japanese word processors are at the core of this and have spurred the progress. When creating a Japanese document using this word processor, one thing that cannot be avoided is the selection of homonyms. The selection method is a sequential selection method in which homophones (hereinafter referred to as homonyms) are selected each time they appear, and a batch selection method in which they are selected all at once after typing the document. There is.

Conventionally, in either of these methods, even a compound word, for example, was treated as one homophone character string. Therefore, the change on the screen caused by pressing the next candidate key is naturally 1) for all of the homophone character strings, and the number of combinations is nXm in the case of 2 combinations, by simple calculation. An example is shown in FIG.

This has the disadvantage that, in terms of probability, a large number of next candidate keys must be pressed in order to indicate the desired character string. Another drawback that cannot be overlooked is that the number of characters that change is large, which places a burden on the operator.

[Object of the Invention] The present invention has been made in view of the above-mentioned drawbacks, and when selecting homophones, it is assumed that the words before the cursor point are fixed, and the selection is limited to homophones that are different after the cursor point. ,
The object of the present invention is to provide a homophone selection mechanism in a word processor that improves the operability in homophone selection by redisplaying only the part after the cursor point.

[Summary of the invention]

When selecting a homophone, the desired character string is displayed using the next candidate key, but at this time, unlike the conventional method, the present invention simply redisplays all the character strings of the homophone where the cursor is located in order of priority. The character string before the cursor point is considered to have already been determined, and the character string before the cursor point is selected to be the same as the character string before the cursor point. This improves operability by reducing the number of presses of the next candidate key and the number of changed characters.

For this purpose, in addition to the conventional configuration of this type of word processor, we also have a compared character buffer that holds the homophone character string, and a register that records the start position of the currently displayed # homophone and the cursor position register. A comparison character number counter that calculates and stores it, and when the next candidate key is pressed,
The current display character buffer that holds the character string data of the corresponding homophone currently displayed and the character string data indicated by the compared character buffer described above are compared for the number of characters indicated by the comparison character count counter, and the result is determined as a match or mismatch status. A comparison circuit for outputting and a display character register 7a for holding a character string changed when a comparison result is found by the comparison circuit are added.

[Embodiments of the invention]

Hereinafter, embodiments of the present invention will be described in detail using the drawings.

FIG. 1 is a four-dimensional diagram showing an embodiment of the present invention. In the diagram, 1 indicates keys necessary for document creation and kanji selection keys;
This is the keyboard r including the next candidate key. Reference numeral 2 denotes a keyboard control device that decodes the key code that comes through the keyboard 1 and starts the kana-kanji conversion device 7 and the editing device based on it. This feature allows you to override, insert, verify, delete characters, select homonyms, etc.
4 is a document buffer that holds data necessary for document editing such as character strings and character attributes; and 5 is a CRT control device that controls the CRT 6.

FIG. 2 is a block diagram showing only the portions of the editing apparatus shown in FIG. 1 that are related to the present invention. In the figure, blocks labeled with the same numbers as in FIG. 1 are the same as those in FIG. 1.

In the figure, 31 is a cursor position memory
, 32 are the document buffer 4 and the cursor position memory 31
This is a comparison character counter that stores the result calculated from . Further, 33 is a current display character buffer sb that stores the currently displayed character string of the corresponding homophone, and 34 is a compared character buffer that stores the character string of the next homophone candidate. Reference numeral 35 denotes a comparison circuit that compares the contents set in the currently displayed character buffer 33 and the compared character buffer 34 by the amount specified by the comparison character number counter 33. 36 is a 772 circuit, and the result of the AND operation is supplied to the display buffer 37. The display character buffer 37 holds character strings to be redisplayed. 38 is a homophone next candidate counter (CNT). The functions and other details of each of the blocks mentioned above will be described later.

FIG. 3 is a diagram conceptually showing the flow of displaying the next candidate character realized by the present invention.

Hereinafter, the operation of the embodiment of the present invention will be explained in detail.

It is assumed that the operator has already entered the document shown in FIG. 4 through the kana-kanji conversion process by using an override input function or the like. The following explanation will be given in FIG. 2, and the resulting changes on the screen are shown in FIG.

Furthermore, the priority order of homophones is assumed to be in accordance with FIG. 4 as in the conventional case.

Now, the operator first indicates his intention to select a homophone. You can press the kanji selection key to switch to batch selection mode, or you can stay in input mode and move the kernel to the position where you want the next candidate to be displayed. In this example, the target character string is "standard specification document", so move the cursor to the character string that is different from the target character, ``Tokoro'', and press the next candidate key. It is keyboard 1. The mechanism of the present invention is started by passing through the keyboard control device 2 and the editing device 1. That is, first, the cursor position memory 31 is set. Next, the character string currently displayed on the CRT 6, which is the homophone at the cursor point, is set in the current display character buffer 33. Furthermore, from the beginning position of the homophone and the position of the cursor point, it is calculated whether there is a small letter before the cursor point within the homophone, and the result is set in the comparison character number counter 32. In this example, it is 4".

Next, the next candidate character string is obtained from the document buffer 4 and set in the compared character buffer 7a 34.

“Standard Planning Office” is set in this column. Next, the comparison circuit 35 operates and compares the currently displayed character buffer 33 and the compared character buffer 34 by the number of characters specified by the comparison character number counter 32.

In this example, the four characters of "standard standard" and "standard project" will be compared, but since the third and fourth characters are different, the results will be inconsistent.

Its status acts like incrementing counter 38. Next, as in the previous case, the next homophone is set in the character buffer 34 to be compared by the counter 38, and comparison is performed. Comparisons are made one after another in this way, and the 6th priority homophone shown in FIG.
Display character buffer 37 and current display character buffer 3
3, the remaining characters skipped from the comparison character buffer 34 by the value indicated by the comparison character counter 32 are set at a predetermined position. In this example, the current display character buffer 33 is
, and the display 1 character no 9 tsufa 37 is “sign”
is sected. Next, the cursor position information of cursor position memory 3 and the information of display character 7a 37 are transferred to the CRT.
The information is transmitted to the control device 5 and displayed on the CRT 6. This pattern is shown as (b) in FIG. The operator looks at this and presses the next candidate key while confirming that it is not the desired key.

By performing the same operation as described above (however, the counter 38 is not reset and retains the previous information), the next output on the CRT display 6 is as shown in FIG. This is "Book 1" shown as one.Here, selection is made only after the desired character string is obtained.

As explained above, in the conventional method, it is necessary to press the next candidate key 6 times (Fig. 4), but with the present invention, 92
This means that only one operation is required.

The number of characters that change each time has also been reduced from 5 characters to 1 character. In this example, "Conventional Method Teha 1 Standard" is always the same and does not change visually, but in reality, the entire homophone may change dramatically. From this point of view as well, the present invention has a great effect.

〔Effect of the invention〕

As explained above, when selecting a homophone, the target character string is displayed using the next candidate key. At this time, unlike the conventional method, the present invention can display all the homophones on which the cursor is placed. Rather than simply redisplaying the string in priority order, it assumes that it is fixed before the cursor point,
By narrowing down to only the homophones that are different after the cursor point and redisplaying only the words after the Kahnle point, the following effects can be obtained, and as a result, the operability can be improved.

(1) The target character string is displayed quickly. In other words, the number of times the next candidate key is pressed is reduced.

(2) Character strings that change on the screen also disappear.

Therefore, the burden on the operator is reduced, and the response speed is also slightly faster.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention. FIG. 2 is a block diagram showing the internal configuration of the editing device shown in FIG. 1. FIG. 3 is a block diagram showing the internal configuration of the editing device shown in FIG. 1. FIG. FIG. 4 is a diagram showing the flow of the display operation of the homophone next candidate character according to a conventional example. ! ...Editing device, 31...Cursor position memory, 3
2... Comparison character number counter, 33... Current display character buffer, 34... Compared character buffer, 35...
...Comparison circuit, 36...AND circuit, 37...Display character buffer. Applicant's representative Patent attorney Takehiko Suzue Figure 1 Figure 2

Claims (1)

[Claims] A keyboard with a data key used for document input, a kanji selection key that conveys the intention to select a homophone to the device, and a next candidate key that instructs the display of the next candidate character when selecting a homophone. A document buffer in which the input document containing the heteronymous character string is stored; a current display buffer that holds the currently displayed character string of the homophone when the next candidate key is pressed; and a kanji selection key. A compared character buffer that obtains and holds a homophone character string corresponding to the value indicated by the homophone priority number, which is reset by pressing the key and whose contents are updated by pressing the next candidate key; The displacement is calculated from the cursor position register that stores the cursor position when the next candidate key is pressed, the starting position of the currently displayed homophone, and the value indicated by the cursor position register above, and this is stored. a comparison character count counter for comparing, a comparison circuit for comparing the contents of the character string data indicated by the display character buffer and the compared character buffer by the number of characters indicated by the comparison character count counter and outputting the result; When a comparison match is detected, a display character buffer in which the remaining characters skipped by the number of characters indicated by the comparison character counter from the character string indicated by the compared character buffer are set in a predetermined position and stored; and the display character. 1. A homophone selection mechanism in a word processor, comprising: a display device for displaying contents stored in a buffer.