JPS60207947A - Character string processor - Google Patents

Abstract

PURPOSE:To simplify the correction of an input character string by displaying a converted character string in a reading character string in every division by operating a backward key and correcting the displayed charater string through character keys in a solid writing conversion system. CONSTITUTION:When an input character string is inputted from an input device 20, the input character string is temporally stored in an input temporary buffer 26, transferred to a reading area in a display memory by a display circuit 30 and displayed on a display screen. If the prescribed volume of input data is stored in the buffer 28, the data are converted into a ''kanji'' (Chinese character)/ ''kana'' (Japanese syllabary) mixing sentense and stored in an input data buffer 28. The stored data are transferred to a converted line area in the display memory 32 and displayed on the display screen. The operator checks the contents of the input data buffer 28 from the post stage in accordance with the operation of the backward key, and if ''/'' is read out during the checking period, deletes only the characters in the converted result character code buffer, deletes only the final character of the character code in the temporary buffer and displays the deleted character in the reading area. The character string in the reading area is corrected.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a character string processing device, particularly a character string processing device for deriving another character string corresponding to an input character string from an input character string, such as a Japanese language word processor translation machine. It is related to the device.

For example, in the ``kana-cooking character conversion'' method, which is widely used in native language processors, a converted character string is generated from a single character string in units of width 8/i or in units of segments. Since word processing such as determining and correcting the Kanji type t^ is performed on a word-by-word or segment-by-segment basis, this method has the disadvantage that the frequency of operator intervention, that is, the frequency of keystrokes, is high.

On the other hand, in a method called "solid writing conversion", word breaks are extracted and converted into 1. (characters) for character strings whose pronunciations are continuously changed to 1 (hirakana) or romaji. Therefore, it has the advantage of being simple to operate since it processes strings in a sentence-wise manner.

When entering text using a keyboard, what is the input? ! 1
There are times when you want to change the human-powered character string to 1st grade by changing your intentions. Such revisions 1 or 11EJl have traditionally been accomplished by manipulating the "backward" (pack space) key and other function keys on the keyboard. For example, as shown in Figure ttS1, the level and clause ν for juku, i, etc.
For kana-kanji conversion in relevel, press backward key 10+'
r to move the large and small cursor 12 back, erase characters in order from the end of the human character string, and then press the character key 91.
In other words, in this case, "TeJ 14 and r % 6 p5
'' key 16 was pressed 1'1 to add a new character to the group.

However, in the Heta-shiki kana-kanji conversion system, the 11: power formula that takes into account many keystrokes like this is not DI. In other words, even though it is a heta-shiki kana-kanji conversion method, it is necessary to operate the ``conversion'' key and the ``no conversion'' key to indicate QIM or clause break. This not only requires the operator to make a judgment each time these complicated key operations are performed, but also does not take full advantage of the features of the Heta-shiki kana-kanji conversion system.

dan - one point The present invention overcomes these drawbacks of the prior art.

It is an object of the present invention to provide a character string processing device that can perform manual modification of character strings with simple operations even in the solid writing conversion method.
] target.

Structure 1 The structure of the present invention will be explained below based on one embodiment.
do.

Referring to FIG. 1, an embodiment of the present invention applied to an eleven 3t1 word processor is illustrated in a conceptual functional block diagram. As shown in the figure, the present embodiment includes a human-powered device 20 such as a keyboard, a display device 22, and a kana-kanji conversion algorithm 24 that performs solid-style kanato k-character conversion by referring to a kanji dictionary, a grammar dictionary, etc. In this embodiment, the human power device 20 has a reading character key for manually inputting reading (table g) characters such as kana or alphahet;
A "backward" key 41 is used to move back the cursor displayed on the display screen of the table R device 22 and delete the character. Of course, the human power device 20 has other function keys, etc.
Since these are not directly related to the understanding of the present invention, their explanation will be omitted. In this specification, the term "character" includes not only kana or alphahent, but also one punctuation mark and other symbols.

Display device 22 may be, for example, a CRT character display device;
The reading character strings input into this system 1, the character strings resulting from Kanatoji conversion, etc. are visually displayed. As shown in FIG. 3, the display screen is 2211. The converted character string, which is the result of e-simulation, is displayed. In addition, in the 24th line, in the first half there is a large or small "l, 1 kana, tochiji" indicating that the conversion operation mode or automatic kana-kanji conversion mode, and after that, inside the "V-" brackets [ ] 100 there is a manual input. A character string and a cursor 12 are displayed. Note that herein, the character string after conversion will be referred to as a converted character string.

The kana-kanji tm algorithm 24 is a functional block that converts an input character string into a kanji-kana mixed character string using a commonly available kana-kanji conversion method. Broadly speaking, this has a kanji extraction function that extracts words from input reading character data, and a kanji conversion function that converts portions of the extracted words that correspond to kanji into kanji characters. When the predetermined input character string of Ashi is accumulated in the input temporary data buffer 28, the kana-kanji conversion algorithm 24 converts the manually readable character string 11 from now on.
It imports data indicating , indexes the kanji dictionary and grammar dictionary, and executes kana-kanji conversion processing. Since the specific processing in these functions is not directly related to the understanding of the present invention,
The explanation will be omitted.

Kana-Kanji conversion algorithm 24 and other blocks are:
For example, it is realized by a processing system such as a microprocessor, and the figure shows blocks according to their functions. For example, the human power device 20 is associated with a large car and time buffer 26 that accumulates the human power input t5 generated in response to the operation of these keys.The human data pamphlet γ28 is a kanji character conversion algorithm. Converted character string converted into a kanji-kana mixed sentence by 24,
That is, it is a bank γ that temporarily stores data indicating the conversion result 4s11. As shown in FIGS. 5 and 6, for example, the conversion results are coded by associating data indicating the nu-nori of those sections, conversion 417 result data, and data indicating its reading, as shown in FIGS. Accumulated. This configuration is for realizing modification of the input character string by using the backward key, as will be described later.

In this example, the ward of Q' +i6! , IJri is /, and the reading is shown in parentheses. At this time, if the reading and the conversion result are the same, that is, if the conversion result is not converted to a kanji, the reading data and () may be omitted. This is advantageous because the storage capacity of the human data pants 728 can be reduced. The human character string that has been converted is deleted from the input buffer 26, and the remaining part is set in the kana-1-moxibustion character conversion algorithm 24.

The display circuit 30 is a circuit that controls the display JA station 22, and its table;1<data is stored in the display memory 32.

The display memory 32 has two storage areas: a conversion area and a reading area. The contents of the human data puffer 28 are transferred to the convertible area under the control of the large/small circuit 30. This is achieved by the large/small circuit 30, which improves the convertibility of both display surfaces of the display section z122 shown in FIG.
displayed on the line. Further, the contents of the input temporary buffer 72B are transferred to the reading area under flI control of the large/small circuit 30. This is displayed by the display circuit 30 in the manual display section of the display screen, that is, in parentheses on the 24th line.

FIG. 4 shows a processing flow for modifying an input character string, which is executed by the kana-missed character conversion algorithm 24 and is related to the present invention. The present invention effectively uses the backward key in order to correct input character strings without requiring complicated operations or judgments during solid kana-kanji conversion. That is, in the flow shown in FIG. 4, from the last character of the manually input character string to the first boat number, characters are erased using the backward key, and when a new character is input manually, automatic conversion is executed. This allows you to use "conversion" and "
It is possible to manually correct character strings without operating the ``no conversion'' section νJ rekey.

As shown in FIG. 3, for example, a case will be explained in which the human-powered character string is corrected to ``When changing the toilet, change j to F.'' When the input character string "When changing the breast cancer" is input using the human power device 20, this input character string data is temporarily stored in the human power supply 26. This is transferred by the display circuit 30 to the reading area of the size memory 32 and displayed on the 24th ladle of the personnel screen.

When the input data for a predetermined period is accumulated in the buffer 26, the kana-kanji conversion algorithm 24 converts it into the kanji-kana mixed sentence "change the meeting time", and the conversion result 11. is stored in the person data pamphlet 728. As described above, the data stored in the buffer 28 includes the converted character, the reading, and the data for reducing νJ in the form of a code, as shown in FIG. i5 in this example.

This conversion result is transferred by the display circuit 30 to the conversion area of the table Iζ memory 32 and displayed on the wS22 line of the display screen. The input string that has been converted is

It is erased from the reading area of the memory 32, and the remaining character ``J'' is shifted to the left and adjusted to the left on the 24th line. This state is shown in Figure 3 (A).
2 is displayed at the end of the single-handed character string.

Therefore, the operator operates the backward key 10 of the input device 20 to move the cursor 12 one character in the direction of the beginning of the sentence, and the input characters are erased one by one, resulting in the state shown in FIG. to state (C).

If you further operate the back key in this state, the last character at the end of the converted character string will be erased, and the erased character will be associated with μν, as shown in (D) of the same figure.
The character string of the nori is read and displayed in the reading area in the form of a character string.

This movement f1 is performed as follows. Backward key 10
In response to the operation, the character codes are checked in order from the end of the contents of the input data buffer 28 (200);
If there is ) in it (202), turn on the reading flag (212), if there is (204), turn off the reading flag (214).None of ()/ and the reading flag is on. If not, the character data indicates the conversion result, so the character code is stored in the conversion result character code temporary buffer at shoulder number 1 (210).If the reading flag is on, the character data is readable. , so the character codes are read and stored in the code temporary buffer in order (216).In this way, in response to the operation of the back key, the conversion result is changed from input data 8tufa 28!Result 4? The character code is read out and stored in the time buffer, and the reading code is read out and stored in the reading code temporary pamphlet.

In this way, the contents of the manual data buffer are checked sequentially from the back, and when / is read out (20B), the change l! ! ! To the resulting character code, only the character character of the tsfa is deleted from the conversion property (218), and only the last character of the character code in the reading temporary buffer is deleted and displayed in the reading area (220), thereby, rtjj3 figure (D) As shown in , the converted character string "Kare" is deleted from the convertibility 22, and "Kae" is displayed in the reading area. The contents of the human data buffer 728 at this time are shown in FIG.

In other words, by operating the backward key 10, characters are deleted one by one from the end of the unconverted input character string. When the backward key reaches the end of the converted character string, one unit of the final delimiter for the converted character Yuu is removed from the converted character string, and the character of Song J[1 is deleted and read as a reading character string. displayed in the area. Of course, the configuration may be such that the last character is not deleted.

Therefore, the operator Nagisa operates the backward key 10 and the character keys according to his/her peace of mind and corrects the character string in the reading area. In this example, ``kae'' has been modified to ``kakuninshite.'' In other words, "E" is deleted by pressing the backward key 10 (Fig. 3 (E)
) ), "Kuninshi" is entered manually using the character key 102. This new input character string is converted into a mixed Kanji-kana sentence by the Kana-Kanji conversion algorithm 24, and the "Confirm"
is displayed in the conversion area, and the remaining part ``shite'' is displayed in the reading area ((F)).

Note that the embodiments described here are for illustrating the present invention, and the present invention is not necessarily limited thereto.
All possible variations and modifications are within the scope of this invention. For example, in the illustrated embodiment, the conversion area and the reading area are provided separately. You may.

Processing Section The character string processing device according to the present invention displays the converted character string as a reading character string in units of 1 step by operating the backward key, and then modifies this reading character string with the character key.
By doing, heta:! - Even in the J conversion method, it is possible to modify input character strings with simple operations.

[Brief explanation of the drawing]

Fig. 1 is an explanatory diagram illustrating a conventional manual character string correction method; Fig. 2 is a functional block diagram conceptually showing an embodiment in which the present invention is applied to a word processor in Motoichi; fjS3 is an ftIj1 diagram; In order to explain the operation of the embodiment shown in FIG. FIGS. 5 and 6 are explanatory diagrams showing examples of the contents stored in the human input data in the embodiment of FIG. 1. 1;sug1ノ,4HL]I 20,,,human power equipment22. ,,display device 24,,heta-gakikana-kanji conversion algorithm 28,,
, Temporary input buffer 28 , Human data eight buffer 30 , Display circuit 32 , Display memory Patent applicant Ricoh Co., Ltd. Figures 1 to 5 (Reca%)/1 (1)
/ No rotation (force's power) Figure 6 / Gori l no Kai ≦ (Reli Rani °゛ u) / Kin 1. ．． 'l
(1;μ)/Sa・Figure 2 2nd Figure 3 +C1112100

Claims (1)

[Scope of Claims] Manual means having a reading character key and a backward key for manually inputting a character string of ttSl by reading character notation, a storage child actor for storing characters, and characters stored in the storage character f stage. and a conversion means for sequentially converting the human-powered character string of 1 fil into a corresponding second character string, and the first stage of conversion is configured to convert the first character string into a corresponding second character string by the human-powered means. When input, +i
iJ record, vrJJ'i sequentially multiply n'IJt in one column and display it on the display means, and sequentially convert into 2 character strings, and when the backward key is operated, the 1st character string If there is a character that has not been converted to the second character,
The unconverted characters are deleted one by one in response to the operation of the backward key, and if there is no unconverted character, the last character of the second string is deleted in response to the operation of the backward key. A character string processing device characterized in that a character string of wSl is defined as one unit of the character string, and at least a part of the character string is displayed on the display means.