JPH10222502A - Document preparing device and input processing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To efficiently utilize a read character string that is selected by a user among candidates of read character strings which are presented through ambiguous inputting from the next time. SOLUTION: When an ambiguous input function is instructed after a read character string is inputted by an inputting part 11, a controlling part 12 retrieves an ambiguous input dictionary 16 and presents candidates of read character strings which include the inputted read character string. When one of the presented read character string candidates is selected, the part 12 associates the selected read character string with the inputted read character string and stores them in a selection read character string data area 17a. Later, when a read character string that is the same as the inputted read character string stored in the area 17a is inputted, the part 12 reads a selection read character string that corresponds to the inputted read character string from the area 17a and presents it as an ambiguous input result.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a document creation device such as a word processor or a personal computer, and more particularly to a document creation device having an ambiguous input function and an input processing method.

[0002]

2. Description of the Related Art Conventionally, in a document processing device such as a word processor or a personal computer, in a kana-kanji conversion for converting an input kana character string into a character string mixed with a kanji or a kana, a user wants to convert a character string to be converted. It is common to input all readings correctly, and if the reading character string is incorrect, a conversion result unexpected by the user will be obtained.

[0003] For example, when a user inputs "Nyuriku" with the intention of a conversion result such as "Input",
If "Nyaryk" is erroneously input, the conversion result will be "Nyaryoku", and will not be the "input" expected by the user.

There is also a kana-kanji conversion provided with an erroneous input automatic correction function for correcting an erroneously input reading character string to a correct character string. However, even when using such an erroneous input automatic correction function, it is assumed that the user knows a correct reading character string, and for example, if a user inputs a character string that the user does not remember accurately, such as a proverb or a proverb. In doing so, the character string must be looked up in a dictionary or the like before input.

[0005] Here, as a function to help the user to input a character string whose reading is not accurately known, there is an input function called ambiguous input. This is a function in which, when a user inputs a part of a reading, the system searches a dictionary based on the reading character string, and presents a candidate of a reading character string including the character string to the user.

For example, if "gokuseki" is input with the intention of a conversion result such as "gokusekikonko", "gokusekseki",
Character strings such as “Gokuseki Konko” and “Gokuseki Sakutaku” are presented as candidates for the read character string. The user can perform a kana-kanji conversion using the reading character string by selecting a desired reading (“gokusekikonko”) from the presented reading character string candidates.

[0007]

As described above, conventionally, even for a character string that the user does not know exactly in the reading, a candidate for the reading character string is obtained from a partial input of the reading by the fuzzy input function. Kana-Kanji conversion was performed.

However, since the ambiguous input processing is performed every time the input is made, even if the same reading is input,
As in the previous case, it is necessary to perform an operation of selecting a desired character string from candidates for the read character string. For this reason, there is a problem that the efficiency is extremely low, and particularly when there are many candidates for the read character string obtained by the ambiguous input function, it takes time and effort to select a desired character string.

The present invention has been made in view of the above points, and provides a document in which a reading character string selected by a user among candidate reading character strings presented by fuzzy input can be used efficiently from the next time. It is an object to provide a creation device and an input processing method.

[0010]

According to a first aspect of the present invention, there is provided a document preparation apparatus comprising: an input unit for inputting a part of a reading character string of a certain word; a fuzzy input dictionary storing information necessary for fuzzy input processing; Searching the fuzzy input dictionary based on the reading character string input by the input means,
A fuzzy input processing means for presenting a candidate for a reading character string that is valid as a word, and, when one of the reading character string candidates presented by the fuzzy input processing means is selected, the selected reading character string And a storage unit that stores the input reading character string in association with the input reading character string. When the same reading character string as the input reading character string stored in the storage unit is input, the storage unit stores the input reading character string corresponding to the input reading character string. And a fuzzy input control means for reading out the selected reading character string to be presented and presenting it as a fuzzy input result.

According to such a configuration, when a reading character string obtained by the fuzzy input function (fuzzy input processing means) is selected, the selected reading character string is stored in the storage means together with the input reading character string. When the same reading character string is input, the selected reading character string stored in the storage unit is presented as an ambiguous input result without using the ambiguous input function. Therefore, kana-kanji conversion can be efficiently performed using the previously selected reading character string without selecting a desired reading character string with the ambiguous input function each time input is performed.

[0012] Also, in response to a deletion instruction, a list of selected read character strings stored in the storage means is displayed, and a delete means for deleting information on the read character string selected as a deletion target from the storage means. By further providing, unnecessary reading character strings can be deleted, and the capacity of the storage means can be prevented from being exceeded.

Also, referring to the kana-kanji conversion dictionary storing information required for the kana-kanji conversion process, and referring to the kana-kanji conversion dictionary, the selected reading character string presented by the fuzzy input control means is converted into a kana-kanji character string. When the kana-kanji conversion means for converting the kana-kanji character and the kana-kanji mixed character string obtained by the kana-kanji conversion means are determined, the reading character string at the time of input corresponding to the selected reading character string is used as the reading information, and the determined A dictionary registering means for registering a character string containing kana-kanji characters as heading information in the kana-kanji conversion dictionary, so that a character string to be read when the ambiguous input function is used (a reading at the time of input corresponding to the selected character string to be read) is provided. Character string), a desired conversion result can be obtained.

Further, a Roman character generating means for generating a Roman character string corresponding to the selected reading character string presented by the fuzzy input control means in accordance with the post-conversion instruction, and a Roman character character string generated by the Roman character generating means is converted to the Roman character string. By further comprising a distinction display means for displaying a distinction from the Roman character string input by the user as a reading character string through the input means, when performing the post-conversion as a function of kana-kanji conversion during the Roman character input mode, It becomes possible to distinguish whether or not the character string displayed as the post-conversion result has been input by the user.

[0015]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram illustrating a configuration of a document creation device according to an embodiment of the present invention. Further, the present apparatus is realized by a computer which reads a program recorded on a recording medium such as a magnetic disk and the operation of which is controlled by the program.

In FIG. 1, an input unit 11 comprises, for example, a keyboard, and inputs data such as character strings and functions. The control unit 12 includes, for example, a microprocessor, and controls the entire apparatus by activating a program according to an input instruction. Here, the control unit 12 performs processing of an ambiguous input function. The output unit 13 is, for example, an LCD (Liquid
It is composed of a display device such as a crystal display (CRT) or a CRT (Cathode Ray Tube), and displays a character string read by a user, a kana-kanji conversion result, a search result by an ambiguous input function, and the like.

Under the control of the control unit 12, the kana-kanji conversion unit 14 converts the input read character string into a kana-kanji mixed character string with reference to the kana-kanji conversion dictionary 15. Also, a new word registration process to the kana-kanji conversion dictionary 15 is performed here.

The kana-kanji conversion dictionary 15 stores information necessary for kana-kanji conversion processing, such as reading of words and corresponding headings. The fuzzy input dictionary 16 stores information necessary for searching for a reading character string of a word including a part of the reading character string input by the user. The data storage unit 17 stores various data necessary for the processing of the control unit 12, and here, a selected reading character string data area in which the reading character string selected by the user with the ambiguous input function is stored together with the input reading character string. 17a, a Roman character kana conversion table 17b in which Roman characters and kana characters are associated with each other is provided.

Next, before explaining the operation of the embodiment,
The fuzzy input processing realized by the present apparatus will be described with a specific example. FIG. 2 is a diagram showing a reading candidate screen after execution of the ambiguous input function. Use the ambiguous input function of the device when the user does not remember the word reading accurately. The ambiguous input function includes a prefix match search in which a dictionary search is performed by inputting a reading ahead of a word, and a backward match search in which a dictionary search is performed by inputting a reading after a word. The example in FIG. 2 is an example using a head-on search.

For example, when the user inputs a word such as "cobblestone", the user inputs "gokuseki" which is a part of a character string read out of the word.
After inputting from, an ambiguous input instruction is performed. As a result, candidates for reading character strings that are valid as words, such as “Gokuseki”, “Gokusekikonko”, and “Gokusekitokakutaku”, are obtained from the ambiguous input dictionary 16. The search is performed and displayed as shown in FIG.

FIG. 3 is a diagram showing kana-kanji conversion using a read character string obtained by the ambiguous input function. If you select “Gyokusekikonko” from the candidates for the reading character string presented by the fuzzy input function in FIG. 2 and give a Kana-Kanji conversion instruction, a conversion result such as “Tamaishi mixed confusion” is obtained as shown in FIG. Can be

FIG. 4 is a diagram showing a screen when the input reading character string used for the ambiguous input function is re-input. FIG.
When the user re-enters a reading character string such as "Gokuseki" input by the fuzzy input function, a mark indicating that another reading character string was previously selected is added to the input reading character string. At that time, a mark is added to the beginning of the character string obtained by a prefix search, and a mark is added after the character string to a read character string obtained by a match search. Is done.

FIG. 5 is a diagram showing a display screen of a read character string registered after the fuzzy input function. When the user selects “Gokusekikonko” from among the candidates for the reading character string presented by the ambiguous input function of FIG. 2, the selected reading character string at that time, “Gokusekikonko”, is entered as the input reading character string. It is automatically registered in the selected reading character string data area 17a of the data storage unit 17 together with "Gokuseki".

At this time, the registered reading character string (reading character string selected by the fuzzy input function) is stored in the form of a user's operation such as pressing a specific key or clicking a specific button with a pointing device such as a mouse. In response to the display instruction, it is displayed on a window screen as shown in FIG.

On this window screen, the reading character string input by the user can be replaced with the selected reading character string. Conversely, the selected reading character string can be returned to the original reading character string input by the user.

FIG. 6 is a diagram showing a conversion candidate list screen when kana-kanji conversion is performed on a character string read by the fuzzy input function. In FIG. 5, when a reading character string obtained by an ambiguous input function such as “Gokuseki Konko” is selected and Kana-Kanji conversion is performed, conversion candidates as shown in FIG. 6 are displayed. In this case, in addition to the converted character string such as “Bamboo stone mixture”, the replaced read character string “Gyokuseki Konko” and the original input read character string “Gyokuseki” before replacement are also displayed as non-conversion candidates. You.

Next, the operation of the embodiment will be described. The user inputs a character string to be converted from an input unit 11 such as a keyboard in order to perform kana-kanji conversion. If the user does not know how to read the character string to be converted during the input, the user inputs a character string in a range that can be understood and executes the ambiguous input function (FIG. 2). To execute the ambiguous input function,
This is performed by pressing a specific key for executing the ambiguous input function.

The fuzzy input function has the following search methods:
There is a forward match search for searching for a character string including the input reading character string at the beginning, and a backward matching search for searching for a character string including the input reading character string at the end. The user specifies a search method when executing the fuzzy input function. For example, an ambiguous input function of a forward match search with the F1 key and a backward match search with the F2 key is executed. After executing the ambiguous input function, a desired reading character string is selected from the presented reading character string candidates, and Kana-Kanji conversion is performed using the reading character string to obtain a desired conversion result (FIG. 3).

FIG. 7 shows the processing operation at this time. FIG. 7 is a flowchart showing the flow of processing up to selecting one of the candidates for the read character string obtained by the fuzzy input function. After the user inputs a character string to be read through the input unit 11 (step A11), the control unit 12 uses the search method specified by the user (a head-match search, a tail-match search, etc.) to read a valid reading from the fuzzy input dictionary 16 as a word. A character string candidate is searched for, passed to the output unit 13 and presented to the user (step A12).

When a candidate for a reading character string obtained by the ambiguous input function is presented, the user selects a desired reading character string from the candidates for the reading character string (step A1).
3). After the selection (Yes in step A14), the control unit 12
Registers the read character string input by the user, the read character string selected by the user, and the search method as one group in the selected read character string data area 17a of the data storage unit 17 (step A15).

FIG. 8 is a diagram showing an example of data set in the selective reading character string data area 17a. In this example, for the reading character string "Gokuseki" input by the user, "Gokusekikonko" is registered as the selected reading character string, and "Prefix search" is registered as the search method.

Here, when the user inputs the same reading character string as the character string used in the fuzzy input function, the input reading character string must include the reading character string previously selected by the fuzzy input function. Is shown. At this time, the display format is such that it is possible to know which search method, such as a forward match search or a backward match search, has searched for the read character string candidate (FIG. 4).

FIG. 9 shows the processing operation at this time. FIG. 9 is a flowchart showing a processing flow when the same reading character string as that registered after the fuzzy input function is input. When the user inputs a reading character string through the input unit 11, and then instructs an ambiguous input function (step B1).
1) The control unit 12 determines whether or not the input read character string is a character string previously searched by the fuzzy input function (step B12).

As a result, if the character string is a character string previously searched by the fuzzy input function (Yes in step B12), the control unit 12 sends the selected reading character string corresponding to the input reading character string from the selected reading character string data area 17a. By acquiring the column and the search type (step B13), the fact that the input reading character string includes the reading character string previously selected by the fuzzy input function is presented to the user (step B14). FIG. 4 shows a display example at this time. On the other hand, if it is not a reading character string previously searched by the fuzzy input function (step B
No. 12), the control unit 12 performs a normal reading character string display (step B15).

In this way, when a reading character string to be converted is input, it is notified that there is a reading character string (selected reading character string) registered after the fuzzy input function in the input reading character string. Then, the user instructs the display of the reading character string (FIG. 5), thereby converting the actually input reading character string to the reading character string registered after the fuzzy input function, and performing the kana-kanji conversion.

FIG. 10 shows the processing operation at this time. FIG.
0 is a flowchart showing a flow of processing when displaying a read character string registered after the fuzzy input function. When the user gives an instruction to display the reading character string (selected reading character string) registered after the ambiguous input function through the input unit 11 (step C11), the control unit 12 causes the selected reading stored in the selected reading character string data area 17a to be displayed. A character string is obtained (step C12), and the read character string is displayed on a window screen as shown in FIG. 5 (step C13).

By displaying the selected reading character string, the user replaces the input reading character string with the selected reading character string,
Kana-Kanji conversion can be performed. In the example of FIG. 5,
By replacing the input reading character string “Gokuseki” with the selective reading character string “Gokusekikonko”, a conversion candidate such as “Bamboo mixed” can be obtained.

As described above, when inputting a character string whose pronunciation is not accurately remembered, the user does not use the ambiguous input function every time, but instead uses the read character string previously searched by the ambiguous input function to perform kana-kanji conversion. It can be carried out.

When the kana-kanji conversion is performed using the reading character string presented from the ambiguous input function, when displaying a list of the conversion candidates, a normal homophone candidate and a reading character string (in this case, In addition to the reading character string selected from the reading character string candidates presented from the fuzzy input function), the original reading character string is also displayed, so that the original reading character string of the reading character string used for kana-kanji conversion It is possible to confirm what was (FIG. 6).

FIG. 11 shows the processing operation at this time. FIG.
1 is a flowchart showing the flow of a candidate list display process after kana-kanji conversion. When the user instructs the kana-kanji conversion result candidate list display through the input unit 11 (step D)
11) The control unit 12 determines whether or not the reading character string used in the kana-kanji conversion is a character string replaced with the reading character string obtained by the ambiguous input function (step D12).
As a result, if the character string has been replaced with the reading character string obtained by the ambiguous input function (Yes in step D12),
The control unit 12 displays a candidate list together with the phonetic character string before the replacement in addition to the homophone candidate and the character string to be read (step D13). FIG. 6 shows a display example at this time.

On the other hand, if the character string is not a character string replaced with a reading character string registered after the fuzzy input function (No in step D12), the control unit 12 displays a candidate list with homophone candidates and reading character strings (step D12). D14).

The selected reading character string can be easily returned by the same procedure as the method of replacing the original reading character string with the reading character string presented by the ambiguous input function. Also,
The registered reading character string can be easily deleted by the user by activating the selective reading character string deletion function.

FIG. 12 shows the processing operation at this time. FIG.
2 is a flowchart showing the flow of the process of deleting the selected reading character string. When the user gives an instruction to delete the selectively read character string through the input unit 11 (step E11), the control unit 12
Obtains the input reading character string and the selection reading character string registered in the selection reading character string data area 17a (step E12), and outputs a list of the selection reading character strings to the output unit 1.
3 is displayed (step E13).

When the user selects a character string to be deleted on the list screen (step E14), the control unit 1
2 deletes the data relating to the selected read character string from the selected read character string data area 17a (step E1).
5).

When the kana-kanji conversion is performed using the reading character string selected by the fuzzy input function, the kana-kanji conversion is performed by using the reading character string input by the user and the character string determined by the kana-kanji conversion as new word information. By having the function of registering in the dictionary 15, it becomes possible to obtain a desired conversion result from the next time using the read character string up to the point that the user remembers.

FIG. 13 shows the processing operation at this time. FIG.
3 is a flowchart showing a flow of a new word registration process in a case where a kana-kanji conversion is performed using a reading character string obtained by an ambiguous input function. In response to the Kana-Kanji conversion instruction, the control unit 12 activates the Kana-Kanji conversion unit 14, and converts the read character string into a Kana-Kanji mixed character string (Step F1).
1) The character string selected by the user from the conversion candidates obtained by the kana-kanji conversion is output as a confirmed character string (step F12).

Here, if the reading character string used in the kana-kanji conversion is the reading character string selected by the ambiguous input function (Yes in step F13), the control unit 12 passes through the kana-kanji conversion unit 14 The read character string obtained is used as read information, and the character string determined by the kana-kanji conversion is registered as index information in the kana-kanji conversion dictionary 15 (step F14).

For example, as shown in FIG. 6, the reading character string inputted by the user is “Gokuseki”, and the character string used in the Kana-Kanji conversion is “Gokuseki konko” (the reading character searched by the fuzzy input function). Character string) "
Yomi: New words such as "Gokuseki" and the heading "Bamboo stone" will be registered. As a result, after that, by inputting “Gokuseki” and performing Kana-Kanji conversion, it is possible to obtain “Bamboo stone mixture”.

The input modes for inputting a character string include a hiragana input mode and a Roman character input mode. In the above-described embodiment, the case where the reading character string is input in the hiragana input mode is assumed. Next, the case where the reading character string is input in the Roman character input mode will be described.

When selecting a registered reading character string (reading character string searched by the fuzzy input function), the input mode is checked. In the case of the Roman character input mode, the Roman character kana conversion table 17b is referred to. If the Roman character data corresponding to the registered reading character string is created, the user can enter the input unit 1 even when the registered reading character string is selected.
It has a Roman character string in the same way as the reading character string input from 1. This makes it possible to execute a post-conversion function, which is a function of Kana-Kanji conversion, that returns a read character string after Roman character-Kana conversion to the original Roman character character string at the time of input.

As a display form at this time, a Roman character string input by the user is distinguished from Roman character data automatically generated by the system. In the list of post-conversion candidates, post-conversion candidates of both the Roman character string input by the user and the Roman character string automatically generated by the system are displayed.

The processing operation in the Roman character input mode will be described below with reference to FIGS. FIG.
9 is a flowchart showing the flow of a process for creating Roman character data when a reading character string registered after the fuzzy input function is selected in the Roman character input mode. When the user again selects the reading character string registered after the fuzzy input function, that is, the selected character string registered in the selected reading character string data area 17a (step G11), the control unit 12 checks the current input mode, If the input mode is the Roman alphabet input mode (Yes in step G12), the Roman alphabet kana conversion table 17b provided in the data storage unit 17 is referred to.
A Roman character string corresponding to the read character string is generated (step G13).

FIG. 15 shows a Roman character kana conversion table 17b.
Indicates the contents of In the Roman alphabet kana conversion table 17b,
For example, "a" for "a", "ka" for "ka",
Information on kana characters corresponding to Roman characters, such as "sa" for "sa", is stored. When a Roman character string is generated using the Roman character kana conversion table 17b, additional data for discriminating whether the Roman character string is input by the user or automatically generated by the system as shown in FIG. Is added.

FIG. 16 shows the state at this time. The attached data “0” indicates a Roman character string input by the user, and the attached data “1” indicates a Roman character string automatically generated by the system. The attached data is set for each Roman character.

For example, it is assumed that the user inputs a reading character string such as "Gokuseki" in the Roman alphabet input mode and selects "Gokuseki Konko" registered after the fuzzy input function. In this case, the Roman character string “gyokuseki” input by the user has “00” as attached data.
00000000 ”is added. On the other hand, “gyokuse” is selected for “gokusekikonko” selected by the user.
A Roman character string such as "kikonnkou" is generated. Since “konnkou” is automatically generated by the system, “00000000011111111” is added to the Roman character string as attached data.

Here, when the user instructs post-conversion after selecting the reading character string registered after the ambiguous input function, the Roman character character string "gyokuse" input by the user is input.
ki "and the Roman character string" gy "automatically generated by the system.
okusekikonnkou ”is displayed in a distinguished manner.

The distinction display is to display the Roman character string input by the user and the Roman character string automatically generated by the system in different display forms. Displaying in a different display format means, for example, changing the font used for display, underlining, displaying in italics, etc. on the screen as "Roman character string entered by the user" and "System automatically generated Romanized character string ".

FIG. 17 shows an example. FIG.
The figure shows a state in which “gokusekikonko” obtained by the ambiguous input function is selected from a character string read by the user such as “gyokuseki” and post-converted. Post-conversion of "Gyokusekikonko" gives a Roman character string such as "gyokusekikonkonkou". Of these, the user directly inputs only "gyokuseki" using the keyboard, and the remaining ""konnkou" is a Roman Kana conversion table 17
This is a character string automatically generated based on b.

Whether the result displayed in the post-conversion is input by the user or automatically generated by the system,
In order to show this difference to the user, in the example of FIG. 17, when displaying the post-conversion result “gyokusekkikonnkou”, the system automatically generates “konkonkikonkonko”.
“u” is underlined.

As shown in FIG. 18, in the list of post-conversion candidates, post-conversion candidates of both the Roman character string input by the user and the Roman character string automatically generated by the system are displayed.

FIG. 19 shows the processing operation at this time. FIG.
9 is a flowchart showing the operation of the character string display processing after the post-conversion function. In response to the post-conversion instruction, the control unit 12 returns the read character string (Kana character string) converted to Roman characters to a Roman character string (step H11). At this time, the control unit 12 determines whether the post-conversion Roman character string is input by the user or automatically generated by the system (step H12). As a result, if the character string is a Roman character string input by the user (Yes in step H12), the control unit 12
Normally displays the Roman character string as a post-conversion result (step H13).

On the other hand, if the system has automatically generated one (No in step H12), the control unit 12 distinguishes between the part input by the user and the part automatically generated by the system.
The Roman character string is displayed (step H14).

As described above, the Roman character string input by the user and the Roman character string automatically generated by the system from the reading character string selected by the ambiguous input function are displayed in a distinguished manner, which is one of the functions of the kana-kanji conversion. When the post-conversion is executed, it is possible to distinguish whether or not the character string displayed as the post-conversion result is input by the user.

The method described in the above-described embodiment includes, as programs that can be executed by a computer, for example, a magnetic disk (floppy disk, hard disk, etc.), an optical disk (CD-ROM,
It is also possible to write the data on a recording medium such as a DVD or a semiconductor memory and apply it to various devices, or to transmit it via a communication medium and apply it to various devices. A computer that realizes the present apparatus reads the program recorded on the recording medium, and executes the above-described processing by controlling the operation of the program.

[0065]

As described above, according to the present invention, when a reading character string obtained by the fuzzy input function is selected, the selected reading character string is stored together with the input reading character string.
Next time, when the same reading character string is input, the stored selected reading character string is presented as an ambiguous input result without using the ambiguous input function. Even if the reading character string is not selected, the kana-kanji conversion can be efficiently performed using the reading character string selected last time.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a document creation device according to an embodiment of the present invention.

FIG. 2 is a diagram showing a reading candidate screen after execution of an ambiguous input function.

FIG. 3 is a diagram illustrating kana-kanji conversion using a reading character string obtained by an ambiguous input function.

FIG. 4 is a diagram showing a screen when the input reading character string used for the ambiguous input function is re-input.

FIG. 5 is a diagram showing a display screen of a read character string registered after an ambiguous input function.

FIG. 6 is a diagram showing a conversion candidate list screen when kana-kanji conversion is performed on a reading character string obtained by an ambiguous input function.

FIG. 7 is a flowchart showing the flow of processing until one of the candidates for a read character string obtained by the ambiguous input function is selected.

FIG. 8 is a diagram showing an example of data set in a selective reading character string data area.

FIG. 9 is a flowchart showing a processing flow when the same read character string as the read character string registered after the fuzzy input function is input.

FIG. 10 is a flowchart showing a processing flow when displaying a read character string registered after the fuzzy input function.

FIG. 11 is a flowchart showing the flow of candidate list display processing after kana-kanji conversion.

FIG. 12 is a flowchart showing the flow of a process of deleting a selected reading character string.

FIG. 13 is a flowchart showing a flow of a new word registration process in a case where kana-kanji conversion is performed using a reading character string obtained by an ambiguous input function.

FIG. 14 is a flowchart showing the flow of a process of creating Roman character data when a reading character string registered after the fuzzy input function is selected in the Roman character input mode.

FIG. 15 is a diagram showing the contents of a Roman character kana conversion table.

FIG. 16 is a diagram for explaining a Roman character string corresponding to a read character string.

FIG. 17 is a diagram for explaining a post-conversion function.

FIG. 18 is a diagram showing a candidate list display screen after a post-conversion function.

FIG. 19 is a flowchart showing the operation of a character string display process after the post-conversion function.

[Explanation of symbols]

 Reference Signs List 11 input unit 12 control unit 13 output unit 14 kana-kanji conversion unit 15 kana-kanji conversion dictionary 16 fuzzy input dictionary 17 data storage unit 17a selective reading character string data area 17b romaji kana conversion table

Claims (5)

[Claims] An input means for inputting a part of a reading character string of a word, an ambiguous input dictionary storing information required for an ambiguous input process, and a reading character string inputted by the input means. The fuzzy input dictionary is searched based on the fuzzy input dictionary, and fuzzy input processing means for presenting a candidate of a reading character string valid as a word, and one of the reading character string candidates presented by the fuzzy input processing means is selected. Storage means for storing the selected reading character string and the input reading character string in association with each other, and when the same reading character string as the input reading character string stored in the storage means is input, A document comprising: a reading character string corresponding to the input reading character string from the storage means; and a fuzzy input control means for presenting the selected reading character string as a fuzzy input result. Forming apparatus. 2. A deletion means for displaying a list of selected reading character strings stored in the storage means in response to a deletion instruction, and deleting the information of the reading character strings selected as a deletion target from the storage means. The document creation device according to claim 1, further comprising: 3. A kana-kanji conversion dictionary storing information required for kana-kanji conversion processing, and a kana-kanji mixed character string is converted to a kana-kanji mixed character string by referring to the kana-kanji conversion dictionary. A kana-kanji conversion means for converting kana-kanji characters, and when a kana-kanji mixed character string obtained by the kana-kanji conversion means is determined, a reading character string at the time of input corresponding to the selected reading character string is set as reading information, and the determined 2. The document creation apparatus according to claim 1, further comprising: dictionary registration means for registering a kana-kanji mixed character string as heading information in the kana-kanji conversion dictionary. 4. A Roman character generating means for generating a Roman character string corresponding to the selected reading character string presented by the fuzzy input control means according to a post-conversion instruction, and a Roman character character string generated by the Roman character generating means 2. The document creation apparatus according to claim 1, further comprising: a distinction display unit for displaying a distinction from a Roman character string input by the user as a reading character string through the input unit. 5. A method for searching a fuzzy input dictionary storing information necessary for fuzzy input processing by inputting a part of a read character string of a certain word, and presenting a candidate of a read character string valid as a word. When one of the presented reading character string candidates is selected, the selected reading character string and the input reading character string are stored in a memory in association with each other, and then the input reading character stored in the memory is stored. An input processing method, wherein when a reading character string identical to a character string is input, a selected reading character string corresponding to the input reading character string is read from the memory and presented as an ambiguous input result.