JPH08297664A - Character string processor - Google Patents

Abstract

(57) [Summary] [Object] To provide a character string processing device capable of uniquely selecting a desired character string from a plurality of previously registered character strings by designating a partial character string of the desired character string. [Configuration] Keyboard 108 in the character string group registration mode
The character string input from etc. is registered in the RAM 102,
In the character string group calling mode, the corresponding character string is retrieved from the character string group of the RAM 102 based on the information input from the keyboard 108 and output. In this calling mode, RA
A character string including the character string input from the keyboard 108 as a partial character string in the middle of the character string group of M102 is searched and output. Therefore, even if a plurality of character strings having the same first partial character string are registered, a desired character string can be selected only by one operation by designating a partial character string in the middle.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character string processing device mounted on a word processor capable of inputting and editing characters, a personal computer, a notebook-sized electronic computer, etc. The present invention relates to a character string processing device for inputting data such as the character strings described above, selecting a desired character string from a character string group stored in advance in a memory, and enabling document editing processing using the selected character string. .

[0002]

2. Description of the Related Art In the following description, a character string mixed with kanji means a character string containing one or more kanji characters, a kana character string means a character string not containing kanji, and a character string is at least 1
Refers to something that includes more than one character.

Conventionally, in a Japanese word processor,
Some have a function (shortening conversion function) for saving labor when re-inputting a mixed Kanji character string that has been converted into Kana once. How to store columns is explained. For example, Japanese Patent Publication No. Sho 62-4
In the technique disclosed in Japanese Patent No. 6029, when a kana character string is first input from a keyboard or the like and converted into kana-kanji,
By registering the mixed kanji character string after kana-kanji conversion in the storage device using the shortened kana character string (for example, the first one character) obtained by shortening the kana character string to only a few characters from the beginning, When a few characters at the beginning of the kana character string, for example, one character is input to give an instruction for abbreviated conversion, a corresponding kanji character string registered in advance is called. FIG. 20A shows how a character string is registered by this conventional technique. In the figure, the character string "Beauty" mixed with Kanji is associated with the headword "U".
Is registered. With this, "beauty" can be called by inputting "u".

Conventionally, if a frequently used character string is registered in advance and then the character string is shortened to a few characters from the beginning and the calling instruction is given, the corresponding character string can be called. There was that. For example, in the technique disclosed in Japanese Patent Laid-Open No. 57-150025, the character string is first registered by pressing the registration key, then inputting the character string and pressing the delimiter key, and then pressing the call key and then the character string. When a character string shortened to several characters from the beginning of is input, the character string is called. FIG. 20B shows how a character string is registered by this conventional technique. In the figure, the character strings "word" and "repeatedly used" are registered in advance. With this, by inputting "single", "word" can be called by inputting "word" and "repeatedly used".

Further, conventionally, there has been a method in which a handwritten pattern and a character string corresponding thereto are registered in advance, and then the corresponding character string is called by inputting the handwritten pattern and issuing a calling instruction. For example,
In the technique disclosed in Japanese Patent No. 34259, a commonly used character string is registered in association with a pattern such as an abbreviation or a symbol, and when the pattern such as the abbreviation or the symbol is input,
It is possible to call the associated character string. FIG. 20C shows how a character string is registered by this conventional technique. In the figure, the character string “telephone” is registered in association with the cursive pattern “tel”. Thus, the character string "telephone" can be called by inputting the cursive pattern "tel".

[0006]

DISCLOSURE OF THE INVENTION Problems to be Solved by the Invention
According to the technique disclosed in Japanese Patent No. 6029, once a kana character string is converted into a kanji mixed character string or non-converted, the kana character string is shortened to a few characters from the beginning to input the kana character string. It is possible to call the corresponding kanji mixed character string or the non-converted kana character string, but in this case the kana character string obtained by shortening is the same kanji mixed character string or the non-converted processed character string. If there are a plurality of kana character strings, there is a problem that they cannot be called separately. For example, if kana character strings "Kanamojiretsu" and "Kanakanjihenkan" are registered, even if the kana character string "Kana" shortened from the beginning is entered, one of them cannot be selected.

Also, in the technique disclosed in Japanese Patent Laid-Open No. 57-150025, when there are a plurality of character strings having the same leading partial character string among the registered character strings, the character strings are distinguished and called. There was a problem that I could not. For example, if two character strings of "input speed" and "input character string" are registered, even if the character string "input" shortened to the first two characters is specified, one of them is selected. It is not possible. In addition, when a short character string is input by handwriting, if the number of strokes is large, it takes time and effort for inputting, and error is likely to occur.

On the other hand, in the technique disclosed in Japanese Examined Patent Publication No. 6-34259, since the character string is registered in advance in association with the character pattern, the beginnings of a plurality of character strings to be registered are the same. Even if there is, by registering each character string so that the corresponding character pattern is different, it is possible to distinguish and call a plurality of character strings, which seems to solve the above-mentioned problem. However, the character pattern is represented by time-series coordinate data indicating a writing stroke, that is, the starting point coordinate, the ending point coordinate, and the bending point coordinate (plural) of the writing stroke, and it is necessary to store this for the number of strokes of the character. Therefore, the problem of consuming a large amount of storage capacity remains, which cannot be a solution to the problem.

Furthermore, in the technique disclosed in Japanese Laid-Open Patent Publication No. 63-136182, the pattern of one part (radical) of Kanji is input by handwriting, and the technique disclosed in Japanese Laid-Open Patent Publication No. 2-177726 is also used.
In the technology disclosed in Japanese Patent Publication, a target kanji character is selected from candidate kanji consisting of the radical by inputting the stroke number of the radical. There is a problem in that when you call, you cannot specify a radical, and you cannot call a character string that contains a kanji that is composed of that radical, and you have to specify the kanji, which is troublesome. .

In the technique disclosed in Japanese Patent Laid-Open No. 57-150025 or Japanese Patent Publication No. 6-34259, frequently used character strings must be registered in advance by a predetermined method. After the user knows what the frequently used character string is, he / she must register it. Also, when entering texts in different fields, the frequently used character strings may be completely different, so it is necessary to register many character strings to enter various texts. However, there was a problem that it took a lot of work and was not efficient.

Therefore, an object of the present invention is to provide a character string processing device capable of uniquely selecting a desired character string from a plurality of previously registered character strings by designating a partial character string of the desired character string. That is.

Another object of the present invention is to provide a character string processing device capable of selecting a desired character string from a plurality of character strings registered in advance by designating a radical of a Chinese character in the desired character string. It is to be.

Still another object of the present invention is to provide a character string processing device capable of efficiently registering a character string.

[0014]

According to a first aspect of the present invention, there is provided a character string processing device, wherein a storage means in which data including a character string group is registered, an input means for inputting information including a character string,
In the registration mode of the character string group to the storage means, the registration means for registering the character string input from the input means in the storage means, and the information input from the input means in the call mode of the character string group from the storage means And a calling means for outputting a character string by searching a character string group in the storage means based on the character string input from the input means from the character string group in the storage means. A first search means for searching a character string included as a partial character string in the middle is included.

A character string processing device according to a second aspect is the character string processing device according to the first aspect, wherein the registration means further stores the character string output by the calling means into a character string group of the storage means. Configured to register.

A character string processing device according to a third aspect is the character string processing device according to the first or second aspect, wherein:
The information input by the input means further includes radicals, and the data registered in the storage means further includes a kanji radical correspondence table in which each radical is stored in association with each radical. The calling means further specifies a kanji string corresponding to the radical input from the input means from the kanji radical correspondence table, and searches for a character string including the specified kanji string from the character string group in the storage means. The second search means is included.

A character string processing device according to a fourth aspect is the character string processing device according to any one of the first to third aspects, wherein the calling means is further provided by an input means in the character string group of the storage means. In the character string including the input character string, a third search means for searching a character string subsequent to the input character string is included.

A character string processing device according to a fifth aspect is the character string processing device according to any one of the first to fourth aspects, in which the input means further inputs a kana-kana mixed character string to input kana characters. The registration means further includes a kana conversion means for converting into a column, and the registration means further associates the kanji / kana mixed character string input from the input means with the kana / character string converted by the kana / kana mixed kana character conversion means of the input means. The calling means further includes means for registering in the character string group, and the calling means further searches the character string group in the storage means based on the kana character string input by the input means, and the kana character string including the input kana character string in the partial character string. It is configured to output a character string mixed with kanji and kana corresponding to the character string.

A character string processing device according to a sixth aspect is the character string processing device according to any one of the first to fifth aspects, wherein the input means further inputs a kana character string to form a kanji / kana mixed character string. The registration means further includes a kanji conversion means for converting, and the registration means further associates the kana character string input by the input means with the kanji kana mixed character string by the kanji conversion means of the input kana character string into a character string group of the storage means. The calling means further includes means for registering, and searches the character string group of the storage means based on the kanji string input by the input means, and corresponds to the kanji kana mixed character string including the input kanji string as a partial character string. And a means for outputting the kana character string of.

According to a seventh aspect of the present invention, there is provided a character string processing device, wherein the registration means of the character string processing device according to any one of the first to sixth aspects further includes a character string input from the input means in a predetermined unit. It is configured to include a character string division / registration unit that is divided into and is registered in the character string group of the storage unit.

[0021]

In the character string processing apparatus according to the first aspect, the registration means registers the character string group in the storage means in advance in the registration mode. In the subsequent calling mode, the calling means is the first
Using the search means, a character string including the character string input by the input means as a partial character string in the middle of this character string group is searched and output.

In the character string processing device according to the second aspect, the registration means of the device according to the first aspect registers the character string output by the calling means in the character string group of the storage means.

In the character string processing device according to the third aspect, the calling means of the device according to the first or second aspect further has a second searching means, and the character string group registered in the storage means by the registration means in advance is input. A character string including a Kanji character string corresponding to the radical input from the means is retrieved and output.

In the character string processing device according to a fourth aspect, the calling means of the device according to any one of the first to third aspects further has a third searching means, and is input by the input means in the character string group of the storage means. A character string including the input character string is searched for a character string formed after the input character string and is output.

In the character string processing device according to claim 5, in the device according to any one of claims 1 to 4, the input means has a kana conversion means to input a character string mixed with kanji and kana to form a kana character string. The conversion means registers the character string mixed with the kanji kana input by the input means and the kana character string by the kana conversion means of the input kanji kana mixed character string in the character string group of the storage means in association with each other, and calls. The means searches the character string group of the storage means based on the kana character string input by the input means, and outputs a kanji kana mixed character string corresponding to the kana character string including the input kana character string in the partial character string. .

In the character string processing device according to claim 6, in the device according to any one of claims 1 to 5, the input means inputs the kana character string by the kanji conversion means and converts it into a character string mixed with kanji and kana, The registering means registers the kana character string input by the inputting means and the kanji kana mixed character string by the kanji converting means of the input kana character string in the character string group of the storing means in association with each other, and the calling means inputs by the inputting means. A character string group in the storage means is searched based on the selected kanji character string, and a kana character string corresponding to the kanji kana mixed character string including the input kanji character string in the partial character string is output.

In the character string processing device according to claim 7, the registration means of the device according to any one of claims 1 to 6 further has character string division registration means, and the character string input from the input means is predetermined. Each of the divided character strings is registered in the character string group of the storage means while being divided into unit character strings.

[0028]

Embodiments First to fifth embodiments of the present invention will be described below. In each of the following embodiments, the case where the character string processing device is applied to a Japanese word processor is illustrated, but the present invention is not limited to this.

FIG. 1 is a block diagram of a Japanese word processor according to the first to fifth embodiments of the present invention. The Japanese word processor, as shown in Figure 1,
A CPU (abbreviation of central processing unit) 101 is provided which controls the operation of each component constituting the apparatus via an address bus and a data bus and executes various programs.

The CPU 101 includes a RAM (abbreviation of random access memory) 102 for storing various data such as document data and variable data, and a ROM (read only memory) for storing various data such as various control programs and kana-kanji conversion dictionary. Is omitted) 103 is connected. Also CPU
Reference numeral 101 denotes a printer 10 for printing document data.
4, a display device 105 for displaying document data, a tablet 107 integrated with the display device 105, a pen 106 having a switch at its tip to indicate a position on the tablet 107, document data by a user's key operation A keyboard 108 for inputting information such as, and a floppy disk for saving / recalling document data (hereinafter,
The printer controller 110, display controller 111, tablet / pen controller 112, key interface 113 and F
It is connected via the D controller 114.

2A and 2B show the RAM of FIG.
FIG. 3 is a diagram showing a data structure of a ROM 102 and a ROM 103. As shown in FIG. 2A, the RAM 102 has an area 121 for storing document data including kana, English characters, symbols and Chinese characters, and an area 12 for storing various variable data.
2. Area 123 for storing data for abbreviated input, area 124 for storing data displayed on the display device 105
And an area 125 for storing other data.

In the ROM 103, as shown in FIG. 2B, a document editing program 126 for a document editing process such as cursor movement and character insertion / deletion / copying, a printer 104, a display device 105, and a pen 106. I / O device control program 12 for controlling various I / O (input / output) devices such as a tablet 107 and a keyboard 108
7. Kana-Kanji conversion program 128 for performing Kana-Kanji conversion processing, Kana-Kanji conversion dictionary 129 in which data for Kana-Kanji conversion is registered, handwritten character recognition program 130 for recognizing handwritten characters, handwritten character recognition A handwritten character recognition dictionary 131 in which data is registered, an abbreviated input program 132 for performing abbreviated input processing, character font data 133 for display and printing, and other data 134 are stored.

To print the document data by the printer 104, the CPU 101 converts the document data in the area 121 of the RAM 102 into image data based on the setting format and the character font data 133 of the ROM 103 according to the I / O device control program 127 of the ROM 103. This is performed by transferring to the printer controller 110.

In displaying the document data on the display device 105, the CPU 101 converts the document data in the area 121 desired to be displayed on the display device 105 into image data based on the character font data 133 according to the I / O device control program 127 of the ROM 103. When stored in the display data area 124 of the RAM 102, the display controller 111
Performed by.

The display data area 124 is composed of, for example, three display planes (R, G, B). For example, if data is stored only in the R plane, the data is displayed in red, and the G plane is not displayed. For example, the green plane is displayed in blue, and the B plane is displayed in blue. When the same data is stored in all the R, G, and B planes, the data is displayed in white.

When inputting coordinates such as handwritten characters with the pen 106 and the tablet 107, the pen tip switch is turned on by the user pressing the pen 106 against the tablet 107.
This is performed by detecting the position on the position 7 on the tablet / pen controller 112 and transferring the coordinate data to the CPU 101.

According to the handwritten character recognition program 130, the CPU 101 compares and analyzes the coordinate sequence (stroke) input by the pen 106 and the tablet 107 with the data registered in the handwritten character recognition dictionary 131.
Recognize handwritten input characters in real time.

When the user presses a key on the keyboard 108, the key interface 113 detects the position of the pressed key and transfers the corresponding key code to the CPU 101 to input the document data using the keyboard 108. . The keyboard 108 includes non-Kanji character input keys such as kana keys, alphabetic characters, and numeric keys, cursor editing keys, document editing keys such as character deletion keys and copy keys, conversion keys, next candidate keys, and non-conversion keys. Kana-to-Kanji conversion keys such as, print key, document recall key and document registration key function keys are installed.

Registration of document data in the FD 109 is performed by the CPU.
101 is the I / O device control program 12 of the ROM 103
FD control command (registration) and RAM 10 according to 7.
The document data in the second area 121 is stored in the FD controller 114.
It is performed by transferring to.

When the document data is called from the FD 109, the CP
U101 is the I / O device control program 1 of the ROM 103
When the FD control command (call) is transferred to the FD controller 114 according to 27, the FD controller 114
The document data is read from D109 and is read out from the RAM102.
This is performed by transferring the document data to the area 121 of the document data.

First, the first embodiment will be described. FIG.
FIG. 3 is a schematic flowchart for creating document data using an input character string or a registered character string in the Japanese word processor according to the first embodiment of the present invention.
According to the first embodiment, when a character string is input, it is stored in the RAM.
If you want to input the same character string next time after registering it in 102, if you input a shortened character string that shortens the character string to several characters from any position and issue a call instruction, the entire character string is called. be able to. The details will be described with reference to the flowchart of FIG.

First, in step (hereinafter abbreviated as S) 101, a character string buffer BUF1 is secured in a variable data area 122 and initialized.

In S102, a character string is input from the keyboard 108 or the like, and the input character string is stored in the buffer BUF1. The input character string is simultaneously displayed on the display device 105. The input character string here is a kana character string input from the keyboard 108, a kanji mixed character string obtained by converting the kana into kana, the tablet 107 and the pen 1.
For example, there is a character string mixed with kanji that is input by handwriting and recognized by 06. Since the input of these character strings is a known technique, detailed description thereof will be omitted.

In S103, the number of characters of the character string input to the buffer BUF1 is substituted into the variable n. The variable area is secured in the variable data area 122.

In S104, it is determined whether or not there is an instruction to register a character string, and if there is an instruction, the process proceeds to S105, and if not, the process proceeds to S106. As a registration instruction here, the user operates the keyboard 108 or the pen 10
6 is operated on the tablet 107 or the like. In S105, the character string stored in the buffer BUF1 is registered. The details of the registration process in S105 will be described later with reference to FIGS. 4 and 5.

In S106, it is determined whether or not there is an instruction to call a character string. If not, the process proceeds to S102, a new character string is added to or changed in the buffer BUF1, the same processing is repeated, and the instruction is given. If so, the process proceeds to S107. As a calling instruction here, the user operates the keyboard 108 or the pen 106 is pressed on the tablet 1
It is performed by operating on 07.

In S107, a character string calling process is performed. The details of the calling process in S107 will be described later with reference to FIGS. 6 and 7.

Although the above-mentioned registration instruction is performed by the user every time a unit character string desired to be registered, for example, a phrase is input, a continuous character string is collectively input without considering the phrase, Alternatively, the character string may be automatically divided for each clause, and the divided character strings may be automatically registered. Details of the processing will be described later with reference to FIG.

Next, the details of the registration processing in S105 of FIG. 3 will be described. FIG. 4 is a format diagram of the area 123 of the shortened input data according to the first embodiment of the present invention.

In the area 123 of the abbreviated input data, for each character string to be registered, the data D including the number of characters C, the character string CH and the number of times CO of using the character string CH is stored. Further, the data D is stored in the area 12 in the order of registration.
Since they are stored side by side from the rear of 3, the data D stored at the beginning is the most recently registered data. The number of characters C is stored in the area for one address, the character string CH is stored in the area for N addresses, and the number of times of use CO is stored in the area for one address. An "end code" indicating the end of the data is stored at the position next to the last data D.

FIG. 4B shows a state in which the character string "character string formed by kana or kanji" in the buffer BUF1 is actually divided and registered for each clause.

FIG. 5 is a flowchart of the registration processing according to the first embodiment of S105 of FIG. The registration process of FIG. 5 will be described below. In this flowchart, the buffer BUF1 targets only n characters (the number of characters of the value of the variable n) from the beginning.

In S111, the area 123 of the shortened input data
Is searched to determine whether or not the content of the buffer BUF1 is already registered. If registered, the process proceeds to S112, and if not registered, the process proceeds to S113. To determine whether the character string has already been registered, first check the buffer BUF1.
The character string CH having the same character number C as the character number n of the character string of is searched from the area 123 of the shortened data, and the searched character string CH and the character string of the buffer BUF1 are sequentially compared one by one, and a complete match is found. If S112, otherwise S1
Move to 13. In S112, the area 1 of the shortened input data
23, the number of times CO of the character string CH that matches the buffer BUF1 searched in S111 is incremented by 1, and the data D is rearranged (the data D related to the searched character string CH is added to the end of the data group in the area 123). (Moving to the tail) is performed, and the process proceeds to S116.

On the other hand, in S113, it is judged whether or not there is an empty area for registering a character string in the area 123 of the abbreviated input data. If there is an empty area, the operation proceeds to S115.
If not, the process proceeds to S114.

In S114, the area 123 of the shortened input data
Is deleted and the data D having a small number of times CO is deleted. In order to select the data D to be deleted, first, a predetermined number (for example, 10) of data (10 oldest data) D is selected from the end of the area 123 of the abbreviated input data, and in the data D group. Select the one with the least number of uses CO. At this time, if there are a plurality of data D having the least number of times CO used, one of the data D used most recently is selected. The data D selected in this way may be deleted. In addition, after the data D is deleted, the usage counts CO of the selected data D are all decreased by 1 (however, the minimum value is 0).

By the above-described processing of deleting data having a low frequency of use, even a character string CH that has not been used for a while, a character string that has been used a large number of times CO is not deleted, and a character string CH that has been used a small number of times CO is given priority. Will be deleted. However, if a character string that has been used many times is not used for a long time, the number of uses CO is decreased by 1 as described above, and is eventually deleted from the area 123. At this time, by setting the number for reducing the usage count CO to a number other than 1, the period until deletion can be arbitrarily changed.

In S115, the number of characters CO of the character string in the buffer BUF1, the character string CH that is the contents of the buffer BUF1, and the number of uses CO (= 1) are additionally stored at the beginning of the area 123. At this time, the data D already stored in the area 123 is sequentially moved backward.

In S116, the contents of the buffer BUF1 are stored in the area 121 of the document data, and in S117, the document stored in the area 121 of the document data is displayed on the display device 105, and the character string registration processing ends. In response to this end, the processing shifts to S101 in FIG.

In the character string registration processing of FIG. 5 described above, when there is no space in the area 123 of the abbreviated input data, the most frequently used character string (the number of times of usage CO The character string CH having a low) is deleted, the new character string input this time is registered in place of it, and the information on the frequency of use of these plural character strings is reduced by a predetermined amount. As a result, the character string CH that is originally often used (the number of times CO is used frequently) but has not been used for some reason for some reason will not be deleted from the area 123.

Next, details of the calling process in S107 of FIG. 3 will be described. FIG. 6 is a flowchart of the calling process according to the first embodiment of S107 of FIG. In S121 of FIG. 6, 0 is assigned to the flag variable F, and in S122, the variable a is set.
The start address of the area 123 of the abbreviated input data is substituted into, and then the character string buffer BUF2 is initialized in S123. The flag variable F indicates the search mode, and when the value is 0, the character string of the buffer BUF1 and the area 123
And the character string in the buffer BUF1 and the character string in the area 123 when the value is 1, the mode in which the intermediate character is searched.

In S124, the character string CH including the character string in the buffer BUF1 is searched from the area 123 of the shortened input data. The retrieved character string CH is stored in the buffer BUF2. Buffer BU if the string is not found
F2 remains in the initialized state and nothing is stored. In addition, S
Details of the search processing of 124 will be described later with reference to FIG. 7.

In S125, the buffer B in S124
Whether or not the character string CH including the character string of UF1 is found is determined from the contents of the buffer BUF2. If found, the process proceeds to S127, and if not found, the process proceeds to S126.

In S126, since the character string CH including the character string of the buffer BUF1 as a partial character string is not registered in the area 123, the character string of the buffer BUF1 is copied to the buffer BUF2 and the process proceeds to S134.

On the other hand, in S127, the character string of the buffer BUF2 (the character string retrieved from the area 123 in S124) C
H is displayed on the display device 105. S according to this display
In 128, it is determined whether or not the user has instructed to display the next candidate. If there is an instruction, the process proceeds to S123, the same processing is repeated to retrieve the next character string from the area 123, and if there is no instruction, S129. Move to.

In S129, it is determined whether the value of the variable F is 2, and if it is 2, the process proceeds to S132, and if it is not 2, the process proceeds to S130. The value 0 of the variable F means that the character string of the buffer BUF1 matches from the first character of the character string CH of the area 123, and if the value of the variable F is 1,
The character string of the buffer BUF1 matches from the middle character of the character string CH of the area 123, and the character string CH becomes the buffer BUF2.
Is called, and the value of the variable F is 2,
The character string in the buffer BUF1 indicates that the range from the middle of the character string CH in the area 123 is called by the buffer BUF2.

In S130, the usage count CO of the area 123 corresponding to the character string CH retrieved in S124 is incremented by one.

In S131, the data D (the number of characters C, the character string CH and the number of uses CO) relating to the character string retrieved in S124 is moved to the beginning of the area 123, and then S
Move to 134. As a result, when the area 123 is searched with the same character string next, this character string is displayed as the first candidate.

On the other hand, in S132, the contents of the buffer BUF2 are copied to the buffer BUF1.

In S133, the contents of the buffer BUF1 are registered in the area 123 according to the procedure shown in FIG. This is area 123
Buffer BUF1 in the character string CH registered in
It indicates that the character string in the range after the middle of the character string CH including the specified character string inside the middle is registered in the area 123. As a result, when the character string after the midway is called after that, the character string after the midway is preferentially called as the first candidate.

After the character string of the buffer BUF2 is copied to the area 121 of the document data in S134, the document stored in the area 121 is displayed on the display device 105 in S135, and the calling process ends. In response, S101 in FIG.
Move to.

FIG. 7 is a flow chart of the search process according to the first embodiment of S124 of FIG. The search process of S124 will be described with reference to this flowchart.

At S141, 1 is assigned to the variables b and c. In the following description, variables a and b
Is used as a pointer of the area 123 of the shortened input data, and the variable c is used as a pointer of the buffer BUF1. The head address of the area 123 is stored in the variable a in S122 of FIG.

In S142, the address area pointed to by the variable a in the variable m (hereinafter referred to as address (variable a))
Substitute the data of. Area 12 is set to the address (variable a)
Since the number of characters C of the character string in 3 is stored, the variable m
The number of characters C is substituted into.

In S143, it is determined whether or not the variable n is larger than the variable m (the number n of characters in the character string of the buffer BUF1 is larger than the number C of characters in the character string CH in the area 123 of the shortened input data). If not, the process proceeds to S144. In this process, if the variable n is larger than the variable m, the input character string of the buffer BUF1 cannot be a partial character string of the character string CH currently pointed to in the area 123 of the shortened input data, so S1
In step 51, pointer processing is performed to move the search target to the next character string in the area 123. In step S151, the value of the address (variable a) and 2 are added to the variable a.
As a result, the variable a points to the start address of the data D regarding the next character string CH in the area 123.

In S152, it is determined whether or not the end code is stored in the address (variable a). If the end code is stored, the process proceeds to S153, and if not, the process proceeds to S141 and the process is repeated.

In S153, it is determined whether or not the value of the flag variable F is 0. If 0, the process proceeds to S154, and if not 0, this process ends. In response to this, the process proceeds to S125 in FIG. When the value of the flag variable F is 0, the character string CH that matches the character string of the buffer BUF1 from the beginning is searched from the area 123, and when the value of the flag variable F is 1, the characters of the buffer BUF1 are searched. The string that matches the string from the middle of the string is the area 123
It is searched from. By first searching for F = 0 (S121) and then searching for F = 1 (S154), the character string that includes the designated character string at the beginning of the character string CH in the area 123 is in the middle. Will be searched with priority over the character string included in.

In step S154, 1 is assigned to the flag variable F, the head address of the area 123 is assigned to the variable a in step S155, and the process proceeds to step S141 to repeat the process.

On the other hand, in S144, it is determined whether or not the character stored in the address (variable a + variable b) and the character pointed to by the variable c in the buffer BUF1 match.
If they match, the process proceeds to S147, and if they do not match, the process proceeds to S145.

In S145, it is determined whether or not the value of the flag variable F is 1, and if it is 1, the process proceeds to S146, and if it is not 1, the process proceeds to S151.

In S146, the value of the variable b is incremented by 1 and the value of the variable m is decremented by 1,
The process moves to S143 and the process is repeated. As a result, the character string CH in the area 123 is searched for a character string CH that matches the character string in the buffer BUF1 from the middle.

In S147, it is determined whether or not the value of the flag variable F is 1 and the value of the variable b is 1, and if so, the process proceeds to S146, and if not, the process proceeds to S148. When the variable F is 1 (a mode for searching for a match from the middle of the character string), even if the first character of the character string CH in the area 123 and the character string of the buffer BUF1 match, this is ignored. It is a thing.

In S148, the values of the variables b and c are incremented by 1 and the value of the variable m is decremented by 1, and then the process proceeds to S149. In S149, it is determined whether the value of the variable c is larger than the value of the variable n, that is, the buffer BUF.
It is determined whether or not it is determined that all the characters in the character string in 1 match, and if so, the process proceeds to S150, and if not, the process proceeds to S143 and repeats.

In S150, a character string having a number of characters corresponding to the data (character number C) pointed to by the address (variable a) is copied to the buffer BUF2 from the character pointed to by the address next to the address (variable a), and the main processing is performed. To finish. In response to this, the process proceeds to S125 in FIG. As a result, the buffer BUF2 stores the character string including the character string of the buffer BUF1 among the plurality of character strings CH registered in the area 123 of the shortened input data.

The process of S150 may be changed to the process of S150 'shown in FIG. In S150 ', first, the variable F is set to 2, and the address (variable a +
The character string from the character pointed to by the next address of variable b-variable c) to the character pointed by the address obtained by adding the data (the number of characters C) of the address (variable a) to variable a is copied to buffer BUF2. It As a result, in the buffer BUF2, among the plurality of character strings CH registered in the area 123 of the shortened input data, the buffer BUF
Buffer BUF1 for the character string CH including the character string of 1
The character string after the position that matches the character string of is stored. As a result, when the character at the beginning position of the range (partial character string) to be called in the character string CH registered in the area 123 is input, the partial character string after that position can be called. Only a certain range in the existing character string CH can be easily called. The user may select whether to perform the process of S150 or S150 '.

Next, the second embodiment will be described. FIG.
Is a radical code table 20 applied to the second embodiment of the present invention.
9 is a diagram showing 0, and FIG. 9 is a diagram showing a character radical correspondence dictionary 300 applied to the second embodiment of the present invention. The code table 200 and the dictionary 300 shown in FIGS. 8 and 9 are stored in the ROM 1
03 other data 134. First mentioned above
In the embodiment described above, a desired character string can be retrieved from the area 123 and called out by designating a shortened character string.
In the embodiment, when a character string mixed with kanji is input, it is registered in the storage device, and when it is desired to edit a document using the same character string after that, any kanji included at the beginning or the middle of the character string can be used. By inputting a radical string (consisting of at least one radical) and issuing a calling instruction, the corresponding character string can be called to edit the document. For example, when a character string "shortened input" is called, it can be called by designating a "short" radical "arrow" or a "contracted" radical "thread" or both.

The flow of processing according to the second embodiment follows the flow charts shown in FIGS. 3, 5, 6 and 7 described above, so a detailed description thereof will be omitted, but S102 of FIG. 3 is omitted. In the character string input processing of, the point that not only the character string but also the radical of Kanji is input,
Further, the point that the character string CH registered in the area 123 of the abbreviated input data is searched in the calling process of S107 using the radical as a keyword is different from the process described above. Will be described below.

In the second embodiment, radicals of Chinese characters are input in S102 of FIG. 3 and stored in the buffer BUF1. This is, for example, a method of displaying a list of radicals on the display screen and specifying the desired radical from the list with a cursor or an input pen, or entering the radical shape on a tablet and handwriting it. It is performed by a method of recognizing by character recognition processing. Since these methods are known, detailed description is omitted. The entered radical is converted into the corresponding code 201 shown in FIG. 8 and stored in the buffer BUF1. Radical code table 80
0 stores the code 201 and the shape 203 corresponding to each radical type 202 of the kanji used by the processor.

The code 201 shown in FIG. 8 is defined as the strokes of one stroke in the order of 0001-1, 0002-1, ... And the same type but different shape 203, for example, a radical type 202 "person." And "Ninben" are 0009-1,
The attached code is changed like 0009-2.

Next, a method for searching the character string CH registered in the area 123 of the abbreviated input data using the radical as a keyword will be described.

The search process is performed by the process shown in FIG. 7, but the character match determination process in S144 is changed to the radical match determination process. For that purpose, a character radical correspondence dictionary 300 as shown in FIG. 9 is prepared.

The character radical correspondence dictionary 300 of FIG. 9 stores a radical type 302, a radical shape 303, and a code 304 for each character (kanji) 301 used in the word processor. For example, it can be seen from FIG. 9 that the radical of the character "provisional" is "nimben", its shape is "a", and its code is "0009-2".

In S144 of FIG. 7, the address (variable a +
The radical code 304 of the character stored in the variable b)
The radical code 2 which is obtained by referring to the dictionary 300 and is stored at the position pointed to by the variable c in the buffer BUF1
It is determined whether or not 01 matches, and if they match, S147.
If not, the process proceeds to S145. If the character stored in the address (variable a + variable b) is not a kanji character, the process proceeds to S145.

By changing the processing as described above, it is configured to include the radicals with the radicals as keywords using the flowcharts shown in FIGS. 3, 5, 6 and 7. Character string C that contains a character string that
H can be called from area 123. This allows
Even if the character string CH to be called is composed of Chinese characters having a large number of strokes, the character string CH can be easily called by simply inputting the radical corresponding to it.

In the above-described processor that performs a search process using the radicals as keywords, it is required that the user prepares knowledge about radicals of Chinese characters in advance. The user does not need to have such knowledge as long as the radical is displayed correspondingly for each. FIGS. 10A and 10B are diagrams showing a case where the document data is displayed together with the radical in the second embodiment of the present invention.

The improvement of the display of this processor is S in FIG.
117 and S135 in FIG. 6 are performed by changing the document display processing so that the radical can be displayed in an easily understandable manner.

Since the processor whose display is improved has the character radical correspondence dictionary 300 as shown in FIG. 9, for example, the radical shape 3 of the Chinese character "temporary" in the document is used.
It can be seen that 03 is “a”. This radical shape 303
In step S117 of FIG. 5 and step S135 of FIG. 6, the data is processed so as to be displayed in the vicinity of the Chinese character “temporary”, so that each radical of the Chinese character in the document is associated with the Chinese character. Can be displayed.

In FIG. 10 (a), the corresponding radical is displayed below the Chinese character as one form of the display. This display form is not limited to this, and attribute data relating to the display of the part according to the data of the radical shape 303 (for example,
The corresponding kanji may be displayed by changing the color or line type). As a processing method, for example, a logical product of the data of the radical shape 303 and the dot data of the corresponding character is calculated,
The color of the dot that becomes true is changed, or the result data of the logical product of the data of the shape 303 of the knitted radical and the dot data of the corresponding character is displayed. In FIG. 10B, the radical line type is displayed as a dotted line as another display form.

By performing the above display processing, when a character string mixed with Chinese characters is output, the radical is output in association with each Chinese character so that it can be easily determined what the radical of each Chinese character is. As a result, the radical string is input and the character string C including the character string formed by the radical string as a partial character string is input.
When calling H from the area 123, the user can easily know what the radical of the character is (which radical should be input).

Next, a third embodiment will be described. When the processor described above attempts to select a character string having many Chinese characters from the area 123 of the abbreviated input data, the user needs to input the abbreviated character string containing many Chinese characters, which makes the input operation troublesome. This is improved by the processor of the third embodiment as follows.

In this processor, when a character string mixed with kanji is input, the character mixed with kanji is converted into a kana character string, and the corresponding kanji character mixed character string is registered in the area 123 using the kana character string as an entry word. Next, when it is desired to input the same kanji mixed character string, the user inputs a shortened kana character string that is a shortened kana character string after conversion into a certain number of characters from an arbitrary position to issue a call instruction. By doing so, it is possible to call the corresponding character string mixed with Kanji.

For example, when a character string "kanji mixed character string" is input by the handwritten character recognition processing, this is converted into the kana character string "Kanjijimari Mojiretsu",
Both of these are associated with each other and are registered in advance in the area 123, so that the user thereafter inputs a character string “Kanji mixed characters” that is not a Kanji character, for example, by inputting a short kana character string “KA” or “Majiri”. You can call "rows".

Also, after converting only the first character "Kan" of the input "Kanji mixed character string" into one Kana "Ka", this one Kana and "Kanji mixed character string" are associated with each other. If registered in the area 123, the user can call the corresponding "character string mixed with kanji" by inputting "ka" after that.

The processing flow of the processor according to the third embodiment described above is the same as the flow chart shown in FIG. 3 described above, but the registration processing of S105 and the calling processing of S107 are performed according to the flow chart shown below.

FIG. 11 is a diagram showing the format of the area 123 of the shortened input data in the processor according to the third embodiment. In the area 123 of the abbreviated input data, the number of kana headwords for each registered character string is 40
1, the number of characters 402 of the character string to be registered, the kana headword 403 of the character string to be registered, the character string 404 to be registered, and the number of times 405 the character string has been used are stored.

Since these data are stored side by side in the order in which the character string 404 was registered, the data registered at the beginning of the area 123 is the most recently registered data. An "end code" indicating the end of the data is stored at the position next to the last data.

For each character string registered in the area 123, the kana headword word number 401, the registered character string character number 402 and the number of times of use 405 are respectively stored in the area for one address as shown in the figure, and the kana headword word 403.
The registered character string 404 and the registered character string 404 are stored in areas for N1 address and M address, respectively.

Since the kana headword 403 is stored in the area for N1 addresses, the kana headword word number 401 has a value of N1, and the registered character string 404 is stored for M addresses, so the registered character string character number 402 is The value is M.

12 and 13, the character string is divided for each clause in the third embodiment, and the area 1 of the shortened input data is shown.
It is a figure which shows the state registered into 23.

FIG. 14 is a flowchart of the registration processing according to the third embodiment of the present invention, which corresponds to S105 of FIG. Since the flowchart of FIG. 14 is substantially the same as the flowchart shown in FIG. 5, only the processing part different from the flowchart of FIG. 5 will be described here. Further, in the flowchart of FIG. 14, n from the beginning of the buffer BUF1
Only the characters (the number of characters of the value of the variable n) are processed.

In step S201, when obtaining kana headwords from the kanji-blended character string stored in the buffer BUF1, the number of kana headwords is calculated, and the number is substituted into the variable m1. For example, since the character string “character” has two readings “Moji” and “Monji”, 2 is assigned to the variable m1.

In step S202, the kanji-blended character string stored in the buffer BUF1 is converted into a kana headword (if there are a plurality of characters (m1> 1), the m1th kana headword) and stored in the buffer BUF3. The details of the method for obtaining a kana headword from a character string mixed with kanji will be described later.

In S203, it is judged whether or not a kanji-blended character string has already been registered in the abbreviated input data area 123 using the kana character string stored in the buffer BUF3 as an entry word. If registered, the process proceeds to S204. If not, the process proceeds to S205.

S204 to S206 are S112 to S in FIG.
The description is omitted because it is similar to 114.

In S207, as shown in FIG. 12, the number of characters of the kana headword in the buffer BUF3, the number of characters in the buffer BUF1, the contents of the buffer BUF3, the contents of the buffer BUF1 and the use The number of times (= 1) is 40 kana headword words
1, the registered character string character number 402, the kana headword 403, the registered character string 404, and the number of times of use 405 are additionally registered at the beginning of the area 123. At this time, the data already registered in the area 123 is sequentially moved backward.

At S208, the variable m1 is decremented by 1, and S
At 209, it is judged whether or not the variable m1 after the subtraction becomes 0. If it is 0, the process proceeds to S210, and if it is not 0, the process proceeds to S202, and similarly, the process is performed on the next kana headword.

S210 to S211 are S116 to S in FIG.
The description is omitted because it is similar to 117.

Here, a method for obtaining a kana headword from the kanji-blended character string in S201 and S202 will be described. Here, a method 1 obtained by a conventional kanji-kana conversion process and a method 2 obtained by a simple method will be described.

First, the method 1 will be described. Method 1 is a method in which a character string mixed with kanji is converted into a kana character string by a conventional kanji kana conversion technique and used as a kana headword. Many methods have been proposed for converting a character string mixed with kanji into a kana character string. For example, JP-B-6-77252, JP-A-4-88550, and JP-A-4-116.
The techniques disclosed in Japanese Patent Laid-Open No. 763 and Japanese Patent Laid-Open No. 5-128105 disclose a procedure for converting a kanji character string into a kana character string. Therefore, using these methods, the kanji mixed character string in the buffer BUF1 can be converted. It can be converted into a kana character string. A process for converting a character string mixed with kanji into a kana character string by these methods will be briefly described.

FIG. 15 is a diagram showing the construction of a kanji / kana conversion dictionary 500 required for converting a kanji mixed character string into a kana character string, which is applied to the conventional and third embodiments of the present invention. In this dictionary 500, the reading 502 and the part-of-speech 503 of each of a plurality of Chinese characters 501 are stored in association with each other.

Buffer BUF using this dictionary 500
In order to convert a character string of 1 mixed with Kanji, for example, "Kana or" into Kana, it is first judged whether or not the first character of the buffer BUF1 is a Kanji. In this example, since "kana" is a kanji character, the position where the character "kana" is stored is searched from the dictionary 500, and then it is determined whether or not the second character of the buffer BUF1 is a kanji character. In this example, the second character is "Kana", which is "name", so it is determined whether the word "Kana" connecting "Kana" to the first character is in the searched "Kana" position in the dictionary 500. To be done.

Since the dictionary 500 has the word "kana", it is next determined whether or not the third character of the buffer BUF1 is a kanji character. In this example, since the third character is “A” and is not a kanji character, the part of speech 503 of the previously found word “kana” is read from the dictionary 500. In this example, since the read part-of-speech 503 is a noun, it is determined that it is one word in "kana", the dictionary 500 is referred to, this is converted into a kana character string "kana", and the kana is stored in the buffer BUF3. Since all the characters after "a" in the third character of the buffer BUF1 are hiragana, these hiragana are kept as they are in the buffer BUF.
3 is additionally stored and the process ends. Note that there is only one kana reading 502 for "kana", so
1 is substituted into the variable m1.

Since "Kana or" is stored in the buffer BUF3 by the above processing, S203 of FIG.
As a result of the processing in steps S209 to S209, as shown in FIG. 12, "Kana or" is used as a kana headword 403 and the kanji mixed character string "Kana or" 404 is the region 1 of the shortened input data.
23 is registered.

Next, the method 2 will be described. The method 1 described above converts a kanji mixed character string into an accurate kana character string, but the following method 2 speeds up processing and saves storage capacity. Character only 1
It is converted into a kana of characters and is used as a kana headword. In addition, when there is a plurality of readings of one character at the beginning, all the typical readings are set as kana headwords.

FIG. 16 is a Kanji / Kana conversion dictionary 600 for performing Kanji / Kana conversion applied to the third embodiment of the present invention.
It is a figure which shows the structure of.

This dictionary 600 has a typical reading 602 for each Chinese character 601 used in the processor.
The first one character of is stored. For example, the kanji 601 has the readings of “kana” for “kari”, “ka”, and “ke”, but all of them are used relatively often, so “ka” and “ke”
Is read and stored as 602. "Sentence" as Kanji 601
There are readings such as “bu”, “mo”, “mon” and “fumi”, but “bu” and “mo” which are relatively frequently used among them are stored as a reading 602. It should be noted that all readings may be stored if there is enough storage capacity.

Buffer BUF using this dictionary 600
In order to obtain a kana headword from a character string mixed with 1 kanji, for example, "kana or", the following processing is performed according to the flowchart of FIG.

First, in S201, it is determined whether or not the first character of the character string in the buffer BUF1 is a Kanji character. In this example, since "kana" is a kanji, when searching the position where the kanji 601 "kana" is stored in the dictionary 600, "ka"
Since two readings 602 of "and" are obtained, the variable m1
2 is assigned to.

In S202, "ke" (the second reading 602 because the variable m1 is 2) of the two readings 602 previously obtained is stored in the buffer BUF3. When the first character of the character string of the buffer BUF1 is a kana character, 1 is assigned to the variable m1 and the kana character is stored in the buffer BUF3.

After that, after the processes of S203 to S209 are performed, the variable m1 becomes 1 and the process returns to S202.
Next, "ka" is stored in the buffer BUF3, and S2 is again stored.
The processing from 03 to S209 is performed.

As a result of the above processing, as shown in FIG. 13, "ka" and "ke" are registered as kana headwords 406 and the kanji mixed character string "kana or" is registered in the shortened input data area 123 as the registered character string 404. To be done.

Note that, in FIG. 13, the headword 406 "ke".
The same character string 404, “Kana or”, is registered in association with each of “and” and “ka”.
Character string 40 "Kana or" in place of registration 4
If the processing for registering the pointer for 4 is performed, it is possible to suppress the consumption of the storage capacity of the area 123.

As described above, in the method 2, as compared with the method 1, the storage capacity for the kanji-kana conversion dictionary can be saved as shown in FIG. 16, and the processing can be speeded up.

Next, the calling process (corresponding to S107 in FIG. 3) by the processor of the third embodiment will be described. The calling process is performed according to the flowchart of FIG. However, the search processing in S124 of FIG.
If the content of 1 is a character string mixed with Kanji, the process is performed according to the flowchart shown in FIG.
When the content of 1 is a kana character string, the process is performed according to the flowchart shown in FIG.

FIG. 17 is a flow chart of search processing according to the third embodiment of the present invention. Since this flowchart is almost the same as the flowchart shown in FIG. 7, only the parts different from the processing in FIG. 7 will be described.

S221 to S223 of FIG. 17 are S1 of FIG.
41 to S143. In S224 of FIG. 17, the address of the area 123 of the shortened input data (variable a + variable b
It is determined whether or not the character stored in +1) and the character pointed to by the variable c in the buffer BUF1 match. If they match, the process proceeds to S227, and if they do not match, the process proceeds to S225.

The processing of S225 to S229 is S14 of FIG.
The same as 5 to S149. In S230, the address (the value stored in the position where the variable a + the variable a points + 2)
From, the number of characters corresponding to the value stored in the address (variable a + 1) is stored in the buffer BUF2.

In step S231, the address is assigned to the variable a (variable a).
And the value of the address (variable a + 1) and 2 are added. As a result, the variable a can point to the data regarding the next character string 404 registered in the area 123.

The processing of S232 to S235 is S15 of FIG.
2 to S155. By performing the registration processing and the calling processing as described above with the flowchart shown in FIG. 3, if a character string mixed with Chinese characters and a kana reading obtained by converting the character string are registered in advance, then kana By inputting a part of the reading, the corresponding kanji mixed character string can be called. Further, since the above-mentioned conversion may be performed only by reading and registering the reading of the first character of the mixed Kanji character string, it is possible to speed up the process and suppress the consumption of the area 123.

Next, a fourth embodiment will be described. In the third embodiment described above, a character string mixed with kanji is input, converted into a kana character string, and both are registered in association with each other, whereas in the fourth embodiment, a kana character string is input. Then, it is converted into Kana-Kanji and both are registered in association with each other.

For example, in the processor of the fourth embodiment, when the kana character string "Mojishorisuchi" is input from the keyboard 108 or the like, and this is converted into kana-kanji characters to obtain the kanji mixed character string "character processing device". , Both of these character strings are associated with each other and registered in the area 123. This allows you to call the corresponding kanji mixed character string "character processing device" by entering the abbreviated kana character string "mo" or "shuri", and also shorten the character string "statement" or "processing". By also inputting, it is possible to call the corresponding character string "character processing device" containing mixed kanji.

FIG. 18 is a flowchart of the registration / calling process according to the fourth embodiment of the present invention. The fourth embodiment will be described with reference to this flowchart.

In S401, the buffers BUF1 and BUF
After F3 is initialized, a kana character string is input from the keyboard 108 or the like in S402 and stored in the buffer BUF3. In S403, it is determined whether or not a call instruction for abbreviated input is issued from the keyboard 108 or the like. If a call instruction is issued, the process proceeds to S404, and if not, S4.
Move to 07. The calling instruction may be provided with a dedicated key or may be shared with the kana-kanji conversion instruction key.

The contents of the buffer BUF3 are copied to the buffer BUF1 in S404, and the buffer BUF is copied in S405.
After the number of characters of the character string in F1 is assigned to the variable n1, S
A character string calling process is performed in 406, and the process proceeds to S401. The calling process of S406 is performed according to the flowchart shown in FIG. However, the search processing of S124 of FIG. 6 is performed according to the flowchart of FIG.

On the other hand, in step S407, the kana character string in the buffer BUF3 is converted into a kanji mixed character string and stored in the buffer BUF1. Note that the kana-kanji conversion technology is a known technology and will not be described.

After the number of characters of the character string in the buffer BUF1 is substituted into the variable n1 in S408, it is determined in S409 whether or not the abbreviated input call instruction is issued from the keyboard 108 or the like, and if so, to S410. If not, the process proceeds to S411.

After the character string calling process is performed in S410, the process proceeds to S401. The calling process of S410 is performed according to the flowchart shown in FIG. However, the search processing of S124 of FIG. 6 is performed according to the flowchart of FIG.

On the other hand, in step S411, it is determined whether or not a candidate for kana-kanji conversion has been decided.
If not, the process proceeds to step S407.

At S412, 1 is assigned to the variable mi,
After the character string registration process is performed in S413, the process proceeds to S
Move to 401. The registration process of S413 is shown in FIG.
The processing is performed according to the flow charts of S203 and subsequent steps, or according to the flow chart of FIG.

By the above processing, when the kana character string is converted into the kanji mixed character string by the kana kanji conversion processing,
The kanji mixed character string can be registered in the area 123, and then the character (kanji or the like) included in the kanji mixed character string can be designated to call the kanji mixed character string.

Thus, when calling a kanji-blended character string input by the kana-kanji conversion processing, even if a plurality of kanji-blended character strings are registered corresponding to the same abbreviated kana character, it is easy to obtain the object. You can specify a character string.

Next, the fifth embodiment will be described. In the above-described embodiment, the user inputs the area 123 of the abbreviated input data.
Although the unit of the character string to be registered in advance was consciously given, for example, to be a phrase unit, and the registration instruction was made each time, the processor according to the fifth embodiment continuously inputs to the buffer BUF1. The character string is automatically divided for each phrase and then registered in the area 123 for each character string of the phrase. For example, when the character string "register a character string mixed with kanji in the storage means" is input to the buffer BUF1, the processor "mixes kanji characters", "character string", "in storage means", and "registers". Divided into four,
Each is registered in the area 123.

FIG. 19 is a flowchart of the automatic character string division registration processing according to the fifth embodiment of the present invention. This flow chart corresponds to the flow chart shown in FIG. According to this flowchart, when a character string is input from the keyboard 108 or the like, the character string is automatically divided at appropriate positions, and each divided character string is registered in the shortened input data area 123. When a character string is input and a calling instruction is issued, a character string calling process is performed.

In this embodiment, the character string is divided with reference to punctuation marks / symbols, connection positions from hiragana to katakana or kanji, connection positions from hiragana or katakana to alphanumeric characters, and the like. The details of the process will be described below with reference to FIG.

At S301, 0 is substituted into the variable n2.
An area necessary for storing the value of the variable is secured in the variable data area 122 of the RAM 102. In S302, the character input buffer BUF1 is initialized. The storage area relating to the buffer is also the variable data area 122 of the RAM 102.
Secured in. The range initialized here is the area from the (n2 + 1) th to the last character of the buffer BUF1.

In S303, 1 is added to the value of the variable n2, and in S304, one character is input and the buffer BU
It is stored in the n2th position of F1. In addition, as the character input here, the keyboard 108, the tablet 107,
It is performed by input from the FD 109 or the like.

In S305, for example, the keyboard 108
It is determined whether or not a call instruction has been issued from the tablet 107 or the tablet 107. If so, the process proceeds to S306 to perform the call process and then returns to S301. If not, the process proceeds to S307. The calling process of S306 is the same as S107 of FIG. 3, and is performed according to the flowchart shown in FIG. If no calling instruction is given, it is determined in S307 whether the character at the n2th position in the buffer BUF1 is a punctuation mark or a symbol, and if so, the process proceeds to S3.
08, otherwise, to S311.

In S308, it is determined whether or not the value of the variable n2 is larger than 1. If it is larger, the process proceeds to S309, and if not, the process proceeds to S310. In step S309, the first character in the buffer BUF1 is set to the document data area 121.
Is copied, and the process proceeds to S301. This is the process when only one punctuation mark or one symbol is stored in the buffer BUF1.

In S310, a character string registration process is performed, and the process proceeds to S301. Note that the registration process of S310 is the same as that of S105 of FIG.
It is performed according to the flowchart shown in FIG.

On the other hand, in S311, it is determined whether or not the variable n2 is larger than 1, and if it is larger, the routine proceeds to S312, and if not, the routine proceeds to S303 and the same processing is performed for the next input character. In S312, it is determined whether or not the n2th character in the buffer BUF1 is a Chinese character, and if it is a Chinese character, the process proceeds to S313, and if not, the process proceeds to S318. In S313, (n2- of the buffer BUF1 is
It is determined whether the 1) th character is hiragana or katakana, and if so, the process proceeds to S314; otherwise, the process proceeds to S303.

At S314, 1 is subtracted from the variable n2, and then at S315, a character string is registered. Note that S
The registration process of 315 is the same as S105 of FIG.
Alternatively, the process is performed according to the flowchart shown in FIG.

In S316, since the registration process of the character string consisting of the first to n2th characters in the buffer BUF1 has already been completed, the (n2 + 1) th character in the buffer BUF1 is copied to the first character in the buffer BUF1 and, accordingly, is copied. S
In 317, 1 is assigned to the variable n2, the process proceeds to S302, and the character string to be input next is divided.

On the other hand, in S318 and S319, the n2th character of the buffer BUF1 is a katakana, and n2-
It is determined whether the first character is a hiragana, and S
In 320 and S321, it is determined whether the n2-th character of the buffer BUF1 is an alphabetic character or a numeric character, and the n2-1-th character is a hiragana or katakana, and if so, the process proceeds to S314. Otherwise S30
Then, the process proceeds to 3 and the process is repeated.

With the above processing, the character string continuously input to the buffer BUF1 is automatically divided into clauses on the processor side, and the character string is registered in the area 123 for each of the divided clauses. be able to. This saves the user the trouble of inputting the character string while being aware of the registration unit in the area 123. Further, since the number of registered character strings is automatically increased only by continuously inputting the character strings, the number of callable character strings is increased and the input efficiency is improved.

Since the above-mentioned character string division is not performed using a special dictionary or the like, it is possible to simplify the processing, improve the processing speed, and reduce the storage capacity by eliminating the dictionary. Become.

[0165]

According to the character string processing apparatus of the first aspect, the calling means uses the first searching means to set the character string input from the input means from the character string group in the storage means as a partial character string in the middle of the character string. Since the included character string is searched and output, there is an effect that a partial character string included after the middle of the registered character string can be designated and the character string can be called.

With this effect, even if there are a plurality of character strings having the same leading partial character string in the registered character string group, they can be called separately.
It is also possible to obtain the effect that the desired character string can be selected only by one operation.

Further, when a desired character string is called from the storage means, when the specified character string is specified, for example, when it is troublesome to input the specified character string due to a large number of strokes, it is desired to call it. Since it is possible to input and specify a partial character string that is easy to input after the middle of the character string, there is an effect that the character string can be easily called.

In the character string processing device according to claim 2, since the registration means of the device according to claim 1 registers the character string output by the calling means in the character string group of the storage means, the character string of the user. A new character string can be additionally registered in the character string group without an input operation, and the character string registration efficiency is improved.

In the character string processing device according to claim 3, in the device according to claim 1 or 2, the calling means further uses the second search means to input a radical from the character string group of the storage means by the input means. Since a character string containing a kanji string corresponding to is searched and output, specify a radical and call a character string containing a kanji string consisting of that radical from the registered character string group. The effect is that you can.

With this effect, even if the character string to be called is composed of many Kanji characters or Kanji characters with a large number of strokes, the corresponding character string can be easily called only by entering the radical. You can also get the effect.

In the character string processing device according to claim 4, in the device according to any one of claims 1 to 3, the calling means has the third searching means, and the input means selects from the registered character string group. A character string including the input character string can be searched for and called from a character string starting from a predetermined position (position where the input character string exists). This has the effect that only a certain range of the registered character string can be easily called.

In the character string processing device according to claim 5, when a character string mixed with kanji kana is registered in the device according to any one of claims 1 to 4, the character string mixed with kanji kana is converted by the kana conversion means of the input means. By converting to a kana character string and registering the converted kana character string and the original kanji / kana mixed character string in the character string group of the registration means in association with each other, all or all of the kana character strings can be called by the calling means. You can call the corresponding mixed Kanji character string by just entering a part.

As a result, there is an effect that a character string mixed with kanji and kana directly input by handwritten character recognition or the like can be easily called by only inputting a part of the reading.

In the character string processing device according to claim 6, in the device according to any one of claims 1 to 5, the input means uses the kanji conversion means to convert the kana character string to a kanji kana mixed character string, By registering the mixed kanji kana character string in the character string group of the storage means in association with the original kana character string, the calling means converts the kanji character string into a partial character string based on the input kanji character string. A character string containing kanji and kana can be called from the character string group of the storage means.

As a result, even when a plurality of kanji-kana mixed character strings including a certain kana character string as a partial character string are registered, it is possible to easily specify the kanji character string by substituting for the partial kana character string. The effect is that a character string can be called.

In the character string processing apparatus according to claim 7, in the apparatus according to any one of claims 1 to 6, the character string division registration means of the registration means automatically determines the character string input from the input means. While dividing into unit character strings,
There is an effect that each divided character string can be registered in the storage means.

With this effect, the number of registered character strings is automatically increased by simply inputting a character string in the registration mode.
The burden on the user in registration is reduced, and the efficiency of character string registration is improved.

[Brief description of drawings]

FIG. 1 is a block diagram of a Japanese word processor according to first to fifth embodiments of the present invention.

2A and 2B are diagrams showing data structures of a RAM 102 and a ROM 103 of FIG.

FIG. 3 is a schematic flowchart for generating document data using an input character string or a registered character string in the Japanese word processor according to the first embodiment of the present invention.

FIG. 4 is a format diagram of an abbreviated input data area 123 according to the first embodiment of the present invention.

5 is a flowchart of a registration process according to the first embodiment of S105 of FIG.

6 is a flowchart of a calling process according to the first embodiment of S107 of FIG.

7 is a flowchart of a search process according to the first embodiment of S124 of FIG.

FIG. 8 is a diagram showing a radical code table 200 applied to a second embodiment of the present invention.

FIG. 9 is a diagram showing a character radical correspondence dictionary 300 applied to a second embodiment of the present invention.

10A and 10B are diagrams showing an example in which document data is displayed together with a radical in the second embodiment of the present invention.

FIG. 11 is a diagram showing a format of a region 123 of shortened input data according to a third embodiment of the present invention.

FIG. 12 is a diagram showing a state in which a character string is divided for each phrase and registered in the third embodiment of the present invention.

FIG. 13 is a diagram showing a state in which a character string is divided for each clause and registered in the third embodiment of the present invention.

FIG. 14 is a flowchart of a registration process according to the third embodiment of the present invention.

FIG. 15 is a diagram showing a configuration of a kanji-kana conversion dictionary required for converting a kanji-mixed character string into a kana character string, which is applied to the related art and the third embodiment of the present invention.

FIG. 16 is a diagram showing a configuration of a Kanji / Kana conversion dictionary for performing Kanji / Kana conversion applied to the third embodiment of the present invention.

FIG. 17 is a flowchart of search processing according to the third embodiment of the present invention.

FIG. 18 is a flowchart of registration / calling processing according to the fourth embodiment of the present invention.

FIG. 19 is a flowchart of automatic character string division registration processing according to the fifth embodiment of the present invention.

20A to 20C are diagrams illustrating a conventional method of storing a registered character string.

[Explanation of symbols]

 101 CPU 102 RAM 103 ROM 106 Pen 107 Tablet 108 Keyboard 121 Document data area 123 Short input data area 300 Character radical correspondence dictionary In the drawings, the same reference numerals indicate the same or corresponding parts.

Claims (7)

[Claims] 1. A storage unit for registering data including a character string group, an input unit for inputting information including a character string, and a character string registered in the character string group of the storage unit in a registration mode. And a calling means for searching a character string group in the storage means based on the information input from the input means and outputting a character string in the calling mode, the calling means further comprising: A character string processing device, comprising: first searching means for searching a character string including the character string input from the input means as a partial character string in the middle of the character string group in the storage means. 2. The character string processing device according to claim 1, wherein the registration means further comprises means for registering the character string output by the calling means in the character string group of the storage means. 3. The radical information is further included in the information inputted by the input means, and the data registered in the storage means further corresponds to each radical of a plurality of Chinese characters. The stored kanji radical correspondence table is included, and the calling means further specifies a kanji string corresponding to the radical inputted from the input means from the kanji radical correspondence table, and stores the kanji radical in the storage means. The character string processing device according to claim 1, further comprising a second searching unit that searches the character string group for a character string including the specified Chinese character string. 4. The calling means further searches a character string including the character string input by the input means in the character string group of the storage means for a character string subsequent to the input character string. Including 3 search means,
The character string processing device according to claim 1. 5. The input means further includes kana conversion means for inputting a character string mixed with kanji kana and converting it into a kana character string, and the registration means further includes the kanji kana mixed character input by the input means. The call means further includes means for registering the column and the kana character string by the kana conversion means of the input kanji kana mixed character string in the character string group of the storage means in association with each other. A means for searching the character string group of the storage means based on the kana character string that is generated, and outputting the kanji kana mixed character string corresponding to the kana character string that includes the input kana character string in the partial character string. , Claims 1 to 4
The character string processing device according to any one of 1. 6. The input means further includes kanji conversion means for inputting a kana character string and converting it into a kanji kana mixed character string, and the registration means further includes the kana character string input by the input means. The input unit further includes a unit for registering the input Kana character string in the character string group of the storage unit in association with the Kanji / Kana mixed character string by the Kanji conversion unit, and the calling unit is further input by the input unit. 3. A means for searching the character string group of the storage means based on a kanji character string, and outputting the kana character string corresponding to a kanji kana mixed character string including the input kanji character string as a partial character string. 6. The character string device according to any one of 5 to 5. 7. The registration means further includes character string division registration means for dividing the character string input from the input means into character strings of a predetermined unit and registering the character string in the character string group of the storage means. Item 7. A character string processing device according to any one of items 1 to 6.