JP3012525B2 - Character processing method and character processing device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character processing apparatus, and more particularly to a character processing apparatus and method having a Roman / kana conversion function.

[0002]

2. Description of the Related Art In general, with the spread of JIS keyboards which cannot directly input kanji in character processing devices, especially in the input of characters mixed with kanji, kana kanji which converts kana to kanji which can be easily input with a JIS keyboard. The conversion method has become mainstream. In addition, the Kana input method that can input both English characters and Kana by the alphabet key operation is less than the Kana Kanji input method, so there is less key layout and there is no need to remember the Kana arrangement It is more commonly used due to its advantages such as fewer keys.

On the other hand, in the case of the Roman character / kanji input method, a key must be pressed one to three times to input one character of a kana. In addition, there is a disadvantage that a plurality of keys must be pressed again to correct an erroneously input portion.

Various measures have been proposed as a countermeasure, and one example is JP-A-59-142630.

Hereinafter, this publication will be described with reference to a functional block diagram of FIG.

In FIG. 3, reference numeral 1 denotes an input unit such as a keyboard and a mouse used for inputting character information, 2 denotes an input buffer for temporarily storing input information from the input unit 1, and 3 denotes a Roman character via an input buffer 2. This is a Romaji / Kana mutual conversion unit that performs mutual conversion between Kana and Kana. The Romaji / Kana mutual conversion unit 3 converts the Romaji input from the input unit 1 into Kana, and converts the once converted Kana back to the original Romaji. I do. The Romaji or Kana converted by the Romaji / Kana mutual conversion unit 3 is stored in the input buffer 2.

A control unit 4 controls the input buffer 2, the kana-kanji conversion unit 5, the document buffer 6, and the display unit 7, respectively. The kana-kanji conversion unit 5 converts the kana character string converted by the romaji / kana conversion unit 3 into kanji. The character string converted to the kanji is stored in the document buffer 6, and the lower editing is performed under the control of the control unit 4 via the document buffer 6. The contents of the document buffer 6 and the input buffer 2 are displayed on a display unit 7 such as a CRT display or a liquid crystal display.

FIG. 5 shows an example of the arrangement of the input unit 1 shown in FIG. 4. The input unit 1 has a character group 1A including alphabet keys, numeric keys, and kana, and a function key group 1B. The function key group 1B includes a line feed key 1BA, a shift key group 1BB, a back space key 1BC, and a kanji start /
It consists of an end key 1BD and the like. In addition, the present apparatus has an input unit 1
Start by key input from.

Next, the operation examples of FIGS. 4 and 5 will be described with reference to display examples of FIGS. The character data input from the input unit 1 is temporarily stored in the input buffer 2. At this time, if the kana conversion is instructed by pressing the hiragana set key of the shift key group 1BB in advance, and if the input is made in Roman characters using the alphabet keys, The Roman characters are converted at any time into Hiragana by a Roman / Kana conversion unit 3, and the input buffer 2 is rewritten with the converted Hiragana. At the same time, the input buffer 2 is placed at the bottom of the display screen of the display unit 7 via the control unit 4. Is displayed. Further, for example, when the user wants to input a kanji with "stock", he presses the kanji start / end key 1BD of the input unit 1, then inputs "KABUSIKI" using the alphabet keys, and finally enters the kanji start / end again. When the end key 1BD is depressed, the display surface of the display unit 7 becomes as shown in FIG. 6, and “｛KABUKI” is displayed at the bottom of the display screen, and hiragana with both ends enclosed in parentheses is displayed. Incidentally, reference numeral 71 in FIG. 6 denotes a cursor of the input buffer 2, which is displayed in a square shape.

[0010] However, at this time, if it is erroneously entered "KABUSIKU" where "KABUSIKI" should be input in Roman characters, the display screen of the display unit 7 becomes as shown in FIG. Is performed.

Then, in order to correct the wrong "ku" to the correct "ki", the back skip key 1BC is set to 1
When pressed twice, “ku” is controlled by the program of the control unit 4.
Is converted back to "KU" and Romaji by the Roman / kana conversion unit 3, and only the latter vowel "U" is deleted, and only the previous consonant "K" remains in the input buffer 2,
It is displayed on the display screen of the display unit 7 as shown in FIG. Then, if "I" is successively input by an alphabet key, it becomes "KI", and is converted to "" by Hiragana by the Roman / kana mutual conversion unit 3.
As shown, you can enter "入 力". The operations at the time of this correction are the same for other vowels.

[0012]

SUMMARY OF THE INVENTION In the prior art,
There is a problem that it takes a lot of trouble to correct an erroneous input part when an extra key is pressed while inputting Roman kanji. The reason for this is that the size of the keyboard has been changed to a smaller one, and the space has been reduced in a character processing device including a personal computer. For this reason, when pressing a key, extra keys may be pressed due to `` press the target key and the next key at the same time '', etc.In particular, Roman key kanji input requires fewer key operations than kana kanji input In many cases, such erroneous inputs are likely to occur. In the case of such an erroneous input, in the method disclosed in the above-mentioned patent, it is necessary to move the cursor to the erroneous input, delete the cursor, and then input a correct character again. For example, when entering "stock", do not enter "KABUSIKI" but enter "KABU
If "SIKJI" has been entered, the screen display will indicate "Kabushiji" or "Kabushi Kju", and instruct the user to reverse convert the incorrect input "Ji" to Roman characters. Change "J" to "J", delete "J"
This is because "I" or "I" must be input, and "KABUSIKI" must be converted into "Kabushiki" in Roman alphabet conversion and "stock" in kana-kanji conversion.

Accordingly, an object of the present invention is to provide a character processing apparatus which solves the above-mentioned drawbacks and which can easily correct an erroneous input portion when an extra key is pressed during the input of a Roman kanji. Is to do.

[0014]

A character processing apparatus according to the present invention inputs a Roman character from an input unit and converts it into a kana character.
In the character processing device, the first Roman character is input from the input unit.
And then enter the second Roman character entered
A first input buffer to be stored next and the first Roman character
And the second Roman character is a kana character
Means to determine whether a column is
A Roman character conversion table having data to be converted,
The first Roman character and the second Roman character are kana characters
If the character string does not hold, the first input buffer
A second input buffer for moving and storing the second Roman character
And the third input of the romaji continuously input
Sequentially stored in the buffer and the second input buffer, and
The data of the first input buffer and the second input buffer
Data and the Roman character conversion table
Conversion means for converting to kana characters, and the converted kana sentence
A display unit for displaying character candidates, and a table of the display unit
Kana sentence with the desired kana character candidate as the first character in the display state
Conversion character switching means for giving an instruction to display a character string;
Delete kana characters other than the desired initial kana character
Confirmation instruction means for instructing the desired kana character as the first character
And an output for outputting a desired kana character of the first character.
Means .

According to the character processing method of the present invention, the first input
Buffer, a second input buffer, and a romaji conversion table.
And Bull, comprising a screen control means for controlling the screen display, the character processing method in a character processing apparatus for converting by entering the Romaji from the input unit to the kana character, the input unit Kararo
Input a character and store it in the first input buffer
Then, enter the erroneous Roman characters following the Roman characters.
Stored in the first input buffer, and
And the Roman character string of the erroneous Roman character is a kana character
If it does not hold, the Roman characters will be
Move from the input buffer to the second input buffer, and
The next Roman character input to the input unit
Store in the input buffer and the second input buffer,
The log of the first input buffer and the second input buffer.
Character string using the Roman character conversion table
And convert them to the corresponding kana characters and pass them to the screen control unit.
And the kana character as a first candidate and a second candidate, respectively.
To display the screen, and issue the conversion character switching instruction from the input unit.
The character corresponding to the second input buffer
Display on the screen as one candidate, and issue a confirmation instruction from the input unit
If received, delete kana characters other than the first candidate
Characters that use the kana character of the first candidate as the determined kana character
Obtaining a conversion result, the first input buffer and the second
The input buffer is cleared .

Further, an input buffer and a Roman character string
Romanization conversion data with data to convert from kana to kana
Cable and screen control means for controlling screen display,
Roman alphabet sentence input by operating the Roman alphabet key in the input section
In the character processing method in the character processing device that converts a character string to a kana character, during input of a Roman character by operation of the input unit,
Before an extra key is pressed and it does not hold as the kana character
If a Roman character string occurs,
-The input buffer is divided into Roman characters for each Roman character.
And then, for each of the divided Roman characters,
Additional storage of Roman characters input from the input unit and input
Forming a plurality of Roman character strings in a buffer,
Converts each Roman character string in the buffer to the Roman character conversion table.
And convert it to kana characters and pass it to the screen control means,
Kana characters for each of the Roman character strings in the input buffer
As a kana character string as a candidate for Roman conversion
Display on the screen, and in accordance with the conversion character switching instruction from the input unit,
A screen display of the kana character string starting with the desired kana character
The first character by the confirmation instruction from the input unit.
Erase characters other than kana characters from the screen, and
Outputs first name characters .

More specifically, as shown in the block diagram of FIG.
An input unit 8 for inputting an operator's instruction, an input buffer 2 for temporarily storing input information, a kana / kanji conversion unit 5 for converting kana in the input buffer 2 into kanji, and a kana / kanji conversion unit 5 Document buffer 6 for storing data
A display unit 10 for displaying data received from the input buffer 2 and the kana / kanji conversion unit 5;
And a control unit 9 for controlling the data input / output of the document buffer 6, the input / output unit 8, the Roman character editing unit 11, the kana / kanji conversion unit 5, and the display unit 10 from the input buffer 2. The received Roman character string is converted into a kana by comparing it with a Roman conversion table 12, and a character string that cannot be realized as a Roman character is divided into those characters, all combinations that can be realized as a Roman character are selected and converted into a kana, and the input buffer is converted. 2 and a Roman character conversion table 12 in which all the Roman character strings that can be converted to kana and the conversion results are stored.

[Action] By doing so, when a character string that cannot be formed as a Roman character is generated by pressing an extra key while inputting a Roman character, the Roman character editing unit divides the character and forms all the combinations that can be formed as a Roman character. Is selected and converted to kana, the display unit displays it on the screen, and the operator selects the desired character from the input unit, so it is easy to correct incorrect input parts when extra keys are pressed during Roman alphabet input Can be.

[0019]

BEST MODE FOR CARRYING OUT THE INVENTION

[First Embodiment] An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing a character processing apparatus according to one embodiment of the present invention.

In FIG. 1, 2 is an input buffer for temporarily storing input data, 5 is a kana / kanji conversion unit for converting kana in the data in the input buffer 2 to kanji, and 6 is a kana / kanji conversion unit 5. Buffer for temporarily storing the converted document.
Keyboard, mouse, tablet,
An input unit such as a light pen, a joystick, etc., 9 is a control unit such as a CPU having the overall control function of the character processing device, 10
Is a display unit such as a CRT display or a liquid crystal display,
Reference numeral 11 denotes a Roman character editing unit that edits a Roman character document in response to a Roman character input, and reference numeral 12 denotes a Roman character conversion table that records a table for converting a Roman character string into Chinese characters.

The input buffer 2, the kana / kanji conversion unit 5 and the document buffer 6 are the same as those of the prior art.
Has a key of a conversion candidate change instruction from the operator in addition to the function of the conventional input unit (1 in FIG. 4), and a function of passing the conversion candidate change instruction to the control unit 9 is added. The control unit 9 receives a function and a conversion candidate change instruction from the conventional control unit (4 in FIG. 4) that have been passed to the Roman character / kana conversion unit 3 and a conversion candidate change instruction to the Roman character editing unit 11, and a conversion candidate change instruction from the input unit 8. When received, the function of deleting character data to which "candidate" in the input buffer 2 has been added is changed or added. The display unit 10 has a function of receiving character data from the control unit 9 in addition to the function of the conventional display unit (7 in FIG. 4), and adding a function of reversely displaying characters to which "candidate" data has been added.

The Roman character editing unit 11 stores a Roman character converting buffer 111 having a plurality of areas for storing character data received from the control unit 9 therein, and stores various types of character strings in the Roman character converting buffer 111. And a conversion candidate counter 113 for registering which character string is currently subject to kana-kanji conversion from several types of character strings stored in the Roman character conversion buffer 111. And a processing position counter 114 for registering which character string is currently being processed in the character string in the Roman character conversion buffer.
As shown in the flowchart of the Roman character editing unit 11 according to the present embodiment in FIG. 3, the Roman character received from the control unit 9 is compared with the Roman character conversion table 12, and if it can be converted into a kana, the conversion result is input to the input buffer via the control unit 9. In the case of a character string which cannot be converted as a kana but can be a Roman character, the character string including the next character is compared with the Roman character conversion table 12 again. In the case of a character string that cannot be a Roman character, the character string is divided and the next character is added to each character, and all character strings that are valid as a Roman character are selected and converted into kana. Then, data of “candidate” is added except for the pseudonym indicated by the conversion candidate counter 113, and all the pseudonyms in the Roman character conversion buffer 111 are passed to the control unit 9.

When a conversion candidate change instruction is received from the control unit 9, the contents of the conversion candidate counter 113 are updated, and "candidate" data is added again except for the pseudonym indicated by the conversion candidate counter 113, and the Roman character conversion buffer is added. All the pseudonyms in 111 are passed to the control unit 9. The Roman character conversion table 12 stores all the Roman character strings that can be converted into kana and the results of the conversion.

Next, the Roman alphabet editing unit 1 according to the present embodiment
1 will be described with reference to the flowchart of FIG. 2 and 3, a Roman character string is first input from the input unit 8 (S1). If there is no conversion candidate conversion instruction (S2), the conversion candidate counter 113 is input.
From the conversion candidate counter 113 (S3), the value of the conversion candidate counter 113 is replaced with the value of the processing position counter 114 (S4), and the processing position is calculated by subtracting 1 from the value of the processing position counter 114. It is stored in the counter 114 (S5), and it is determined whether or not the value of the processing position counter 114 is 0 (S6). If it is 0, the value of the storage character string counter 112 is stored in the value of the processing position counter 114. It is determined whether the value of the processing position counter 114 is equal to the value of the conversion candidate counter 113 together with the time when the value is 0 in step S6 (S8). If the values are equal, this routine is terminated (S9). "Candidate" is added to the character of the Roman character conversion buffer 111 indicated by the value of the position counter 114.
A mark is added and stored in the input buffer 2, and the process returns to step S5.

If there is a conversion candidate conversion instruction in step 2, the stored character string counter 112 and the processing position counter 1
1 is stored in the value of 14 (S11). Next, the first two characters of the Roman character string are stored in the Roman character conversion buffer 111 (S12), and the character in the Roman character conversion buffer 111 indicated by the value 1 of the processing position counter 114 is compared with the Roman character conversion table 12. (S13), it is determined whether or not the first two characters of the Roman character string can be converted to kana (S14). If not, it is determined whether or not the first two characters of the Roman character string are possible character strings as Roman characters ( S15) If it is a character string that can be a Roman character, the process proceeds to step S31 described below. If it is determined that the character string is not a Roman character, the last character (second character) of the Roman character conversion buffer 111 indicated by the processing position counter 114 is stored. The value is stored in the Roman character conversion buffer 111 indicated by the value +1 of the character string counter 112 (S16). Further, the value of the stored character string counter 112 is incremented by +1 to the value of the stored character string counter 112.
(S17). The value of the storage character string counter 112 is stored in the processing position counter 114 (S18). Next, the next character is stored in the character buffer 2 where data is stored.
To the Roman character conversion buffer 111 (S1
9). The character in the Roman character conversion buffer 111 indicated by the processing position counter 114 is compared with the Roman character conversion table 12 (S20), and it is determined whether the character can be converted to a kana (S21).
Subtract 1 from the value of 14 and store it in the processing position counter 114 (S32), and return to step 32. If conversion is possible in step S21, it is determined whether the value of the processing position counter 114 is equal to the value of the stored character string counter 112 (S2).
2) If they are equal, the conversion result is stored in the Roman character conversion buffer 111 indicated by the value of the processing position counter 114 (S2).
3) If they are not equal, the conversion result into the Roman character conversion buffer 111 indicated by the value of the processing position counter 114 is "candidate"
A mark is added and stored (S24), and the processing position counter 11
1 is subtracted from the value of 4 and stored in the processing position counter 114, and it is determined whether the value of the processing position counter 114 is 0 (S26). If it is not 0, the process returns to step S20. The value of the column counter 112 is stored in the conversion candidate counter 113, and this routine ends (S
9).

If it is determined in step 14 that the characters in the Roman character conversion buffer 111 can be converted into kana, the conversion result is stored in the input buffer 2 (S28), and the characters in the Roman character conversion buffer 111 are cleared. (S2
9) It is determined whether or not the next character exists in the character buffer 2 without being converted (S30). If so, the next character is stored in the first area of the Roman character conversion buffer 111, and the process returns to step S13. If there is no next character, this routine ends (S9).

Next, the operation of this embodiment will be described in detail according to a specific input example. The operation from inputting "KABUSIKJI" by mistake when inputting Roman characters of "stock" and correcting the input will be described.

First, when the operator inputs "KABUSIKJI" from the input unit 8 as the Roman-Kanji input method, "KABUSIKJI" is stored in the input buffer 2 (S1). Next, when the operator presses the kanji start / end key 1BD of the keyboard, for example, to input a Roman character / kana conversion instruction from the input unit 8 (S2), "KABUSIKJI" in the input buffer 2 is passed to the Roman character editing unit 11. The Roman character editing unit 11 stores a character string counter 11
2 is stored (S11), the first two characters "KA" from the received character string are stored in the first area of the Roman character conversion buffer 111 (S12), and the "character string that can be converted as a kana""Or" Cannot be converted as a pseudonym,
It is checked whether the character string is a Roman character string by comparing it with the Roman character conversion table 12 (S13, S1).
4).

Here, since "KA" can be converted into "?", "?" Is stored in the input buffer 2 (S28). Next, the Roman character editing unit 11 similarly processes the next two characters “BU” and the next two characters “SI” (S29, S3).
0, S31, S13, S14), "bu" and "shi" are stored in the input buffer 2 (S28). Next, the Roman character editing unit 11 stores the next two characters “KJ” in the first area of the Roman character conversion buffer 111, and reads “character string that can be converted as a kana” or “character string that cannot be converted as a kana, The character string to be obtained is checked by comparing it with the Roman character conversion table 12 (S14, S15).
Since “KJ” is a character string that cannot be a Roman character, the Roman character editing unit 11 outputs the Roman character conversion buffer 11.
“J” is moved from “KJ” in the first area of “1” to the second area, the value of the storage character string counter 112 is incremented by 1, and “2” is stored (S16, S17). Then, the value of the storage character string counter 112 is stored in the processing position counter 114 (S18), and the next character "I" is added to both (S19), and the first area of the Roman character conversion buffer 111 becomes "1". KI "and the second area are" JI ".
The character string in the Roman character conversion buffer is compared with the Roman character conversion table 12 to determine whether the character string is a character string that can be converted as a kana or a character string that cannot be converted as a kana but is a Roman character. S20, S2
(1, S22), since "KI" in the first area of the Roman character conversion buffer 111 can be converted to "ki", "ki" is stored in the input buffer 2 (S23), and 1 is subtracted from the processing position counter 114. To store "1" (S25). Also, the second “JI” in the Roman character conversion buffer 111
Since “JI” can be converted to “Jiji”, “JI” is replaced with “Jiji” and “candidate” data is added and stored in the input buffer 2 (S24). Then, the Roman character editing unit 11 converts “2” in the stored character string counter 112 into the conversion candidate counter 11.
3 is stored. Next, the Roman character editing unit 11 stores "2" of the stored character string counter 112 in the processing position counter 114 because "1" is obtained by subtracting 1 from "1" of the processing position counter 114 (S27). . And
Since the inside of the processing position counter 114 and the inside of the conversion candidate counter 113 have the same value “2”, the Roman character editing unit 11 ends.

When the processing of the Roman alphabet editing unit 11 is completed, the control unit 9 passes the character string “Kabushijiki (candidate)” in the input buffer 2 to the display unit 10, and the display unit 10 transmits “Kabushijiki”. The display is displayed, and only the “g” to which the “candidate” data is added is highlighted. Then, the cursor is displayed at the next character position.

Next, when the operator finds an erroneous input “ji” from the display unit 10 and issues a conversion candidate change instruction from the input unit 1, the conversion candidate change instruction is transferred to the Roman character editing unit 8 via the control unit 4. The Roman character editing unit 11 subtracts 1 from “2” in the conversion candidate counter 113 and stores “1” in the conversion candidate counter 113 and the processing position counter 114.
The character in the Roman character conversion buffer indicated by the conversion candidate counter 113, that is, the character “KI” stored in the “1” -th area in the Roman character conversion buffer is referred to by referring to the Roman character conversion table 12. ”And stores 2 in the input buffer. Then, the processing position counter 1
Since “1” is subtracted from “1” of “14”, “0” is obtained.
4, the character in the Roman character conversion buffer indicated by the processing position counter 114 and the "JI" stored in the "second" area are converted to "ji" with reference to the Roman character conversion table 12. The data of “candidate” is added and stored in the input buffer 2. Next, the Roman character editing unit 11 subtracts 1 from “2” of the processing position counter 114 and stores “1”. Then, since the inside of the processing position counter 114 and the inside of the conversion candidate counter 113 have the same value “1”, the Roman character editing unit 11 ends.

When the processing of the Roman character editing unit 11 is completed, the control unit 9 passes the character string "Kabashi Kiji (candidate)" in the input buffer to the display unit 10, and the display unit 10 displays "Kabashi Kiji". The “Ji” with the “Candidate” data added
Only reverse display. Then, the cursor is displayed at the next character position.

Next, when the operator gives an instruction to convert kana to kanji from the input unit 8, the control unit 8 converts the "kabushiki" excluding the data "ji" to which the "candidate" is added from the input buffer 2 into a kana / kanji conversion unit. 5, and the kana / kanji conversion unit 5 selects a kanji corresponding to the character string of the received kana, and
To the display unit 10 via the. Then, the operator looks at the result of the kana-kanji conversion from the screen, and if the kana-kanji conversion instruction is not the desired one, the kana-kanji conversion instruction is again input from the input unit 9, and the kana-kanji conversion instruction is transmitted via the control unit 9 to the kana / kanji conversion unit 5. Then, the kana / kanji conversion unit 5 selects the next kanji corresponding to the received kana character string, and passes the kanji to the display unit 10 via the control unit 9. The operator looks at the result of the kana-kanji conversion on the screen, and if the desired kanji is “stock”, issues an instruction to determine the kana-kanji conversion from the input unit 8. Upon passing to the kanji conversion section 5, the kana / kanji conversion section 5 stores the kana / kanji conversion result in the document buffer 6 via the control section 9.

As can be seen from the above description, for example, “KA
If "BUSIKI" is erroneously input as "KABUSIKJI", the correction requires a four-stroke key operation according to the above-described prior art, but according to the embodiment of the present invention, a one-stroke key operation is sufficient. The effect is clear.

[Second Embodiment] In the present embodiment, a description will be given in comparison with a conventional example while taking into account the display state thereof in accordance with a specific Roman-Kanji input method. In the case of inputting, for example, "ra" in Roman kanji input, the keys are pressed in the order of "R", "A".

However, when "R" is pressed, the next key "T" is erroneously pressed, and "R", "T", and "A" are input in this order. The character strings of "T" and "A" that are satisfied are converted to "ta", and "R" is treated as invalid or alphabetic. This case is shown in Table 1 as a conventional Roman character input example. This Table 1
In the operation, the operator sequentially indicates the input operation from the input keyboard, the outline of the operation of the Roman character conversion mechanism indicates the mechanical operation in the character conversion device, and the input buffer stores the character information stored in the input buffer 2. The screen display shows a specific display surface state of the display unit 7.

[0037]

[Table 1]

In the Roman alphabet input according to the present embodiment, when a character that cannot be formed as a Roman character is detected in the input character string during the Roman character input, a character that is not formed as a Roman character as in the related art is converted into a Roman character as invalid or as an alphabetic character. In the example, "ta" or "Rta" is converted) and "characters that do not hold as Roman characters are made valid, and consonants input thereafter are converted to be invalid (in the above input example, converted to" ra ")". It is possible to easily correct an input error such as "switching with the touch of a key" and "pressing a key next to a target key together at the time of key input". Table 2 shows the operation and screen display of the Roman character input conversion method according to the second embodiment.
A description will be given using an example of an operation outline in which a character that is erroneously input as “RTA” when inputting “A” and converted into “ta” is corrected to “ra”.

[0039]

[Table 2]

[0040] First, when the operator enters the order of "R", "T", "R" in romaji conversion means input buffer 1 with input buffer inside, and stores the order of "T", in this buffer pseudonym whether string not be satisfied as character determines compared to romaji conversion table storing Roman conversion pattern. Then, "RT" for character string does not hold as a publication in Kana characters, moves one character th input buffer 1 (R) in the input buffer 2.

Next, when "A" is input, "A" is stored in the input buffer 1 and the input buffer 2, and as a result, the characters "TA" and "RA" stored in the respective input buffers are stored. Compare the column with the Roman conversion table,
Convert to "ta" and "ra".

Then, "ta" in the input buffer 1 is passed to the screen control means as a first candidate for Roman character conversion, and "ra" in the input buffer 2 is passed as a second candidate. (The screen display is "Tara".) Here, when the operator gives a determination instruction, the first candidate "T" remains on the screen, and "T" is also input data at a higher rank.
Is passed, but the character to be input this time is "ra", so the operator issues a converted character switching instruction.

Upon receiving the converted character switching instruction, the Roman character conversion means passes "ra" in the input buffer 2 as a first candidate for Roman character conversion and "ta" in the input buffer 1 as a second candidate to the screen control means. (The screen display will be “Lata”.) When the operator issues a confirmation instruction, the first candidate “La” will remain on the screen, and “La” will also be input as the upper-level input data.
Is passed.

As described above, in the present embodiment, it is easy to correct an input error such as "Pressing a key next to a target key at the time of inputting a Roman Chinese character". In addition, in the case of erroneous input of Roman characters, the method described in the conventional example is applied, and when a Roman character string that cannot be converted into kanji is input, the conversion method of the present invention is applied. Accurate character conversion can be performed by reducing operation steps.

[0045]

According to the present invention, in a Roman character input method, a character string that cannot be formed as a Roman character is divided from a Roman character string, and all combinations that can be formed as a Roman character are selected and displayed. When an extra key is pressed and a wrong character string is input, correction can be easily made. The reason is that if an extra key is pressed during Roman character input, the correct character is input again after deleting the erroneous input, whereas the present invention proposes a conversion candidate displayed by erroneous input. Since the operation is simply to select the target character from the, the correction is simplified.

[Brief description of the drawings]

FIG. 1 is a block diagram of one embodiment of the present invention.

FIG. 2 is a flowchart of the Roman character editing unit 11 according to the present invention.

FIG. 3 is a flowchart of the Roman character editing unit 11 according to the present invention.

FIG. 4 is a block diagram showing a conventional technique.

FIG. 5 is a plan view showing a layout of a conventional input unit.

FIG. 6 is a diagram illustrating a usage example showing a display example of a conventional display unit.

FIG. 7 is a view showing a usage example showing a display example of a conventional display unit.

FIG. 8 is a diagram illustrating a usage example showing a display example of a conventional display unit.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Input part 1A Character key group 1B Function key group 1BA Line feed key 1BB Shift key group 1BC Backspace key 1BD Kanji start / end key 2 Input buffer 3 Roman / kana mutual conversion part 4 Control part 5 Kana / Kanji conversion part 6 Document buffer 7 Display unit 71 Cursor 8 Input unit 9 Control unit 10 Display unit 11 Roman character editing unit 12 Roman character conversion table

Continuation of front page (56) References JP-A-7-200566 (JP, A) JP-A-7-129579 (JP, A) JP-A-4-299448 (JP, A) JP-A-4-177565 (JP) JP-A-3-225462 (JP, A) JP-A-62-27858 (JP, A) JP-A-61-194560 (JP, A) JP-A-60-142467 (JP, A) (58) Field surveyed (Int.Cl. ⁷ , DB name) G06F 17/21 G06F 17/22 G06F 17/24

Claims (4)

(57) [Claims] 1. A kana character by inputting a Roman character from an input unit.
In the character processing device for converting to the first character, the first Roman character is input from the input unit, and is successively input.
A first input buffer for inputting and sequentially storing a second Roman character , wherein the first Roman character and the second Roman character are
Means for determining whether or not a character string is satisfied as a kana character
And a file containing data to convert from Roman characters to Kana characters.
Character conversion table, the first Roman character and the second
Is not a character string that can be established as a kana character
The second Roman character in the first input buffer
A second input buffer for dynamic storage and a second input buffer
3 in the first input buffer and the second
The first input buffer and the first input buffer are sequentially stored in the input buffer.
And the data of the second input buffer and the Roman character conversion
Conversion to compare with table and convert to kana character respectively
Displaying the means and the converted kana character candidate
Display unit, and desired kana characters in the display state of the display unit
Instruction to display in a kana character string starting with the candidate
Conversion character switching means, and a desired kana character as the first character
Delete the kana characters other than the desired kana sentence of the first character
Confirmation instruction means for instructing a character, and
A character processing apparatus comprising output means for outputting a desired kana character . 2. A first input buffer and a second input buffer.
To control the screen display
A character processing method in a character processing device, comprising a screen control unit, for inputting Roman characters from an input unit and converting the characters to kana characters, wherein the first input is performed by inputting Roman characters from the input unit.
Stored in a buffer and followed by the Roman character
Input the character and store it in the first input buffer.
Romanized characters of the romaji characters and the erroneous Roman characters
The Roman character if the column does not hold as a kana character
From the first input buffer to the second input buffer
And then the next Roman character sentence entered in the input section
Characters into the first input buffer and the second input buffer.
Stored in the first input buffer and the second input buffer.
The Roman character string is converted using the Roman character conversion table.
On the screen control means it is converted to kana characters applicable respectively
Hand over the kana characters to the first and second candidates, respectively.
To display the screen, and receive the conversion character switching instruction from the input unit.
If so, the character corresponding to the second input buffer is
Display on the screen as the first candidate and confirm instruction from the input unit
Received, delete kana characters other than the first candidate,
A sentence in which the first candidate kana character is a determined kana character
Character conversion result, the first input buffer and the second
2. A character processing method comprising clearing an input buffer of No. 2 . 3. The character processing method according to claim 2, wherein the erroneous Romaji character is one of operation keys of the input unit.
A character processing method characterized by being input with a consonant operation key adjacent to a Roman character . 4. An input buffer, comprising :
Roman character conversion table with data to be converted to first name characters
And a screen control means for controlling screen display.
Roman key is operated and the entered Roman character string is
In the character processing method in the character processing device for converting to kana characters, an extra key is pressed during Roman character input by operating the input unit.
The Roman character string that is not established as the kana character
When the occurrence of a character string, the Roman character string
Divided into individual characters and stored in the input buffer.
Next, for each of the divided Roman characters,
Additional stored Roman characters and store them in the input buffer
Of each character in the input buffer.
Character string in the Kana character conversion table
The input buffer is converted and passed to the screen control means.
Of the Kana character for each Roman character string in
The screen is displayed sequentially as kana character strings as candidates, and
The desired kana character is first
The kana character string as an initial character is displayed on a screen, and the input unit
The other than the kana character of the first character
A character processing method comprising erasing the screen and outputting the first character of the kana character .