JPH0236019B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION <Technical Field> The present invention relates to a text processing device that converts kana characters or sentences into corresponding kanji or sentences mixed with kanji according to a kana-kanji conversion dictionary and edits the text into a predetermined format.

<Prior art> Generally, in a text processing device, relatively frequently used stylized texts are registered in an external memory device such as a floppy disk, and when necessary, a desired text can be retrieved from among the registered texts. It is taken out and guided to an output device for display or recording.

In this case, the text to be registered is registered in the external memory device with a keyword name (registered name) attached, so the keyword name of the desired text is entered from the keyboard device, and the keyword name matches the entered keyword name. The keyword name to be searched is searched from among the registered keyword names, and the corresponding sentence is retrieved.

For this reason, when an operator retrieves a desired registered text, he or she always needs the keyword name of the text. However, although it is possible to remember keyword names to some extent when the number of registered sentences is small, it becomes difficult to remember keyword names when the number of registered sentences increases.

Therefore, it has been proposed to display a list in which only the keyword names of sentences registered on the floppy disk are displayed in advance, and to select a registered sentence by looking at this displayed list and specifying the desired keyword name. has been done. (For example, Japanese Patent Application Laid-open No. 56-99569) Conventionally, when displaying keyword names in a list, they are simply listed in the order of registration. It took time to search for keyword names.

Furthermore, fixed disks have recently been used as memories for registering texts, and these fixed disks have a memory capacity several tens of times larger than that of floppy disks, and the number of texts that can be registered there increases. For this reason, as described above, simply displaying a list makes it increasingly difficult to search for a target keyword name, which poses a problem in that the burden on the user in document management becomes extremely heavy.

<Purpose> An object of the present invention is to provide a text processing device that is devised so that the target keyword name can be easily searched when displaying a list of keyword names of registered texts, thereby reducing the burden on the user in text management. It is something.

In particular, in the present invention, for the keyword name assigned when registering a text, when the keyword name inputted in kana is converted into kana-kanji, a kana headword of this keyword name is added and registered together. , based on the headword, for example, keyword names are displayed in a list in alphabetical order so that keyword names can be easily searched.

<Embodiment> FIG. 1 is a block diagram showing the configuration of the text processing device of the present invention, in which 1 is a keyboard device provided with a kana key and various control keys, and 2 is a keyboard device provided with a kana key and various control keys; 3 is a control memory configuring various buffers, etc.; 4 is a kana-kanji conversion device that converts a kana sentence inputted from the keyboard device 1 into a corresponding kanji-mixed sentence and outputs it; 5 is a fixed memory (magnetic disk) in which a large number of created sentences are registered together with registered names; 6 is a printer; and 7 is a CRT display device.

The control memory 3 described above includes a kana buffer for storing a kana character string inputted from the keyboard device 1, a result buffer for temporarily storing a converted sentence obtained by converting the inputted kana character string by the kana-kanji conversion device 4, and the aforementioned control memory 3. It is equipped with a sentence buffer for sequentially storing converted sentences determined by conversion, and a headword buffer for creating kana headwords for registered names.

Further, as shown in FIG. 2, the fixed memory 6 has a keyword name (registered name) table 10, a keyword name search table (registered name search table) 11, and a keyword name headword table 12 as indexes for each registered sentence. The text registration area 20 is provided.

The keyword name table 10 includes, for each registered sentence, a keyword name area 31 consisting of a sentence mixed with kanji, alphanumeric characters, or other character strings or symbol strings;
Note data area 3 for text creator code, date, etc.
2, and an address pointer area 33 for indicating the address position of the text registration area 20 corresponding to this keyword name.
When the address pointer area 3 is selected,
According to the address information No. 3, the corresponding registered text in the text registration area 20 is transferred to the text buffer and the display memory of the CRT display device 7.

The keyword name search table 11 is used to search for a corresponding registered text from a keyword name, and includes a character code area 35 for storing the character code for the first character of the keyword name for each keyword name, and a character code area 35 for storing the character code for the first character of the keyword name. table 1
0, and an address pointer 36 that stores address information of the corresponding keyword name. Also, the character code of the character code area 35 is
The JIS C6226 character code is classified by point code and the character codes are arranged in this point code order.

The headword table 12 includes, for each keyword name, a character area 38 that stores a predetermined number (headwords) from the beginning of the kana character string input when entering this keyword name, and a keyword corresponding to this headword. It consists of an address pointer 39 that stores address information in the name table 10.
The headwords input into the character area 38 are arranged in the order of JIS C6226 codes from the beginning.

Next, the operation of the text processing device will be explained in detail with reference to the flowchart shown in FIG.

First, when creating a normal sentence, text information is input using the kana keys on the keyboard device 1, and the input kana character string is converted into a sentence with kanji mixed in by the kana-kanji converter 4, and the converted kanji Mixed sentences are stored sequentially in the sentence buffer.

When the creation of a predetermined sentence is completed by the above input operation, this sentence data is registered in the fixed memory 6.

In this text registration, as shown in FIG. 3A, a keyword name is first inputted using the kana keys of the keyboard device 1, and an instruction to convert kana to kanji is given.

Then, the kana character string is sent from the kana buffer to the kana-kanji conversion device 4 for conversion processing, and as a result, the keyword name mixed with kanji is temporarily stored in the buffer.

Further, for the kana character string of the keyword name in the kana buffer, the first n characters (4 characters in the embodiment) of the kana characters are transferred to the headword buffer.

In addition to the keyword name, creation and person-in-charge data are also input.

After that, when a registration instruction is issued from the keyboard device 1, the first character of the keyword name mixed with kanji characters held in the result buffer is transferred to the keyword name search table 11 and stored in the character code area 35, and is also stored in the address pointer. 36, the address information in the text area 20 of the registered text is transferred and stored.

In this case, as mentioned above, character code area 3
5, the data are stored sequentially in each JIS C6226 point code.

Subsequently, the keyword name, date, and person in charge information of the result buffer are transferred to the keyword name table 10, and the keyword name in the sentence mixed with kanji is stored in the keyword name area 31, and the date and person in charge information are stored in the notes data area 32. Further, the address information in the text area 20 of the registered text is transferred to the address pointer area 33.

Further, the kana character string of the keyword name held in the headword buffer is read out and transferred to the headword table 12 and stored in the character area 38, and the address information in the text area 20 of the registered sentence is stored in the address pointer 39. is memorized.

This headword table 12 is used to determine the arrangement order of the keyword name list, and as mentioned above, the kana character strings in the character area 38 are
It is arranged in the code order of C6226, and is arranged in alphabetical order like a general Japanese dictionary.

The headword table 12 is provided because, for example, if keyword names are converted into sentences containing kanji and then arranged in on-yomi or kun-yomi order, it is difficult to determine how the kanji were read and input. Therefore, a headword table 12 for kana character strings is provided to facilitate alphabetical arrangement.

After the text is registered as described above, the registered text is called up as shown in FIG. 3B.

First, if the operator knows the keyword name (registered name), he or she inputs the keyword name from the keyboard device 1 to search for registered sentences. This compares the first character of the entered keyword name with the data in keyword name search table 11, selects a matching location, and then selects the matching location.
Search for a complete match with the character code string of the keyword name stored in 0. When a match is detected in this search, the corresponding registered text in the text registration area 20 is retrieved from the address information provided corresponding to the keyword name in the matched keyword name table 10, and stored in the text buffer and the display memory of the CRT display device. be transferred.

Next, if the operator forgets the keyword name and wants to call up the desired registered text, he issues a list call instruction as shown in FIG. 3C.

Based on this list call instruction, the first location of the headword table 12 is designated, the corresponding keyword name of the keyword name table 10 is selected from the address information of this first location, and the keyword names are sequentially transferred to the display memory.

Since the headword table 12 is arranged in the code order of JIS C6226, that is, arranged in alphabetical order, by referring to the headword table 12 and selecting and displaying the keyword name in the keyword name table 10, the CRT A list is displayed in alphabetical order on the display device.

Therefore, when searching for the desired keyword name from the list display, since the list is arranged in alphabetical order, the desired keyword name can be easily searched.

In the above embodiment, an example of the keyword name is a sentence containing kanji, but the keyword name may be an alphanumeric string or a numeric string.

<Effects> The text processing device of the present invention includes a keyword name table means in which keyword names (registered names) are registered, and a text registration memory means in which texts are registered in association with each keyword name of the means. , a kana headword table in which kana headwords for each keyword name of the keyword name table means are registered, and the keywords of the keyword name table means are arranged according to the ranking of the kana headwords registered in the kana headword table. By sequentially reading names and displaying them in a list, for example, by arranging the kana headword table in alphabetical order, keyword names can be displayed in alphabetical order, making it easier to search for keyword names. It is possible to provide a text processing device that can reduce the burden on users in management.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of the device of the present invention;
Figure 2 is a diagram showing the structure of the memory in which text is registered.
Figures 3A, 3B and 3C are flowcharts showing the operation of the device. 1: keyboard device, 2: editing control section, 3: control memory, 4: kana-kanji conversion device, 5: fixed memory, 6: printer, 7: CRT display device.

Claims (1)

[Claims] 1. In a text processing device that converts kana characters or kana sentences into corresponding kanji or kanji-mixed sentences using a kana-kanji conversion means and edits the text in a predetermined format, a keyword name (registered name) is registered. text registration memory means in which sentences are registered in association with each keyword name of said means; and kana headwords in which kana headwords corresponding to each keyword name in said keyword name table means are registered. registering the keyword name in the keyword name table means in the form of kanji or a sentence mixed with kanji by the kana-kanji conversion means, and registering a predetermined number of kana characters from the beginning of the kana character string input to the kana-kanji conversion means; is registered as the kana headword in the kana headword table means, and the keyword names in the keyword name table means are sequentially read out in accordance with the ranking of the kana headwords registered in the kana headword table. A text processing device characterized by: