JPH076172A - Word processor - Google Patents

Abstract

PURPOSE:To prevent the display of unnecessary characters or the omission of necessary characters by rewriting each character after reconverted characters in a text buffer by a rewriting means when the number of characters of a reconverted KANA/Chinese character coexisting sentence is different from the designated number of characters. CONSTITUTION:A CPU 2 inputs character codes applied from a keyboard 1 to a text buffer memory 3, allows the text buffer memory 3 to successively store them, successively converts KANA character strings stored in the buffer memory 3 into the KANA/Chinese character coexisting sentence from the head side, and rewrites the storage content. Then, a conversion index and information indicating a storage position on a reading table 6 are stored in a relation that they are made to correspond to each character converted into the KANA/ Chinese character coexisting sentence one to one. When the designated number of characters is different from the number of characters of the reconverted KANA/Chinese character coexisting sentence, not only the reconverted characters but also the characters after this in the buffer memory 3 are rewritten.

Description

Detailed Description of the Invention

[0001]

FIELD OF THE INVENTION This invention relates to word processors. In particular, the natural input that the text entered as a kana character string is not converted artificially by the operation of the conversion key etc., but is automatically converted into a kana-kanji mixed sentence sequentially, for example, in units of phrases. System word processor.

[0002]

2. Description of the Related Art In a conventional word processor, a character string is input by inputting a kana character, and it is appropriately changed depending on a word unit or a bunsetsu unit. An operation such as a key operation is repeated to convert it into a kanji or kana-kanji mixed sentence. Generally, a document is created in this manner. However, in order to eliminate the hassle of operating the conversion key, a word processor has been developed that has the function of automatically converting an input kana character string into a kana-kanji mixed sentence, for example, in units of phrases. Has been done.

In such a word processor, in order to more reliably convert the input kana character string into a kana-kanji mixed sentence, in other words, the stage at which it is considered that the input of the kana character string is confirmed, for example, a punctuation mark. When it is input or when the input of the kana character string advances to the next clause, etc., the conversion process to the kana-kanji mixed sentence is executed.However, when converting to the actual kana-kanji mixed sentence, Since the conversion is not performed in consideration of the meaning of the sentence, there is an unavoidable possibility that the input kana character string is converted into a homonym or a character having no other meaning.

In this case, in the conventional word processor that artificially performs conversion, it is possible to select the positive character each time the conversion operation is performed, but in the word processor of the natural input method as described above, the conversion is automatically performed. It is impossible to perform conversion while selecting an orthographic character, since the character input is being performed at a position far ahead of the character.
Therefore, in this type of natural input method word processor, compared with a conventional word processor that artificially converts an input kana character string into a kana-kanji mixed sentence, the character that is once input and converted into a kana-kanji mixed sentence is input. The correction (re-conversion) function of is emphasized more.

[0005]

The present application is an application relating to improvement of the reconversion function. It is assumed that the first half of the sentence converted to the kana-kanji mixed character is converted again. In this case, if the number of reconverted characters is different from the number of characters before reconversion, unnecessary characters are displayed or necessary characters are missing.

[0006] The first object of the present invention is to solve such an inconvenience caused by reconversion. Moreover, in order to perform the re-conversion, it is naturally necessary to input a kana character. For this reason, all Kana character inputs must be stored despite the conversion into Kana-Kanji magic sentences.

A second object of the present invention is to enable re-conversion without storing all kana character input.

[0008]

Means for Solving the Problems The present invention is a word processor for converting a kana input kana character into a kana-kanji mixed sentence, and a text buffer memory (3) for storing each character of the converted kana-kanji mixed sentence. , A display means (5) for displaying each character stored in the text buffer memory (3) on the screen of the display device in the order in which they are stored, and a display means (5) for each character stored in the text buffer memory (3). A reading table (6) for storing reading information of characters converted into kanji, and a reading buffer (7) for reading and storing a kana character string corresponding to a designated character from the reading table (6). , Re-converting means for re-converting the kana character string stored in this reading buffer (7) into a kana-kanji mixed character string and the character string re-converted by this converting means in the text buffer memory (3) You When the number of characters of the designated character and the number of characters of the reconverted kana-kanji mixed sentence are different from each other, the subsequent characters of the text buffer memory (3) are correspondingly stored. And a rewriting means for rewriting.

Further, according to the present invention, in a word processor for converting an input kana character into a kana-kanji mixed sentence, a text buffer memory (3) for storing each character of the converted kana-kanji mixed sentence and the text buffer. Display means (5) for displaying the characters stored in the memory (3) on the screen of the display device in the order in which they are stored, and among the characters stored in the text buffer memory (3), the kanji A reading table that stores the reading information of the converted characters
(6), a correction start position designating means for designating a character converted into kanji as a correction start position, and a correction completion position designating means for designating at least the characters after the character converted to kanji as a correction completion position For the characters in the range designated by the both position designating means, the reading information for the kanji is read from the reading table (6), and the kana character is read from the text buffer memory (3). Read buffer (7) that stores the kana character string corresponding to this specified range of characters, and this read buffer
Re-converting means for re-converting the kana character string stored in (7) into a kana-kanji mixed character string, and the character string re-converted by this converting means is stored in the corresponding position of the text buffer memory (3). And a means for making it possible.

[0010]

As described above, according to the present invention, when the number of characters differs due to re-conversion by the rewriting means, not only the re-converted characters but also the succeeding characters are stored in the text buffer (3). It will be rewritten. Further, according to the present invention,
For the kana characters that are not converted into kana, see the reading table.
The reading information is obtained from the text buffer (3) instead of (6).

[0011]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described below in detail with reference to the drawings showing the embodiments thereof. In the present embodiment, the converted character is provided with an index indicating it on the memory, and when the correction is performed, the characters are converted from the appropriate positions in the already converted sentence, and the subsequent characters are described above. Check the existence of the index of, and if this index is attached, the character that can be corrected,
In other words, it can be displayed as characters that may be erroneously input, and it is also possible to specify the characters before and after that as the range to be corrected, so that it is possible to easily perform re-conversion with this specified range as the target. Is configured.

FIG. 1 is a block diagram showing the configuration of a word processor according to the present invention. Reference numeral 1 in the figure is a key board on which keys for inputting a kana character string or for giving various controls and instructions are arranged. This keyboard 1
The character code, the signal for control / instruction, etc. input from are supplied to the CPU 2. In addition to the various keys that are generally required for a word processor keyboard, such as a conversion key for converting a kana input into a kana-kanji mixed sentence, the keyboard 1 is a search instruction key 1c that characterizes the word processor of this embodiment. A correction start position designation key 1s and a correction end position designation key 1e are provided.

When the search instruction key 1c is operated, a character which may be corrected after the position where the cursor is positioned at that time, in other words, a character in which an input kana character is converted into a kanji character or the like is automatically generated. This is a key to search for a character and position the cursor at the character position. The correction start position designation key 1s is a key for designating the start position of the correction target range, and the correction end position instruction key 1e is a key for designating the end position of the correction target range.

The CPU 2 is a control center for controlling the entire apparatus of the present invention, and inputs the character code given from the keyboard 1 to the text buffer memory 3 which is the first memory to sequentially store the character code, and also to the text buffer. The kana character string stored in the memory 3 is sequentially converted from its head side into a kana-kanji mixed sentence according to a predetermined condition, and the stored content is rewritten.

As described above, the text buffer memory 3 stores the kana character string input from the keyboard 1 or each character converted into a kana-kanji mixed sentence, and by giving this to the video RAM 4 the CRT. Display it on display 5. Further, each character after being converted into a kana-kanji mixed sentence has a conversion index indicating that the kana character is a converted kanji character and information indicating a storage position of the reading on the reading table 6 described later. It is stored in a one-to-one correspondence with each character.

FIG. 2 is a schematic diagram showing the storage structure of the text buffer memory 3, in which a sentence in which a pseudonym is inputted, "Today is a good tenki. Kyo has good weather,
It shows a case in which an example of automatically converted into a sentence mixed with kana-kanji is stored as □ ”(however, □ indicates the cursor position).

Specifically, "kyo" is converted into "kyo", and the character "kyo" converted into kanji is a character converted into a character, that is, a character having reading information. A conversion index (indicated by ◯ in FIG. 2) indicating that and storage position information (indicated by a number in ◯, ie, indicated by) in the reading table 6 of the reading information are stored in a one-to-one correspondence. .

Characters "ha" and "," which have not been converted to kanji in "kyoha" are characters that do not have reading information, in other words, are characters that have not been converted. A conversion index (indicated by x in FIG. 2) is attached. The official letter of "shinkisakusei" is "new creation", but here it is erroneously converted into "new", "strange", and "sex".

By supplying the storage contents of the text buffer memory 3 to the video RAM 4, characters are displayed on the display screen of the CRT display 5 which is a display device. The reading table 6 is a table in which each character having reading information among the characters stored in the text buffer memory 3 described above, in other words, one kana character or a plurality of characters, is used as a kanji character. This is a memory for storing the readings of each character or character after being converted into a word or a phrase containing a character or a plurality of characters, or a mixture of kana and kanji.

FIG. 3 is a schematic diagram of the contents stored in the reading table 6, in which the reading of each character having reading information among the characters stored in the text buffer memory 3 shown in FIG. 2 is stored. There is. Specifically, in the text buffer memory 3, the reading "Kyo" is for the character "Kyo", and the reading "Kyo" is for the characters "Good" and "I" as both integrated words. "Good" is attached to the letters "heaven" and "ki"
About "tenki," which is the reading of the two words,
In the same manner, the data are sequentially stored in the corresponding storage positions.

The reading buffer memory 7 is a memory for temporarily storing the reading of characters in the correction range specified by the correction start position designating key 1s and the correction end position designating key 1e, and the CPU 2 stores the read data. The conversion process is performed for. The document memory 8 is used to store created documents and the like. The printer 9 is used to print a created document or the like. Further, the dictionary memory 10 is
It is used by the CPU 2 for conversion of kana-kanji mixed sentences. Further, the ROM 11 is used to store programs for performing various controls by the CPU 2.

Next, a description will be given of the operation of the word processor having the above-described structure for correcting a character after being input and further converted. 4 is a schematic diagram of the display screen of the CRT display 5, and FIG. 5 is a flowchart showing the operating procedure. Now, for example, if you enter a pseudonym by operating the keyboard 1 "Kyoto is a good tenki.
It is displayed on the display screen of the RT display 5.

However, in reality, at the time when the first punctuation is entered, the characters "Kyoha" before that are converted into a mixed Kana-Kanji sentence and displayed as "Kyoha", and also "Iyotenki". When it is input, "good" is converted to "good", and when the first reading point is input, the characters before it are converted to "weather". As described above, in this word processor, the CPU 2 automatically performs sequential conversion into a kana-kanji mixed sentence when the punctuation or the kana character up to the next phrase is actually input.

Therefore, the character string in which the kana is entered as "Kyowa is a good tenki. Shinki Sakusei Hamo Saku Toshiko □" is automatically converted into a kana-kanji mixed sentence as described above, and is shown in FIG. As shown, "Kyo is a good weather.
When the novelty is in full bloom, it will be displayed as "Trial □". At this point, the contents stored in the text buffer memory 3 and the reading table 6 are as shown in FIGS. 2 and 3, respectively.

In this state, in order to correct the erroneous conversion, the cursor is moved to the beginning position of the sentence, specifically, the position of the character "Kyo", and the search instruction key 1c is pressed. This causes the cursor to be positioned over the first character (in this case the character "Kyo") with the conversion index, as shown in Figure 4c.
In this case, since "Kyo" is the correct character for "Kyoto", the character "Kyo" is converted to "Today" by operating the conversion key.

Specifically, after the search instruction key 1c is operated, the information of the storage position on the reading table 6 of the reading information of the character "Kyo" where the cursor is first positioned is read from the text buffer memory 3. , The corresponding reading “Kyo” is read from the reading table 6 and stored in the reading buffer memory 11. Whenever the conversion key is pressed, the CPU 2 sequentially reads the conversion characters “today”, “strong”, “go” etc. for the reading “kyo” from the dictionary memory 9 and displays them on the display screen of the CRT display 5. To do.

Therefore, the operator cancels the keystroke operation of the conversion key at the time when the regular character "today" is displayed, and performs another operation, in this case, the keystroke operation of the search instruction key 1c or the cursor movement operation. If you go, the orthographic characters "today"
Can be displayed on the display screen as a confirmed character. It should be noted that the converted regular characters "today" are written in order from the corresponding position in the text buffer memory 3, that is, the position where "ki" of "kyo" was stored. When the number of characters is different from "Kyo", each subsequent character is also rewritten in the corresponding moved position.

Further, the conversion index (represented by ◯) for the character once retrieved by the retrieval instruction key 1c in this way is erased. When the search instruction key 1c is operated again, the cursor is displayed as "good", "weather", "new"
Since the character stops after being positioned on the character having the conversion index having the information of sequential reading, if each character is a proper character, the keystroke operation of the search instruction key 1c is repeated. This operation also deletes the conversion index of each character.

On the other hand, when the character is not a regular character, in this example, the "new tactic", which is the conversion character of "shinkisakusei", is not a regular character, so this correction method will be described below. Since the cursor is sequentially positioned on the character having the conversion index by the repetitive operation of the search instruction key 1c, the correction start position designation key 1s is operated at the time of being positioned on the character "new", and further up to the character "sex". The cursor is moved and the correction end position instructing key 1e is depressed.

As a result, as shown in FIG. 4d, the character "novelty" to be corrected is underlined and the cursor is positioned on the next character "ha". By such an operation, "new" of the character "new novelty" designated as the correction range,
The information of the storage position in the reading table 6 of the reading information of each of the “strange measures” and “sex” is the text buffer memory
Is read from the reading table 6 and is stored in the reading buffer memory 11 as the kana character string "shinkisakusei".

Whenever the conversion key is operated, the CPU 2 reads out the conversion character "newly created" or the like for "shinkisakusei" from the dictionary memory 9 and displays it on the display screen of the CRT display 5. Therefore, the operator may carry out an operation to determine this as a regular character. Next, "blooming" is correct "groping", so make this correction.

However, since the first character "MO" of "MOMOKU" is a hiragana character and the text buffer memory 3 is provided with a non-conversion index, the search instruction key 1c after the above-mentioned "new creation" is corrected. When the keystroke operation is performed, the cursor is positioned on the character “Saki” having the next conversion index. In such a case, the operator returns the cursor and positions it on the character "mo", then specifies the character "mo" as the correction range start character by the keystroke operation of the correction start position designation key 1s, and further the character " The cursor is moved to "K" and the correction end position instruction key 1e is operated to specify the correction range end position.

As a result, as shown in FIG. 4e, the character "to bloom" to be corrected is underlined, and the cursor is positioned on the next character "to". By such an operation, the reading of "mo" of the character "mosaki" specified as the correction range is read from the text buffer memory 3, and the storage position of the information of "blooming" reading is read from the text buffer memory 3, In accordance with this, the reading "Saku" is read from the reading table 6 and stored in the reading buffer memory 11 as the kana character string "Mosaku".

Whenever the conversion key is pressed, the CPU 2 causes the dictionary memory 9 to change the conversion characters "search" and "imitation" for the reading "Mosaku" each time the conversion key is operated.
Are sequentially read out and displayed on the display screen of the CRT display 5. Therefore, the operator may carry out an operation to determine this as a regular character. As described above, when the character stored in the text buffer memory 3 is reconverted into another character, each character after that character is rewritten and stored in the text buffer memory 3. Needless to say, since the stored content of the rewritten text buffer memory 3 is given to the video RAM 4, the corrected text is displayed on the display screen of the CRT display 5.

It should be noted that in a natural-input-type word processor, which is designed to sequentially convert a sentence in which kana is input into a kana-kanji mixed sentence according to predetermined conditions and display it on the screen of a display device, each of the kana-kanji mixed sentences after conversion is converted. There is no character and the first index indicating that each character is a Chinese character having reading information and the reading information of that character, storage position information in the second storage means, or reading information. First storage means for temporarily storing the second index indicating that it is a kana character in association with each other in the order of input, and the respective characters stored in the first storage means in the stored order. A display means for displaying on the screen of the display device, and a second of the characters stored in the first storage means in association with the reading information of the character to which the first index is attached, respectively. Storage means, before After an arbitrary position of the character string displayed on the screen of the display device, search instruction means for searching for a character having the first index each time the operation is performed and instructing the position of the character on the display screen, A correction start position designating means for designating a character designated by the search designating means or a character having the second index before that as a correction start position, and a character designated by the search designating means or a subsequent character. Regarding the correction end position designating means for designating as the correction completion position and the characters designated by the search designating means or the range of characters designated by both the position designating means, for the characters with the first index, The reading information is read from the second storage means, and for the characters with the second index, the information of the characters is read from the first storage means. A temporary storage means for storing a character string, conversion means for converting a character string stored in said temporary memory means in the kana-kanji mingled string,
A unit for storing the character string converted by the converting unit in a corresponding position of the first storage unit, and a first index of the character string stored in the first storage unit by the unit are deleted. It may be a word processor characterized by including means.

[0036]

As described above, according to the present invention, when the rewriting means changes the number of characters due to re-conversion, not only the re-converted characters but also the following characters can be stored in the text buffer ( Since 3) is rewritten, the inconvenience caused by re-conversion is eliminated. Further, according to the present invention, for kana characters that are not converted into kana, since the reading information is obtained from the text buffer (3) instead of the reading table (6), all input kana characters in the reading table (6) are obtained. Re-conversion is possible without storing.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of a word processor according to an embodiment of the present invention.

FIG. 2 is a schematic diagram showing a storage structure of a text buffer memory of this embodiment.

FIG. 3 is a schematic diagram showing a storage structure of a reading table of this embodiment.

FIG. 4 is a schematic diagram of a display screen of this embodiment.

FIG. 5 is a flow chart for explaining the operation procedure of this embodiment.

[Explanation of symbols]

 (1) Keyboard, (2) CPU, (3) Text buffer memory, (5) CRT display, (6) Reading table, (7) Reading buffer memory.

Claims (2)

[Claims] 1. A word processor for converting a kana input kana character into a kana-kanji mixed sentence, a text buffer memory (3) for storing each character of the converted kana-kanji mixed sentence, and the text buffer memory (3). Display means (5) for displaying each character stored in the display on the screen of the display device in the order stored, and among the characters stored in the text buffer memory (3), the characters converted to kanji The reading table (6) for storing reading information of the reading, the reading buffer (7) for reading and storing the kana character string corresponding to the designated character from the reading table (6), and the reading buffer (7). Re-converting means for re-converting the stored kana character string into a kana-kanji mixed character string, and storing the character string re-converted by this converting means in the corresponding position of the text buffer memory (3). If the number of characters of the designated character and the number of characters of the reconverted kana-kanji mixed sentence are different, each subsequent character of the text buffer memory (3) is correspondingly rewritten by rewriting means. A word processor characterized by comprising: 2. In a word processor for converting a kana input kana character into a kana-kanji mixed sentence, a text buffer memory (3) for storing each character of the converted kana-kanji mixed sentence and the text buffer memory (3). Display means (5) for displaying each character stored in the display on the screen of the display device in the order stored, and among the characters stored in the text buffer memory (3), the characters converted to kanji The reading table (6) that stores the information of reading, the correction start position specifying means that specifies the characters converted to Kanji as the correction start position, and at least the characters after the characters converted to Kanji have been corrected. Correction completion position designating means for designating as a position, and for the characters in the range designated by the both position designating means, the reading information for the kanji is read in the reading table.
(6), for kana characters, that character is read from the text buffer memory (3), and a reading buffer (7) for storing kana character strings corresponding to the characters in the specified range; and this reading buffer Re-conversion means for re-converting the kana character string stored in (7) into a kana-kanji mixed character string, and the character string re-converted by this conversion means is stored in the corresponding position of the text buffer memory (3). A word processor, which is provided with: