JPH0630105B2 - Homophone display method - Google Patents

Description

Description: TECHNICAL FIELD OF THE INVENTION The present invention relates to a homophone display method in a sentence processing device such as a Japanese word processor which adopts a kana-kanji conversion system.

<Technical background of the invention and its problems> As a method of selecting and displaying a homophone in a conventional kana-kanji conversion type sentence processing device, only the first candidate homophone of the conversion result is displayed on the display screen. A first method for updating the display of the next candidate homophone by operating a specific key (for example, Japanese Patent Laid-Open No. 53-56925), or displaying all homophones on the display screen, A second method for selecting a desired homophone from them (for example, Japanese Patent Laid-Open No. 53
-56926) is known.

However, since only one homophone is displayed as the Kana-Kanji conversion result in the device adopting the above-mentioned first method, it is possible to know how many key operations the desired word comes out. There was a problem that the operator could not do so and the mental burden on the operator was heavy, and the number of key operations required to obtain a desired word was large.

For example, according to the conventional apparatus, when the conversion target portion (this way) is input in kana as shown in FIG. 1 (a), it is displayed in reverse on the screen 1. next When the key is operated, the first candidate is displayed and the number of homonyms is highlighted (FIG. 1 (b)). next When the key is operated, the second candidate is displayed and the number of homonyms is reduced by 1 and displayed in reverse (FIG. 1 (c)).
Further As the key is pressed, the number of homonyms decreases by 1 (FIG. 1 (d), a display example of the fifth candidate is shown).

As described above, in the conventional apparatus of this type, it is difficult for the operator to operate, such as not knowing how many times the next candidate instruction should be given before the desired word comes out.

Further, in the above-mentioned second conventional method, since the conversion target in the sentence being created and the display position of the word group of the conversion result are apart, the movement of the operator's line of sight for selecting the desired word becomes large. Furthermore, it is necessary to select a desired phrase from a large number of homonyms which are all displayed, which poses a problem of placing a heavy burden on the operator.

<Object of the Invention> The present invention has been made for the purpose of providing a homophone display method with excellent operability in which the above-mentioned conventional problems are eliminated, and the object of the homophone display method of the present invention is: The first conversion instruction displays the first candidate of the homonym, the next candidate instruction operated after the conversion instruction collectively displays the homonyms, and indicates the next candidate in batch display for each next candidate instruction. The designated next candidate is displayed instead of the previously displayed candidate. Therefore, in the homophone display method of the present invention, the kana character string input from the input means is displayed on the display means. In succession to the column, in response to the conversion instruction, the first candidate of the homonym group that is a conversion candidate for the kana character string is displayed in place of the kana character string, and in accordance with the next candidate instruction, A table showing a predetermined number of candidates from the homophone group that are candidates for conversion In addition, the next candidate is indicated in the displayed plurality of candidates, and the candidate is displayed in place of the candidate displayed in the kana character position. The candidate is designated and displayed in place of the candidate displayed at the kana character position.

<Examples of the Invention> Hereinafter, the present invention will be described in detail with reference to Examples. Before starting a detailed description of the embodiments of the present invention, a multi-window display technique which is a display technique suitable for application to the homophone display method of the present invention will be described first.

The multi-window display technology is a technology for simultaneously displaying a plurality of types of information on a display terminal device of an information device in an overlapping manner, and by doing so, it is possible to simultaneously view two or more types of information on the same display. In this case, since two or more types of screens are overlapped at the same time, a necessary part of one display content may be hidden by the other display.

In order to avoid this, these windows are designed so that they can be moved anywhere on the display screen and can be deleted at any time according to the user's instruction.

Next, one specific example for realizing the multi-window display function will be described, but various means for realizing the multi-window display function are conceivable, and the present invention is not limited to this.

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

In FIG. 2, 10 is a central processing unit (CPU), 11
CRT controller (CRTC), 12 CRTC
A window controller (WDC) included in 11;
Reference numeral 13 is a frame memory for several screens having storage elements corresponding to the display on the CRT one dot at a time, 14, 15 and 1
Reference numeral 6 is a frame memory for each one screen constituting the frame memory 13, and reference numeral 17 is a CRT display screen.

Further, the addresses (p ₁ , q ₁ , r ₁ , s ₁ ) and (u ₁ ,
v ₁ , w ₁ , x ₁ ) are the addresses of the four corners of each window of the frame memories 15 and 16, respectively, and these address information are the window controller (WDC) 1
Held within 2.

In addition, the addresses (p ₂ , q ₂ , r ₂ , s ₂ ) and (u ₂ ,
v ₂ , w ₂ and x ₂ are the addresses (p ₁ and q), respectively.
₁ , r ₁ , s ₁ ) and (u ₁ , v ₁ , w ₁ , x ₁ ) are the addresses of the four corners of each window on the CRT screen 17 corresponding to (u ₁ , v ₁ , w ₁ , x ₁ ). WDC) 12.

Further, the window controller (WDC) 12 holds the display priority information between the windows, and in the example shown in FIG. 2, the order (uvwx), (pqrs), that is, the frame memories 16 and 15. , 14 are displayed in that order.

In the above configuration, the CRT controller (CR
The TC) 11 stores in the frame memory 13 based on the window address information of the frame memories 15 and 16 held by the window controller (WDC) 12, the window address information on the CRT screen 17 and the display priority information. Each frame memory 14, 15 and 16
To read the stored contents and select C
It will be displayed on the RT screen 17 as shown in FIG.

Further, the display on the CRT screen 17 is performed by appropriately rewriting the above-mentioned respective information held by the window controller (WDC) 12 in accordance with a command from the CPU 10 and shown in FIG.
It can be easily changed as shown in (c).

That is, by rewriting the window address on the frame memory 13, display scrolling within the window becomes possible. For example, the window address (u ₁ , v ₁ ,
By scrolling up w ₁ , x ₁ ) by one line (each y coordinate of the window address is minus one line), display scrolling in the window as shown in FIG. 3A is performed.

Further, the window can be moved by rewriting the window address on the CRT screen 17. For example, by increasing the window address (u ₂ , v ₂ , w ₂ , x ₂ ) by one line (decreasing each y coordinate of the window address by one line), the CRT screen 17 as shown in FIG. 3B is displayed.
The upper window is moved.

Furthermore, the priority of the window is changed, and the priority of the window address is (p, q, r, s) (u, v,
By changing the order of w, x), the display can be changed as shown in FIG.

By using the multi-window display technique as described above, the dot patterns in the frame memories 14 to 16 are completely rewritten even when the screen display is largely changed as shown in FIGS. 3 (a) to 3 (c). There is no need, and only a few parameters such as the window address held in the window controller (WDC) 12 need to be rewritten.

Therefore, the display change as shown in FIGS. 3 (a) to 3 (c) can be made within a short time within one frame time (usually about 1/30 seconds), and the user does not feel any strangeness.

Even with a normal display device having no multi-window display function, the display shown in FIGS. 3A to 3C can be changed by rewriting the contents of the frame memory 14 each time. In this case, it takes a longer time to switch the display as compared with the one using the multi-window display technique.

Next, one embodiment of the present invention using the above display technique 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 11 denotes a keyboard, which is used in addition to the kana input key. Key, Key, Includes function keys such as the (shift) key. Reference numeral 12 is a central processing unit (CPU), 13 is a kana-kanji conversion module incorporating a kana-kanji conversion dictionary, and 14 is a controller (CRTC) for a display device such as a CRT.
4 has a window controller (WDC) 141 built therein. Reference numeral 15 is a frame memory having a storage capacity of several screens corresponding to the display on the display screen 16 of a CRT or the like, one dot at a time.
5, which is a frame memory for one screen constituting the memory 5, and the memory 17 is a main window of the display screen 16 and a memory 18
Is a sub-window 161 of the same phoneme on the display screen 16.
It corresponds to. Further, 19 is a character generator accommodating a character pattern, and 20 is a so-called character code buffer memory.
Has character code buffers 21 and 22 corresponding to the frame memories 17 and 18, respectively.

Reference numerals 23 and 24 respectively denote a p-register and a q-register. The value of the p-register 23 indicates what number the candidate of the homophone word displayed in the main window is, and the value of the q-register 24 indicates the same phoneme word. The presence / absence of a window display is shown by q = 0 (no window display) and q = 1 (window display).

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

When kana information is input from the keyboard 11 in the above-described configuration, the input kana character is stored in the CPU 12.
Is stored in the character code buffer 21 via
The character pattern is read from the character generator 19 and written in the frame memory 17, and the display screen 16 is displayed according to the contents stored in the frame memory 17.
It is highlighted on the top [Fig. 6 (a)]. At this time, the contents of the p register 23 and the q register 24 remain p = q = 0.

The window controller (WDC) 141 has a CP
According to the instruction of U12, the display priority between windows is set so that the frame memory 18 has priority over the frame memory 17.

Assuming that the character information is now stored in the character code buffer 21 and the kana-kanji conversion processing up to "... apparatus" has been completed, the kana information "kosei" input after that is the conversion target. Become.

Next, on the keyboard 11 for Kana-Kanji conversion processing When the key is operated, the conversion routine is drawn according to the flow of FIG. 5 (steps n ₁ and n ₂ ).

This conversion routine (step n ₂ ) corresponds to the Kana-Kanji conversion module 13 in FIG. 4, and is basically realized by a conventionally known technique. Conversion module 3 is CPU1
It is configured to return one kanji character string (kana-kanji conversion result) depending on the kana character string given from 2 and the value of the p register 23. Here, the character code buffer 21 is searched. To get the reverse string "Kousei",
The kana character string is given to the conversion module 13 together with the information of p = 0.

The conversion module 13 first p = p + 1 in the conversion routine.
= 1, and the corresponding first candidate “welfare” of the conversion result, the new p value p = 1, and the total number “12” of homonyms of the conversion result are returned to the CPU 12. Become.

Based on this information, the CPU 12 sets the value p = 1 to p
Write to register 23. In addition, the character string “welfare” and the total number of homophones “12” are written in the character code buffer 21, and the character pattern is read from the character generator 19 and written in the frame memory 17. Therefore, in step n ₃ , the sixth window is displayed on the main window of the display screen 16.
As shown in FIG. 6B, the first candidate of the conversion result is displayed and the number of homonyms is highlighted. At this time, the value q = 0 of the q register 24 does not change.

Here on the keyboard 11 When a key is operated, a sub homophone window is set according to the flow (n _{11 to} n ₁₇ ) of FIG. 5, and a plurality of (five in the embodiment) conversion candidates are displayed on the window 161. At the same time, the next candidate kanji string will be displayed in the main window.

That is, in step n ₁₁ When the key is operated, it is determined first whether the number of candidates in step n ₁₂ is 0, 1, now when the number of candidates is "1
2 "a is for the process proceeds to step n _13, it is determined whether no change in the screen in step n ₁₃ is now the case q = 0
It is judged that there is a screen change based on the information of
It goes to n _14, p = 2,3,4,5 in step n ₁₄
The candidate corresponding to is obtained, new wind data is prepared, and the index "" is added to the top. Then step n
_{The process} shifts to _15, and the first candidate obtained first by skipping the previous candidate is displayed with a plurality of (5) candidates in a sub-window (n ₁₆ ).

Next, the second on the main window reads the second candidate by performing the conventional next candidate routine proceeds to step n ₁₇
Complete the preparation for displaying the candidate homophones.

Figure 7 FIG. 6 is a flow chart showing details of processing operation when a key is operated, and processing flow corresponding to steps n _{12 to} n ₁₇ in FIG. 5 is shown in steps n _{111 to} n ₁₂₀ and n _{130 to} n _144. There is.

In Figure 7 Describing the new window creation operation when operating the keys, first to clear the window is set to 1 to register R in CPU12 at step n _113, then the first candidate R th window (first) Write (in this case "welfare"). Next, R = R + 1 is executed (n ₁₁₅ ), and it is determined whether the value of p is the maximum value or the value of R is 6 (n ₁₁₆ , n ₁₁₇ ), and the above Step n _{118 of} searching the dictionary 13 for a kanji string of the next candidate in which p is increased by 1 (p = p + 1) until the condition is reached and returning it to the CPU 12 and writing the candidate in the Rth window and executing R = R + 1 Repeat ~ n ₁₂₀ . By such operation, p
The kanji strings “composition”, “fairness”, “rehabilitation”, and “offensive” corresponding to = 2, 3, 4, 5 are obtained. Then, the character codes of the first to fifth candidates obtained by this operation are written in the character code buffer 22, and the "configuration" corresponding to p = 2
Write the character code of the index "" before. Next, these character patterns are read from the character generator 19 and written in the frame memory 18 in which the window addresses (p ₁ , q ₁ , r ₁ , s ₁ ) are set in the area for writing five homophones.

Next, while executing R = R−1, the previous candidate routine is executed until the value of R = 1 is reached, and the previous candidate is skipped, and the contents of the p register 23 are returned to the previous state (p = 1). return. Then q
The register 24 is set to 1, and the window address (p ₂ , q ₂ , r ₂ , s ₂ ) is determined based on the display target position of the sub homophonic window on the display screen 16 and the five homophones are determined. Display words on window 161 (n
₁₃₃ ).

Next, the next candidate processing routine at step n ₁₁₄ is executed to execute p =
The second candidate kanji character strings “composition” and “11” corresponding to 2 are written in the character code buffer 21, and the pattern is read from the character generator 19 to be read from the frame memory 1
No. 7 and the sixth on the main window of the display screen 16.
As shown in FIG. 7C, the second candidate of the conversion result is displayed together with the number of remaining homonyms.

Also in the state of FIG. 6 (c) Step n ₁₁ ~n ₁₃ and n _18, n ₁₆ of FIG. 5 key is pressed,
The following operation is executed according to the flow of n ₁₇ . That is, the display itself of the homophone window 161 does not change, and the display of the index “” moves down one by one, and the next candidate is displayed on the main window by the same operation (n ₁₇ ) as the conventional one.

Step n ₁₁ of FIG. _{8, n 111, n 112, n} 121 ~n 123, n 141
~ N ₁₄₃ and n ₁₄₄ are the detailed flow corresponding to the above operation. First, all the judgments in steps n ₁₁₁ , n ₁₁₂ , n ₁₂₁ , n ₁₂₂ and n ₁₂₃ are judged as "NO", and in step n ₁₄₁ The determination is “NO”, and in step _n143 , the code of the finger bridge “” in the character code buffer 22 is shifted down by one line, and the pattern of the index “” is moved down by one line on the corresponding frame memory 18 as well. Write to. Next candidate routine (n
₁₄₄ ) is subtracted to obtain the Chinese character string “fair” corresponding to p = 3 and the remaining homophone number “10”. Then, when the window is displayed according to the flow of FIG. 5, the index “” drops down by one on the homophone display window, and the Chinese character string “fair” corresponding to p = 3 and the remaining homophone number “” on the main window. 10 ”is displayed.

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

Therefore, when the next candidate key-in continues three times from the state of FIG. 6 (c), the display of the main window becomes "offensive" and "08", and the display of the same sound subword in the sub-window shows that the index "" is "offensive". Moving to the left side, the display screen shown in FIG. 6 (d) is obtained.

In the state of FIG. 6 (c) (p = 2), Step n _20, n ₁₉ of FIG. 5 key is pressed, n ₁₄ ~n ₁₇
According to the flow of, the operation is performed to display the next five sets of candidate groups on the sub window.

Figure 8 It is a flow diagram showing details when a key is operated.

In FIG. 8, the determinations at steps n ₂₀₁ , n ₂₀₃ , and n ₂₀₄ are all “NO”, the process proceeds to step n ₂₀₅ , and the operation of pulling the next candidate (n ₂₁₇ ) is performed until the value of p is divisible by 5. Run. Therefore, in this case, the kanji character strings “fair”, “rehabilitation”, and “offensive” corresponding to p = 3, 4, 5 are obtained, but nothing is done to this kanji character string and it is discarded as it is. Then, R = 1 is set to clear the sub window display information, and it is determined whether the value of p is the maximum value or the value of R is 6 (n ₂₀₇ , n ₂₀₈ ),
Until the above conditions are reached, the search routine for the next candidate, writing the candidate at the Rth position in the window, and the operation of R = R + 1 (n ₂₀₉
~ N ₂₁₁ ) is repeated. By such operation, p = 6
The kanji character strings "rehearsal", "proofreading", "retrosei", "retrosei", and "stellar" corresponding to 7, 8, 9, and 10 are obtained.

Then, the sixth to tenth candidate character codes obtained by this operation are written in the character code buffer 22, and p = 6.
Write the character code of the index "" before "rehabilitation" corresponding to. Next, these character patterns are read from the character generator 19 and the window address (p ₁ , q
₁ , r ₁ , s ₁ ) are written in the frame memory 18.

Then return to the state p = 5 running empty feed before candidates running pre candidate routine while running R = R-1 until _{R = 1 (n 212 ~n 214} ). Next, q = 1 is set and five updated homophones are displayed on the sub window 161 (n ₂₁₅ ).

Then writing by executing the following candidate routine in step n ₂₁₆ p = 6 sixth candidate Chinese character string "rehabilitation" of which corresponds to a "7" the character code buffer 21, frame by reading the pattern from the character generator 19 The data is written in the memory 17, and the sixth candidate of the conversion result is displayed on the main window of the display screen 16 together with the number of remaining homonyms as shown in FIG. 6 (e).

Moreover, Keep pressing the key, or By pressing the key, the contents of the homonym window are changed by the same operation as the above operation, and the 11th to 12th candidates are displayed, and the 11th candidate is displayed in the main window (Fig. 6 ( f)).

Further Keep pressing the key, or By pressing the key, the homophone groups are displayed in order, as shown in FIG. 6 (g).

Further, in any of the above-described states of FIGS. 6 (b) to (g), the conversion target candidate is confirmed by inputting the kana of the next phrase from the keyboard 11, and the process proceeds 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. 5 is exited, and the CPU 12 first clears the p and q registers 23 and 24 and p = 0. , Q = 0, the window is deleted, and the character code buffer 21 Erase and write a new "yo" character code. Then, the character pattern is written in the frame memory 17. The same operation is performed for the kana character inputs “U” and “S” to obtain a display screen as shown in FIG. 6 (h).

here By pressing the key, Kana-Kanji conversion for kana input "Yoso" is executed, and a screen showing the first candidate equivalent to that in FIG. 6 (b) is displayed. Below, the same operation is performed to select and display the desired homophone. You can do it.

The flow of steps n _{123 to} n _{129 in} FIG.
In the screen state shown in FIG. The processing flow for updating the display of the sub window when the key is operated is shown. Since the processing flow is the same as the processing steps n _{207 to} n _{211 in} FIG. The description is omitted.

Also in FIG. FIG. 10 shows a specific processing flow when a key is operated, and FIG. It shows a specific processing flow when a key is operated, and it is for performing an operation of returning the displayed candidate by each operation. For detailed operations, increase / decrease of the p register and R The operation is similar to that shown in FIGS. 7 and 8 except that the register increasing / decreasing directions are opposite, and therefore the description thereof will be omitted.

According to the embodiment described above, as shown in FIGS. 6 (a) to 6 (h), one word of the conversion result is displayed on the main window in the same manner as the conventional one, and the homophonic word window is used in the vicinity thereof. Is displayed. Therefore future By operating the keys, it is possible to select a desired homophone while grasping in advance what homophone will be output. Also Since the homophone display on the multi-window is collectively updated by the key, the number of key operations for obtaining the correct answer candidate is reduced.

When compared with the conventional method, there is no difference between the two when the first or second candidate is the correct answer, but there is no difference in the number of key operations between the two when the third or fifth candidate is the correct answer. However, when it is found that the second candidate is not the correct answer, if the homophone group on the sub multi-window is seen,
~ You can confirm that the fifth candidate has the correct answer,
Operator is at ease The keys can be operated.

Further, when any of the sixth to tenth candidates is correct, if it is found that the second candidate is not the correct answer, looking at the homophone group on the multi-window, it is confirmed that the third to fifth candidates also do not have the correct answer. Can be confirmed immediately It is possible to obtain the display of the sixth to tenth candidates by operating the keys, and it is possible to reduce the number of key operations until the correct answer is obtained, as compared with the conventional case.

If the 11th or 12th candidate is correct, change from the 6th candidate to the 11th candidate. The number of key operations can be further reduced because the key can be immediately moved.

Further, by adopting the display selection method as in the present invention, there are the following advantages.

That is, since the kana-kanji conversion technology has recently advanced and advanced grammar tests have been performed, the conversion rate has improved. For example, in the case of the phrase segmentation method, only the first candidate is about 85%,
About 95% of the correct answers can be obtained by the 5th candidate and about 97% by the final candidate.

On the other hand, when the first candidate is the correct answer, it is originally not necessary to display the homonym group after the second candidate. Moreover, the correct answer rate of the first candidate is 85%. Therefore, when displaying the first candidate homophones for which 85% of the correct answers are obtained, the display of the second candidate and subsequent homophones is suppressed so as to suppress the display that is unpleasant to the operator, and thereafter a plurality of homonyms are displayed. Is displayed in a window at the same time, the number of displayed homophones is limited to, for example, 5 to facilitate selection of a desired homophone, and the display of the homophone group displayed in this window is collectively updated. You will be able to quickly select the homonym of.

It should be noted that the type of each key in the above embodiment is not limited to this, and may be combined with other ones, and any modification such as providing a dedicated key can be made.

<Effects of the Invention> As described above, according to the present invention, the kana character string input from the input means is displayed subsequently to the character string being created on the display means,
In response to the conversion instruction, the first candidate among the homonym groups that are the conversion candidates for the kana character string is displayed in place of the kana character string, and the homonym group that is the conversion candidate is displayed according to the next candidate instruction. More than a predetermined number of multiple candidates are displayed together, and the next candidate is designated in the displayed multiple candidates, and the candidate is displayed in place of the candidate displayed at the kana character position, and each subsequent candidate is designated. In addition, since it is a homophone display method in kana-kanji conversion in which the next candidate is sequentially designated among the plurality of candidates and is displayed instead of the candidate displayed in the kana character position, the first candidate can generally be used. Since there is a high possibility that the operator's desired candidate will be displayed with one conversion instruction,
In the second conversion instruction, other homophones are not displayed to avoid confusion of the operator, and if the operator's desired candidate is not the first candidate, it is unknown how many candidates the desired candidate will be displayed as. By displaying a plurality of candidates collectively, it is possible to easily find a desired candidate.

[Brief description of drawings]

FIG. 1 is a diagram showing a display example of a homophone selection operation in the conventional Kana-Kanji conversion, FIG. 2 is a functional block diagram of a multi-window display which is the background of the present invention, and FIG. 3 is a multi-window display. FIG. 4 shows a switching example, FIG. 4 is a block diagram showing an embodiment in which the present invention is applied to a Japanese word processor, FIG. 5 is a diagram showing an operation flow of the embodiment of the present invention, and FIG. FIG. 7 is a diagram showing a display example when selecting a homophone group displayed according to the present invention, FIG. 7 is a diagram showing a detailed operation flow corresponding to the operation of the next candidate key, and FIG. 8 is a SHIFT,
FIG. 9 shows a detailed operation flow corresponding to the operation of the next candidate key, FIG. 9 shows a detailed operation flow corresponding to the operation of the previous candidate key, and FIG. 10 shows a detailed operation flow corresponding to the operation of SHIFT and the previous candidate key. FIG. 11 ... Keyboard, 12 ... Central processing unit (CP
U), 13 ... Kana-Kanji conversion dictionary, 14 ... CRT controller, 16 ... Display screen, 17, 18 ... Frame memory, 21, 22 ... Character code buffer, 16
1 ... Sub window display area.

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Suzuki et al. 22-22 Nagaike-cho, Abeno-ku, Osaka-shi, Osaka Prefecture Sharp Corporation (56) References JP-A-53-5930 (JP, A) JP-A-55 -140930 (JP, A) JP 55-57373 (JP, A) JP 56-147228 (JP, A) JP 57-49990 (JP, A) JP 60-75921 (JP, A) )

Claims (1)

[Claims] 1. A kana character string input from the input means is displayed on the display means following the character string being created, and a homophone group which is a conversion candidate for the kana character string is displayed according to a conversion instruction. The first candidate is displayed by replacing it with the kana character string, and a predetermined number of plural candidates from the homonym group that is the conversion candidate are collectively displayed according to the next candidate instruction, and the next candidate is displayed. The candidate is designated among the plurality of candidates, and the candidate is displayed in place of the candidate displayed at the kana character position. For each subsequent subsequent candidate designation, the next candidate is designated sequentially among the plurality of candidates, and the kana character position is designated. A method for displaying homophones in kana-kanji conversion, characterized by displaying in place of displayed candidates.