JP4811770B2 - Extended kanji output method - Google Patents

Description

The present invention relates to an extended kanji output method , and more specifically, while using a roman character input kana-kanji conversion method as it is, a fixed phrase including kanji and the like is read and output using two alphabetic characters that do not correspond to the input kana as a key. The extended kanji output method .

Currently, the most widely used romaji input kana-kanji conversion method is composed of two romaji characters, with a large number of input key strokes as a whole, but a system that covers many homophones for the input kana. Because it is a dictionary, the conversion key and the selection / confirmation key are pressed, and the target kanji is easily output although it takes a little time.

JP 2004-30654 A JP-A-10-222503 Japanese Patent Laid-Open No. 63-211061 Japanese Input Guide, Microsoft IME97 for Windows (registered trademark) 95 Upgrade Ichitaro 2006, character input (page 166) Microcomputer Circular, 1983, February, “Kanji Input Method for PCs” (pp. 43-51)

By the way, in this romaji input kana-kanji conversion method, it is necessary to input romaji corresponding to kana. This is natural, but if you make an input mistake, you can type two English letters that do not correspond to kana, for example, two consonants, and the two consonants will be displayed on the screen, and then press the ESC key. Often reworked.
However, instead of a mistake input, for example, “kk” is intentionally typed and “corporation” is output immediately. In that case, if the output / display is confirmed without using the conversion key and the selection / confirmation key, Efficient.
On the other hand, looking at daily life, English letters are widely used, and examples of shortening to two letters as in the above example are widespread in document office work. Everyone knows that “pc” is a “personal computer”. There are also examples where names are shortened to 2 letters. Such a useful method is proposed because frequently used terms can be shortened to two easy-to-remember English letters and registered in their own dictionary.

The subject of the present invention is that a fixed phrase including kanji stored in a user's own dictionary prepared in advance using two alphabetic characters that do not correspond to the input kana as a key while using the romaji input kana-kanji conversion method as it is. It is to provide an extended kanji output method for reading and outputting. Here, the two alphabetic characters include alphabetic characters, symbols and numerals on the keyboard, but combinations of two numerals are excluded.

According to the present invention, in a Roman character input kana-kanji conversion method , a user's own dictionary memory having a two-dimensional address determined by the first and second alphabetic characters for two alphabetic characters that do not correspond to kana is created. For the input of the characters, except for the two alphabetic characters that may become kana in the third character, the kanji stored in the two-dimensional address corresponding to the two alphabetic characters without typing a conversion key One fixed phrase or multiple fixed phrases connected via a delimiter mark are read out, and one fixed phrase is output and confirmed without the need for selection / determining key, while for a plurality of fixed phrases, It is characterized in that the output of one fixed phrase is determined by pressing the selection key .

According to the present invention, the convenience of the Kana-Kanji conversion method for Roman character input is maintained as it is, and frequently used terms or fixed phrases are output immediately by inputting two shortened alphabetic characters, and key input is performed as a whole. Less and more efficient writing can be created.

In the Kana-Kanji conversion method for Roman input Kana-Kanji, Kanji stored in a user-specific dictionary address that is different from the system dictionary and corresponds to the two English characters without typing a conversion key for input of two English characters that do not correspond to Kana Is read out, and the output is confirmed without selecting and confirming the key.
Romaji input Kana-Kanji conversion method allows numbers to be keyed, so the user's own dictionary is read in the same way for input of a combination of one letter and one number that does not correspond to Kana. Output in the same way. This increases the number of addresses where terms should be registered.
If multiple fixed phrases are combined and stored via a delimiter mark instead of one fixed phrase in the user's own dictionary, the delimiter mark is detected and read out, and one of the fixed phrases is selected. Make sure the output is fixed. In this case, it is convenient to collect frequently used related terms instead of multiple homonyms.
If the input of two characters is a mistake, the term immediately output without typing the conversion key is erased by inputting a specific function key, for example, the Esc key.
In order to visually confirm whether or not there is a mistake in inputting two characters, it is possible to wait for the conversion key to be read, read out the user's own dictionary, and confirm the output without selecting / determining the key.

A preferred embodiment of the present invention will be described with reference to the drawings.
FIG. 1 shows an example of the configuration of a computer on which a Roman character input Kana conversion method is executed. 10 is a control device, 12 is a keyboard, 14 is a display, and 16 is a storage device.
FIG. 2 is a flowchart showing an embodiment of the present invention, and FIG. 3 is an example of a configuration of a user's own, that is, hidden dictionary memory according to the present invention.

In the embodiment shown in FIG. 2, steps S1 to S14 show the currently used Roman character input Kana-Kanji conversion method .
In step S1, the first letter of the alphabet is keyed in. In step S2, it is asked whether it is a vowel. If it is a vowel, any kana in the line is displayed in step S3, and kanji conversion is performed in step S4. If so, hit the conversion key (space key) in step S5, select the candidate kanji that appeared, hit the select / confirm key (Enter key), and the selected kanji will be confirmed and displayed Return to step S1 to input the next character. If Kanji conversion is not performed in step S4, it is asked in step S6 whether to confirm the corresponding kana. If it is determined, the confirmation key (Enter key) is pressed in step S7, and the corresponding kana is confirmed and the next character is displayed. Return to step S1 for input. If not confirmed in step S6, the process returns to step S1 for the next input.

  If the first letter is not a vowel in step S2, the second letter is input in step S8, whether or not the second letter corresponds to kana in step S9, and if it corresponds to kana, the process proceeds to step S3. The procedure operation as described above is performed. In step S10, it is asked whether or not the kana is formed by inputting the third letter of the alphabet. For example, “by” indicating “?” In the memory address of FIG. 3, the third letter of the alphabet is input in step S11. If “by” in S12, the specific vowel is “a, i, u, e, o” (in some cases, for example, for “fy”, the specific vowel is “a, u, o”), and either of them. If it is applicable, a response such as “Bya” is displayed in step S3, and the procedure operation is performed. If it is not a specific vowel, in step S13, for example, three alphabetic characters such as “bys” are displayed. This is judged as a miss input, and the [esc] key or [Back space] key is pressed to erase it. Return to step S1.

In step S15, the input of two non-Kana-compliant English characters (for example, “bc”) is confirmed. However, in the previous step S10, for example, “ch” and “cy” are “cha” depending on the input of the third character. Because it is converted as kana, it is excluded. In order to explain this, in FIG. 3, the place corresponding to the second character “h” and “y” is indicated by “?” With respect to the first character “c”. The above-excluded and confirmed two alphabetic characters themselves determine the two-dimensional address of the user's own dictionary memory created separately. For example, if “bc”, in the configuration example of FIG .
In this way, a memory address is immediately specified by two alphabetic characters, and a plurality of boilerplates concatenated via one boilerplate or delimiter mark including, for example, “*” is stored there. In step S15, the data is read out without typing a conversion key. In step S16, it is determined whether the read content includes a delimiter mark. If there is no delimiter mark, the one fixed phrase is output at the appropriate cursor position in step S17. The display is confirmed, and at that time, the selection / confirmation key becomes unnecessary, and the process proceeds to step S1, which is the next operation.

  Next, if a delimiter mark is detected in step 16, in step S18, the first fixed phrase is displayed among the plural fixed phrases, and in step S19, it is confirmed whether or not this is the target fixed phrase. Thus, the fixed phrase is output and displayed (step 20), and the process proceeds to step S1, which is the next operation.

  If the first fixed phrase is not the target fixed phrase in step S19, the conversion key is pressed to display all the linked fixed phrases, and the target fixed phrase is output / displayed and confirmed by pressing the select / fix key. It progresses to step S1.

In steps S7, S5, S14, S17, S20, and S21, a confirmation flag is set and output. In step S6, the flag is reset, and the processing in step 15 is performed after confirming the flag or initial input. In the case where Kana is continuously converted by inputting Roman characters, step S15 is processed after the enter key is pressed once. In the example of FIG. 3, when “this adhesive” is input, “kono [fixed keystroke] bd” is set.
However, a method of outputting “this adhesive” by typing “konobd” is also conceivable. In this case, internal control is performed so that the confirmation flag corresponding to the confirmation keystroke is set when the dictionary is read. However, it is also proposed not to perform such control when no fixed phrase is stored at a specified address in the dictionary.

  In the configuration example of the hidden dictionary memory shown in FIG. 3, one character or a plurality of Chinese characters are stored and registered in a very small part of the address designated by two Kana non-corresponding English characters. For both the first and second characters, "-^ ¥ @" ;: "after 0.・ It is possible to increase the number of addresses by constructing a two-dimensional memory including symbols such as “”. Use the shift key for symbols such as “!,”, #, $,%, &, ', ( ,), =, ~ ", Etc., and including them further increases the number of addresses.

The part of bb is shortened from bubun (Roman character reading). Similarly, the address of bc is from banchi (Roman character reading), the adhesive of bd is from bond (English word), and before bf is from before (English word) , Bh's beach is from beach (English word), bj's beauty is from bijin (reading Roman letters), bk's book is from book (English word), bl's bell is from bell (English word), bm's bottom is bottom (English word), bp thing is shortened from buppin (Roman reading), bq surprise is from biqquri, bz phone is from buzzer, b1 font is shortened from numbers used in bank, etc. ing.
Also, since the two characters between the symbols do not constitute a kana, the present invention can be applied, so that it can be easily output in association with pictograms such as “<>” = “open”, “>><” = “closed”. Terms or fixed phrases to be registered are not limited to kanji.

In the address corresponding to “k1” in the dictionary memory shown in FIG. 3, a plurality of fixed phrases are combined via a delimiter instead of one fixed phrase, that is, “Osaka prefecture * Kyoto prefecture * Hyogo prefecture * Shiga Prefecture * Nara prefecture * Wakayama prefecture * ". When the separator" * "is detected from this, the head phrase" Osaka prefecture "is displayed. Confirm the output, and if it is different, press the conversion key (space key). Osaka Prefecture, 2. Kyoto Prefecture, 3. Hyogo Prefecture, 4. Shiga Prefecture, 5. Nara Prefecture, 6. A plurality of fixed phrases connected as Wakayama Prefecture are displayed, and one of them is selected, output and displayed. This can use the conventional procedure of outputting and displaying one of the homonyms, but one fixed phrase may be selected and output confirmed by other methods . At that time, the head position may be changed by the learning function, or may be fixed.
As described above, it is efficient in creating a document by a word processor that certain related terms or fixed phrases are registered together as a group, and one fixed phrase can be selected and output by two short letters.

  Tool software is provided for registering one or a plurality of fixed phrases corresponding to two abbreviated alphabetic characters in the user's own so-called hidden dictionary. Preferably, a special function key is pressed when inputting a sentence so that registration can be performed. In any case, the registered contents can be changed freely. Those skilled in the art can create these software.

  There may be input mistakes in two non-Kana-compatible English characters. In order to confirm this, if it is a mistake, it is re-typed, and if it is not a mistake (if it is intended to be two characters that do not correspond to kana), a conversion keystroke step is inserted between step S10 and step S15, and the user A unique dictionary is read, and one fixed phrase or one of a plurality of fixed phrases is selected, and the output is determined.

The structural example figure of a computer. The flowchart which showed one Example. An example of a configuration of a user's own, that is, a hidden dictionary memory.

Claims (2)

In the Romaji input kana-kanji conversion method , a user's own dictionary memory having a two-dimensional address determined by the first and second alphabetic characters is created for two alphabetic characters that do not correspond to kana, and the two alphabetic characters, however, 3 One fixed form including kanji stored in the two-dimensional address corresponding to the two alphabetic characters, without typing a conversion key , with respect to an input that excludes two alphabetic characters that may become kana characters. A plurality of fixed phrases connected via phrases or delimiters are read, and one fixed phrase is output and confirmed without the need for selection / determining key, while one fixed phrase is selected for a plurality of fixed phrases An extended kanji output method in which phrases are confirmed by typing. A conversion key is pressed for two input alphabetic characters so that one or more fixed phrases stored in the address of the user's own dictionary memory corresponding to the two characters are read out. Item 2. The extended Kanji output method according to Item 1.

Images