JPS60176169A - Sentence processor - Google Patents

Abstract

PURPOSE:To facilitate retrieval of a keyword name and to lighten the burden imposed on a user by providing a header table, by reading sequentially keyword names in accordance with the order of registration and by displaying them in a list. CONSTITUTION:A header table 12 in a fixed memory 5 is utilized for deciding the array priority of a keyword name list, and KANA (Japanese syllabary) strings in a character area 38 are arrayed in an alphabetical order. When a registered sentence is called after sentence data is registered in the memory 5 in terms of sentence generation, an operator conducts list calling specification if the operator forgets a keyword name. With this specification, the head location of the header table 12 is specified, and a keyword name corresponding to a keyword name table 10 is selected from address information in the head address and transferred to display memory in sequence. In this case keyword names in the table 12 are arrayed in an alphabetical order; therefore the object keyword name can be easily retrieved and the burden imposed on users in terms of sentence maintenance can be lightened.

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 compiles the texts into a predetermined format.

<Prior art> Generally, in a text processing Ej1 device, relatively frequently used stylized texts are registered in an external memory device such as a floppy disk, and when necessary, a desired text from among the registered texts can be retrieved. It is taken out and led 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 salt (registered name) attached, so the keyword salt of the desired sentence is entered from the keyboard device, and the keyword salt that matches the entered keyword salt is entered. The keyword is searched from among the registered keywords, and the corresponding sentence is retrieved.

For this reason, when an operator retrieves a desired registered text, he or she always needs the keyword salt of that text. However, if the number of registered sentences is small, to some extent,
Although it is possible to remember keywords, it becomes impossible to remember keywords as the number of registered sentences increases.

Therefore, a list is displayed in which only the keywords of the sentences registered on the floppy disk are displayed in advance, and registered sentences are selected by looking at this displayed list and specifying the desired keyword. is proposed. (For example, Japanese Patent Application Laid-Open No. 5'6-9'9569) When displaying a list of keywords, conventionally they were simply listed in the order of registration, so the list was divided into several pages and displayed on the display screen. In some cases, it took time to search for the desired keyword salt.

Furthermore, fixed disks have recently been used as memories for registering sentences, and these fixed disks have a memory capacity several tens of times larger than that of floppy disks, and the number of sentences that can be registered there increases.

For this reason, it becomes increasingly difficult to search for the desired keyword simply by displaying the list as described above.
There was a problem in that the burden on the user in document management became extremely large.

<Objective> An object of the present invention is to provide a text processing device that can easily search for a desired keyword when displaying a list of keywords of registered texts, thereby reducing the user's burden in text management. It is something.

In particular, in the present invention, regarding the keyword salt assigned when registering a text, when the keyword salt that has been manually inputted into kana is converted into kana-kanji, the kana headword of this keyword salt can be asked and registered together. Based on the headword, for example, keywords are displayed in a list in alphabetical order, so that keyword searches can be easily performed.

<Embodiment> Fig. 1 is a block diagram showing the configuration of the text processing device of the present invention, and ■ is a block diagram in which a kana key and various control keys are provided.
A board device, 2, an editing control section that performs text editing control in accordance with the operation of the control keys of the keyboard device I; 3, a control memory that configures various buffers; and 4, a kana sentence input from the keyboard device I; 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 the kana character string inputted from the keyboard device 1, a result buffer for temporarily storing the 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 each registered sentence provided with 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. The text registration area 20 is provided.

The keyword name table 1o includes, for each registered sentence, a keyword name area 31 consisting of a sentence mixed with kanji, an alphabet or its own character string, a symbol string, a note data area 32 such as the sentence creator code and date, and a keyword name area 32 for the keyword salt. and an address pointer area 33 for indicating the address position of the corresponding text registration area 20, and when one of the keywords is selected, the address pointer area 3
3, the corresponding registered text in the text registration area 2o is transferred to the text buffer and the display memory of the CRT display device 7.

The above-mentioned keyword name search table 11 is used when searching for a corresponding registered sentence from 10 words. and an address pointer 36 that stores address information of the corresponding keyword in the keyword name table 1°. Further, the character code of the character code area 35 is J
The character codes of ISC6226 are divided into point codes, and the character codes are arranged in order of this point code.

The headword table 12 has a character area 38 at the base of each keyword that stores a predetermined number (headwords) from the beginning of the kana character string input when inputting this keyword salt, and a keyword name corresponding to this headword. It consists of an address pointer 39 that stores address information in table IO.

The headwords input into the character area 38 are J from the beginning.
Arranged in the order of IS C6226 codes.

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 text, text information is input using the kana key on the keyboard device 1, and the input kana character string is converted into a sentence mixed with kanji by the kana-kanji converter 4.
The converted sentences containing kanji are sequentially stored 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 Figure 3 (a),
First, the keyword salt is inputted using the kana key on the keyboard device 1, and an instruction for converting 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 a sentence containing the keyword ``shio'' mixed with kanji is temporarily stored in the result buffer.

The kana character string of the keyword salt in the kana buffer causes the n characters (4 characters in the embodiment) of kana characters from the beginning to be transferred to the headword buffer.

In addition to the keyword information, data on the date of creation and the person in charge are also input.

After that, when a registration instruction is issued from the keyboard device 1, the first character of the kanji-mixed sentence of the keyword salt held in the result buffer is displayed in the keyword name search table 1.
The address information in the text area 20 of the registered text is transferred to the address pointer 36 and stored in the character code area 85.

In this case, as mentioned above, the character code area 35 is
The information is classified and stored sequentially for each IS C6226 point code.

Subsequently, the keyword name, date, and person in charge information in the result buffer are transferred to the keyword name table 10, and the keyword name of 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 note data area 32. Furthermore, the address information in the text area 20 of the registered text is transferred to the address pointer area 33.

Also, at -, the kana character string of the keyword salt held in the entry word buffer is read out, transferred to the entry word table 12, and stored in the character area 38, and the address information in the text area 20 of the registered text is set as the address. It is stored in pointer 39.

This headword table 12 is used to determine the keyword name list ψ and Z arrangement order, and as mentioned above, the kana character strings in the character area 38 are arranged in the code order of Tl5C6226, and thereby the general Japanese dictionary. They are arranged in alphabetical order.

The reason for having this headword table I2 is that, for example, if you try to arrange keywords in on-yomi or kun-yomi order after converting them into sentences containing kanji, it will be difficult to determine how the kanji were read and input. Therefore, a headword table 12 for kana character strings is provided to easily arrange the characters in alphabetical order.

After the text is registered as described in 1., the registered text is called up as shown in FIG. 3 (b).

First, if the operator knows the keyword name (registered name), the keyword name is entered from the keyboard device 1 to search for registered sentences. This compares the first character of the input keyword name with the data in the keyword name search table 11, selects a matching location, and then searches for a complete match with the character code string of the keyword name stored in the keyword name chifur 10. do. 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 ■0, and the text buffer and CR
T is transferred to the display memory of the display device.

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

Based on this list call instruction, specify the first location in the headword table 12, select the corresponding keyword salt in the keyword name table 10 from the address information of this first location, and sequentially transfer this keyword salt to the display memory. Tru.

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 salt from the list display, since the keywords are arranged in alphabetical order, the desired keyword salt can be easily searched for.

In the above embodiment, an example of the keyword salt of a sentence mixed with kanji was shown, but the keyword salt can also be an alphabet string or a numerical string.

<Effects> The text processing device of the present invention includes a keyword name table means in which keyword salts (registered names) are registered, and text registration memory means in which texts are registered in association with each keyword salt of the means. , a kana headword table in which kana headwords for each keyword of the keyword name table means are registered, and keyword salts 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 them out and displaying them in a list, for example, by arranging the kana headword table in alphabetical order, keywords can be displayed in a list in alphabetical order, which makes it easier to search for keywords, which is useful for text management. A text processing device that can reduce the burden on the user can be provided.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of the device of the present invention, FIG. 2 is a block diagram showing the configuration of the memory in which text is registered, and FIG.
, ! +, (c) is a flowchart 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. Agent Patent Attorney Aihiko Fuku (and 2 others) Figure 1'lf, Figure 2

Claims (1)

[Claims] 1. In a text processing device that converts kana characters or kana sentences into corresponding kanji or kanji-mixed sentences according to a kana-kanji conversion dictionary and edits the text into a predetermined format, a keyword salt (registered name) is registered. a keyword name table means to be stored, a text registration memory means in which sentences are registered in association with each keyword name of the means, and a kana headword table in which kana headwords for each keyword name in the keyword name table means are registered. 1. A text processing device, comprising: and sequentially reading keywords from the keyword name table means according to the ranking of the kana entry words registered in the kana entry word table.