JPS6077224A - Method and device for selecting display of homophone - Google Patents

Abstract

PURPOSE:To select a homonym easily and to improve operability by displaying each homonym, displaying a homonym group collectively and updating the collective display. CONSTITUTION:When ''KOSEI'' (constitution) is to be changed during the formation of a sentence, it is supposed that ''KOSEI'' (public welfare) is selected as the 1st candidate. When a secondary candidate key on a keyboard 11 is depressed, whether the number of candidates is 0 or 1 is discriminated, and since the number of candidates is 12 in this case, whether the screen is to be changed or not is discriminated. In this case, the change of the screen is decided on the basis of information indicating no window display, candidates corresponding to homophone candidate Nos. p=2, 3, 4, 5 are obtained, new window data are provided and an index is put on the most upper position. Then, the preceding candidata is shifted without any processing and plural candidates are displayed in the sub- window 161 together with the 1st candidate. Subsequently, the 2nd candidate is read out and displayed in the main window. When a SHIFT key and the secondary candidate key are depressed, the display of the homonym group is renewed collectively.

Description

DETAILED DESCRIPTION OF THE INVENTION Technical Field of the Invention The present invention relates to a homophone display selection method in a Japanese word processor or similar text processing device employing a kana-kanji conversion method.

<Technical background of the invention and its problems> As a method for displaying and selecting homophones in a conventional kana-kanji conversion type text processing device, only the first candidate homophone of the conversion result is displayed on the display screen. The first method (for example, Japanese Patent Application Laid-open No. 53-56925) updates the display to the next candidate homophone by operating a specific key, or displays all homophones on the display screen, The second method of selecting a desired homophone from among them (for example, JP-A-53
-5'6926) is known.

However, in conventional devices that adopt the first method above, only one homophone is displayed as a result of kana-kanji conversion, so it is difficult to know how many key operations are required to produce the desired word. This poses a problem in that it places a heavy mental burden on the operator and requires a large number of key operations to obtain the desired word.

For example, conventional equipment (word processor WD-2400, etc.)
According to the above, when ``Usei'' is entered in kana in the part to be converted as shown in FIG. 1(a), it is displayed in reverse video on the screen 1. Next, when the user operates the ``mouth bean'', the first candidate is displayed, and the number of homophones is highlighted (Fig. 1(b)). Next, when you press fl, the second homonym is displayed (the number of homophones is reduced by 1 and displayed inverted (Fig. 1 (C)).If you press ku ar I yo further, the homonym is displayed. The number of synonyms decreases by 1 (FIG. 1(d) shows a display example of the fifth candidate).

As described above, with this type of conventional device, the operation is troublesome for the operator, as it is difficult to know how many times the next candidate instruction has to be repeated until the desired word or phrase appears.

In addition, in the conventional second method, the target of conversion in the text being created and the display position of the converted word group are far apart, so the operator's line of sight has to move considerably to select the desired word. Moreover, it is necessary to select a desired word from a large number of homonyms that are all displayed, which poses problems such as placing a heavy burden on the operator.

<Object of the invention> The object of the present invention is to provide a homophone selection method with excellent operability that eliminates the above-mentioned conventional problems.
In order to achieve this object, the present invention provides a means for displaying the first candidate of the conversion result during kana-kanji conversion in the sentence being created, and homonyms of the conversion result displayed in the sentence being created. means for collectively displaying a group of homophones as a result of said conversion in response to the operation of said updating means; and means for collectively updating a display of said homophones displayed as a - finger. and a display selection means for
With such a configuration, the present invention enables, for example, a Japanese word processor that adopts kana-kanji conversion and updates the display of homophones one by one according to instructions from an operator, to display homophones one by one in a sentence being created. In addition to displaying the words (Otsu homophone groups are displayed all at once, and the display of the group of homophones displayed at once is updated at once to make it easier to select homophones. has been made.

<Embodiments of the invention> Hereinafter, the present invention will be explained in detail by giving examples.

Before entering into a detailed description of the embodiments of the present invention, the multi-window display technology that forms the background of the present invention will be described first.

Multi-window display technology is a technology for simultaneously displaying multiple types of information in a superimposed manner on a display terminal device of an information device, thereby making it possible to view two or more types of information simultaneously on the same display. In this case, in order to overlap four screens of two or more types at the same time,
A necessary portion of the content displayed on one side may be hidden by the display on the other side.

To avoid this, these windows can be moved anywhere on the display screen and deleted at any time according to the user's instructions.

A specific example for realizing the multi-window display function will be described next, but various means for realizing the multi-window display function can be considered, and the present invention is not limited to this.

FIG. 2 is a block diagram showing the principle of a multi-window display function in a so-called bitmap CRT.

In FIG. 2, 1o is a central processing unit (CPU), 11
is a CRT controller (CRTc), 12+1CRT
Window controller (WDC) included in C11
, 13 is a frame memory for hundreds of screens each having storage elements corresponding dot by dot to the display on the CRT, 14. 15 and 16 are frame memories for one screen each that constitute the frame memory 13, and 17 is a display on the CRT. It's a screen.

Also address (pl + Q I + r I + Sl)
and (LII+Vl+w++x+) are the addresses of the four corners of each window in the frame memories 15 and 16, respectively, and each of these address information is held in the window controller (WDC) 12.

Also address (p21Q21 r21S2) and (LI
2v2 +W2. lX2 ) are respectively the above addresses (
p+, q++r+, s+) and (ul +vl +WI
+X+) are the addresses of the four corners of each window on the C R, T screen 17 corresponding to
D C) 1.2 holds display priority information between each window, and in the example shown in Figure 2, (uv
wx).

(pqrs) order, that is, frame memory 16, 15°1
The display priority order is maintained so that the images are displayed in the order of No. 4.

In the above configuration, the CRT controller (CR
TC) II is window controller (WDC)] 2
Each frame memo IJ in the frame memory 13 is based on the window address information of the frame memos January 5 and 6, each window address information on the CRTmi surface 17, and the display priority information held by the frame memo IJ] 4,
] 5 and 16 as appropriate, the stored contents are read out, and the contents are displayed on the CRT screen 17 as shown in FIG.

In addition, by appropriately rewriting each of the above-mentioned information held by the window controller (WDC) 12 according to instructions from the CPUI O, the display on the CRT screen 17 is changed to the one shown in FIG.
) to (c), it is possible to easily make changes.

That is, by rewriting the window address on the frame memory 13, display scrolling within the window becomes possible. For example, window address (uI +Vl +
By raising WI +XI by one line (by increasing each y-coordinate of the window address by 11 lines), the display within the window is scrolled as shown in FIG. 3(a).

By rewriting the window address on the CRT screen]7, the window can be moved. For example, the window address ([2+V2+W2+X
By raising 2) by one line (decreasing each y-coordinate of the window address by one line), the upper window on the CRTR 7 screen is moved as shown in FIG. 3(b).

Furthermore, change the window priority, for example, change the window address priority to (+) + Q + r + S
) (u, v, w, x) in the order shown in Figure 3 (c
) The display can be changed as shown in ().

By using multi-window display technology in this way, the dot patterns in the frame memo January 4 to 16 are completely removed even when the screen display is drastically changed as shown in Figures 3 (a) to (c). There is no need to rewrite, and only a few parameters such as the window address held in the window controller (WDC) l2 need to be rewritten.

Therefore, display changes such as those shown in FIGS. 3(a) to 3(c) can be made in a short period of time within one frame time (usually about 1/3 of a second), and therefore do not give the user any sense of strangeness. do not have.

Note that even with a normal display device that does not have a multi-window display function, the display shown in FIGS. 3(a) to 3(c) can be changed by rewriting the contents of the frame memory 14 each time. Note that in this case, it takes more time to switch the display than when using multi-window display technology.

Next, an embodiment of the present invention using the above-described display technology will be described in detail.

FIG. 4 is a block diagram showing an embodiment in which the present invention is applied to a Japanese word processor.

In FIG. 4, reference numeral II denotes a keyboard, and the keyboard 11 includes function keys such as a conversion key, a next candidate key, and a shift key in addition to kana keys.

12 is a central processing unit (CPU), 13 is a kana-kanji conversion module with a built-in dictionary for kana-kanji conversion, and 14 is a CRT.
This is the controller (CRTC) for display devices such as, and this CRTC14 is the window controller (WDC).
It has a built-in I41. 15 is display screen 1 of CRT etc.
17 and 18 are frame memories for one screen each forming the frame memory 15, and the memory 17 corresponds to the display on the display screen 16 one dot at a time. In the main window of , a part of the memory ] 8 corresponds to a homophone sub-window 161 of the display screen 16 .

Further, 19 is a character generator that accommodates character patterns, and 20 is a so-called character code buffer memory, which corresponds to the frame memories 17 and 18 described above.
and 22, respectively.

Further, 23 and 24 are p register and q register respectively, the value of p register 23 indicates the number of the homophone candidate displayed in the main window, and the value of q register 24 indicates the homophone candidate. The display is configured to indicate whether or not a window is displayed by q-0 (no window displayed) and q-1 (window displayed).

Next, the operation of the apparatus configured as described above will be explained with reference to the operation flow shown in FIG.

In the above configuration, if you input kana information from the keyboard 11, the input kana characters will be displayed on the CPU 2.
The character pattern is stored in the character code buffer 21 via the character generator 19, written in the frame memory 17, and displayed in reverse on the display screen 16 according to the contents stored in the frame memory 17. [Figure 6(a)]. At this time, the contents of the p register 23 and the q register 24 should remain p=q=o and be -1.

ゝf\ Note that the window controller (WDC) 14] has a CP
According to the instruction from U12, the display priority order between the windows is set so that the frame memory 18 has priority over the frame memory 17.

Assuming that character information is currently stored in the character code buffer 21 and that the kana-kanji conversion process up to "...equipment" has been completed, the kana information input after that "...
"Kosei" will be converted.

Next, F1 on the keyboard 11]- for kana-kanji conversion processing.
1yo], the flow shown in Figure 5 (steps nl, n
A conversion routine is drawn according to 2).

This conversion routine (step n2) corresponds to the kana-kanji conversion module 13 shown in FIG. 4, and is basically realized by a conventionally known technique. Conversion module 13 is CP
Depending on the kana character string given from UI 2 and the value of p register 23, one kanji character string (kana-kanji conversion result)
Here, the character code buffer 21 is searched to obtain the inverted character string "Kouama" and the kana character string is given to the conversion module 3 along with the information that p=0.

The conversion module 13 first converts P=P+1 in the conversion routine.
= 1, and returns to the CPU 12 the corresponding conversion result of the first candidate ``welfare'', the new p value P = 1, and the total number of homonyms of the conversion result ``12''. Become.

The CPU 12 sets the value P=1 to p based on this information.
Write to register 23. Further, the character string "Koshi" and the total number of homophones "12" are written into the character code buffer 21, and the character pattern is read out from the character generator 19 and written into the frame memory 17. Therefore, in step n3, the first candidate of the conversion result is displayed on the main window of the display screen 16 as shown in FIG. 6(b), and the number of homophones is displayed in reverse video. At this time, the value q=0 of the q register 24 remains unchanged.

Here, when 2 on the keyboard 11 is operated, the homonym window of ``B'' is set and a plurality of (5 in the example) are displayed on the window 161 according to the flow (111 to n17) in FIG. At the same time as the conversion candidates are displayed, the next candidate kanji string will be displayed in the main window.

That is, when the 口葎亙LOW is operated in step nil, it is first determined in step n12 whether the number of candidates is 0 or 1, and in this case, since the number of candidates is "12", the process moves to step nJ3. In step n13, it is determined whether or not the screen has not yet been changed. In this case, based on the information of q=0, it is determined that the screen has been changed, and the process moves to step n14. In step n14, P=2.3, 4.5 is obtained, new window data is arranged, and an index "-" is added to the top of the candidate. Then step n
15, the previous candidates are skipped, and a plurality of candidates (5) are displayed in the sub-window together with the first candidate obtained first (n16).

Next, the process moves to step n17 to execute a conventional next candidate routine to read out the second candidate and complete preparations for displaying the second candidate homophone on the main window.

FIG. 7 is a flow diagram showing details of the processing operation when the next candidate key is operated, and step n12 in FIG.
Processing flow corresponding to ~n17 or step n111~
It is shown in n120 and n130-n144.

To explain the new window creation operation when l is operated in FIG. 7, first step n113
Clear the window by setting Renstar R in CPUI 2 to 1, then set the first candidate to R in the window.
Write it in the first position (in this case, "welfare"). Then R
=R+1 n115), and determine whether the value of P has reached the maximum value or whether the value of R has reached 6 n116. n117), ``Increase P by 1 (P-P+1) until the condition described in - is reached. Search for the next candidate kanji string from dictionary] 3, return it to the CPU 12, write the candidate in the Rth position of the window, and Steps 0118 to n120 of executing =R+1 are repeated. Through this operation, the kanji string "composition" corresponding to P-2, '3, 4, 5 is created.
, "Fair".

"Rehabilitation" and "Offensive J" are obtained. Then, the character codes of the first to fifth candidates obtained by this operation are written to the character code buffer 22, and the index r + ) Write the ++ character code. Next, these character patterns are read from the character generator 19 and written into the frame memory 18 in which the window address (p+, q+ +rl+sl) is set in the area where the five homophone phrases are written.

Next, while executing R=R-], the previous candidate routine is executed until R=], a blank feed of the previous candidate is executed, and the contents of the p register 23 are looked at the previous ← (P = 1) (7 ) state. Next, the q register 24 is set to 1, and the window address (p2 + q2 + r2 + S2) is determined as the display target position of the sub homophone window on the display screen 16, and 5' homophones are displayed in the window. 16
1 (n133).

Next, the next candidate processing routine of step n144 is executed, and the second candidate kanji strings "composition" and "11" corresponding to P=2 are executed.
is written into the character code buffer 21, the pattern is read out from the character generator 19 and written into the frame memory 17, and the second candidate of the conversion result is displayed on the main window of the display screen 16 as shown in FIG. 6(C). Display along with the number of homophones.

Also, if you press [A II 3] in the state of FIG. 6(c), steps n11 to n13 and n18 of FIG. n16. n17
The following operations are performed according to the flow. That is, the display itself of the homophone window 16 does not change, but the display of the index "k" moves down one position, and the next candidate is displayed on the main window by the same operation as before (n17).

Step n11 in FIG. n111. n112. n12
1-n123. n]4], n143, and n144 This is a detailed flow corresponding to the above operations, and first step n1
ll, n]12. n12], n122, and n123 are all determined to be rNOJ, and the determination in step n141 is determined to be rNOJ, and in step n143, the code of index 1k'' in the character code buffer 22 is shifted down by three lines, and the corresponding Also on the frame memory 18, the pattern of the index "G" is written one line below. By subtracting the missing number and the next candidate routine (n144), the kanji string "Kei" corresponding to P=3 and the remaining number of homophones "]0" are obtained. Next, if you display the window according to the flow shown in Figure 5, the index "Chu" will be lowered to the bottom of the homonym display window.
Furthermore, the kanji string "fairness" corresponding to P=3 and the number of remaining homophones "10" are displayed on the main window.

If there is another next candidate key-in, the above operation is repeated.

Therefore, if the next candidate key-in continues three times from the state shown in FIG. 6(C), the main window will display "Offensive J."

``08'' becomes, and the display in the homophone sub-window ``2'' shifts to the left side of ``1 Offensive'' with the index ``reward'', resulting in the display screen shown in FIG. 6(d).

Moreover, in the state of FIG. 6(c) (P=2) [.

When the e key is pressed, steps n20 to n19 in FIG.
It operates to display the next five candidate groups on the sub window according to the flow from n14 to n17.

Figure 8 shows when the lp and d keys are operated. FIG.

In FIG. 8, step n201. n203. n204
are determined to be rNOj, and step n20
5, and the operation (n2j7) of subtracting the next candidate is executed until the value of P is divisible by 5. Therefore, in this case, the kanji strings ``fair'', ``rehabilitation'', and ``offensive'' corresponding to P=3, 4, and 5 are obtained, but nothing is done with these kanji strings and they are simply discarded. Next, set R=1 to clear the sub window display information, and determine whether the value of P has reached the maximum value or whether the value of R has reached 6.n207. n208), the next candidate search routine, writing the candidate in the Rth position of the window, and R=R+1 operations (n209-211) are repeated until the above condition is reached. With this operation, P=6, 7, 8, 9
, IO corresponds to the kanji strings ``correction'', ``proofreading'', ``
Posterity”.

Obtain ``afterlife'' and ``fixed star.''

Then, the character codes of the 6th to 10th candidates obtained by this operation are written to the character code buffer 22, and P=6
Write the character code of the index ′′pa” before the “correction” corresponding to . Next, these character patterns are read from the character generator 19, and the window address (p++q
+, r++s+) is written to the frame memory 18 set.

Next, while R=R-1 is executed until R=l, the previous candidate routine is executed and the previous candidate is idle-fed to return to the state of P=5 (n2]2-n214). Next, q=] is set and the updated five homophones are displayed on the sub window 161 (n215).

Next, execute the next candidate routine in step n216 and P=
Write the 6th candidate kanji string "Kosei" and "7" corresponding to 6 into the character code buffer 2], read the pattern from the character generator 19, and store it in the frame memory 17.
, and the sixth candidate as the conversion result is displayed on the main window of the display screen 16, as shown in FIG. 6(e), along with the number of remaining homophones.

Also, keep pressing the mouth II lock key, or press the 4F
OK, by pressing the bulge II lokey, the contents of the homophone window will change according to the same operation as above, and the 11th and 12th candidates will be displayed, and the 11th candidate will be displayed in the main window. (Figure 6(f)).

Continue to press the rz main key, or press the 4F key.
By pressing the I key, the display of homophone groups will be displayed as shown in Figure 6).

Furthermore, in any of the states shown in FIGS. 6(b) to 6(g) above, by inputting the kana of the next phrase from the keyboard 11, the candidate for conversion is determined, and the process moves to the next step.

That is, for example, in the state shown in FIG. 6(c), when a kana character is input from the keyboard 11, the flow shown in FIG. Set q=0, erase the window, and set :1 on character code buffer 2]
1- Delete: and write a new character code for "yo". Next, the character pattern is written into the frame memory 17. By performing the same operation for the kana character inputs "u" and "so", a display screen as shown in FIG. 6(h) is obtained.

Here, by pressing the m key, kana-kanji conversion is executed for the kana input "yoso", and a screen that displays the first candidate equivalent to that shown in Figure 6(b) is displayed. can be selected to be displayed.

Note that the flow from steps n123 to n129 in FIG. 7 shows the processing flow for updating the display of the sub window when the key is operated in the screen state shown in FIG. 6(d). Since the flow is the same as the processing steps n207 to n211 in FIG. 8 described above, the explanation thereof will be omitted.

In addition, FIG. 9 shows operation 1 of the fl key. Fig. 10 shows a specific processing flow when f, nll1
This shows the specific processing flow when operating the keys, and each action moves the displayed candidates back to the previous one. The operation is similar to that shown in FIGS. 7 and 8 except that the direction of increase/decrease in the R register is reversed, so the explanation will be omitted.

According to the embodiment shown above, as shown in FIGS. 6(a) to 6(h), one word resulting from the conversion is displayed on the main window as before, and a homophone window is also displayed in the vicinity thereof. and is displayed. Therefore, it is possible to select a desired homophone without knowing in advance what homophone will be output by a future e key operation. In addition, since the homophone display on the multi-window is updated all at once using the Lokey, the number of key operations required to obtain the correct answer candidate is reduced.

Also, when compared with the conventional method, there is no difference between the two when either the first or second candidate is correct, but when any of the third to fifth candidates is correct, there is no difference in the number of key operations between the two. However, when it turns out that the second candidate is not the correct answer, if you look at the homophone group on the sub multi-window, you can find the third option.
~ You can confirm that the fifth candidate is correct,
Operators can rest assured! Can operate keys.

Also, if any of the 6th to 10th candidates is correct, and it turns out that the 2nd candidate is not the correct answer, if you look at the homophone group on the multi-window, you will see that the 3rd to 5th candidates are also not correct. You can check immediately Q, [mouth 1
By operating one key, the display of the 6th to 10th candidates can be obtained, and the number of key operations required to obtain the correct answer can be reduced compared to the conventional method.

Moreover, when the 1st J or 12th candidate is correct, l from the 6th candidate to the 11th candidate.

Since it is possible to move immediately by operating the 1m key, it becomes possible to further reduce the number of key operations.

Furthermore, according to the embodiment of the present invention, the first candidate of the conversion result during kana-kanji conversion is displayed in the sentence being created, as in the past, but the same sound of the conversion result displayed in this sentence is displayed. In response to the operation of the means for updating the word display, a plurality of (for example, 5) homophones resulting from the conversion are displayed at once, and the display of the group of homophones displayed at once is updated at once. However, by adopting such a display selection method, there are the following advantages.

In other words, recently, as kana-kanji conversion technology has progressed and advanced grammar tests are being conducted, the exchange rate has improved.
%, approx. 95% up to the 5th candidate, approx. 97% up to the final candidate
The correct answer can now be obtained.

On the other hand, if the first candidate is the correct answer, it is not necessary to display the homophone groups after the second candidate. Moreover, the accuracy rate of the first candidate is 85%. Therefore, when displaying the first candidate homophone for which 85% of the total answers are correct, the second and subsequent candidates are not displayed to prevent the display from being annoying to the operator, and also to prevent the display of the second and subsequent candidates. The homophones of the group are displayed at once, and the number of displayed homophones is limited to, for example, 5 to facilitate the selection of the desired homophone, and the display of the group of homophones displayed at once is updated at the same time as desired. This allows you to quickly select homophones for .

Note that the type of each key in the above embodiment is not limited to this, and may be used in combination with other keys, or may be arbitrarily changed such as providing a dedicated key.

<Effects of the Invention> As described above, according to the present invention, homophones are displayed one word at a time in a sentence being created, and a plurality of homophones are displayed at once. Since the display of the homophone group is updated all at once, the selection of homophones can be performed quickly with fewer key operations.

[Brief explanation of drawings]

Figure 1 is a diagram showing a display example of the homophone selection operation during conventional kana-kanji conversion, Figure 2 is a functional block diagram of the multi-window display that is the background of the present invention, and Figure 3 is the display of the multi-window display. Figure 4 shows an example of switching the present invention to a Japanese word processor. FIG. 5 is a block diagram illustrating an embodiment of the present invention when appropriate processing is performed. FIG. 6 is a diagram illustrating the operation flow of an embodiment of the present invention. FIG. A diagram showing a display example, FIG. 7 is a diagram showing a detailed operation flow corresponding to the next candidate key operation, FIG. 8 is a diagram showing a detailed operation flow corresponding to the next candidate key operation, and FIG. 9 is a diagram showing the detailed operation flow corresponding to the next candidate key operation. A diagram showing a detailed operation flow corresponding to key operations, FIG. 10 is 5HIFT. FIG. 7 is a diagram showing a detailed operation flow corresponding to MiJ candidate key operations. 11 ・Key fodder, 12...Central processing unit (CPU
), 13 - Kana-Kanji conversion dictionary, 14... CRT controller, 16... Display screen, 17.18... Frame memory, 21.22... Character code buffer, 1
61...Sub window display area. Agent Patent attorney Aihiko Fukushi (2 others) (a) / Figure 1 (d) (a) (d) (j)) (e) (() (f) (g) Figure 6

Claims (1)

[Claims] 1. Means for displaying the first candidate of the conversion result during kana-kanji conversion in the sentence being created, and updating the homophone of the conversion result displayed in the sentence being created. means for collectively displaying the homophone groups of the conversion results in response to an operation of the updating means; and display selection means for collectively updating the display of the homophone groups displayed with the - finger. A homophone display selection method characterized by: