JPS62119665A - Word processor - Google Patents

Abstract

PURPOSE:To automate write in, read out and file retrieval of a sentence file by providing a cassette tape recorder possible for logic control in a word processor main body and allowing a CPU in the word processor main body to apply a series of control of the tape recorder. CONSTITUTION:A Kana (Japanese syllabary)/Kanji (Chinese character) conversion processing section 10, a sentence buffer 11 and a Kana/Kanji conversion dictionary section 12 are connected to a CPU 5. An abbreviation memory 13 is connected to the Kana/Kanji conversion processing section 10 and a tape recorder 14 to store the registered sentence data is connected to the CPU 5 via a tape control means 15. In this case, the cassette tape recorder possible for logic control is provided in the word processor main body and a series of control of the tape recorder is executed by the CPU 5 in the word processor main body. Thus, the generated document is written/read on a tape and the file retrieval are attained by having only to operate the word processor to improve remarkably the operability.

Description

DETAILED DESCRIPTION OF THE INVENTION Technical Field The present invention relates to a word processor, and particularly to a function for saving created documents.

<Prior Art> One of the methods for saving documents created with a word processor is to record by connecting a general cassette tape recorder to the word processor, and this method is widely used.

However, with this conventional method, a series of operations such as recording and playback must be performed separately from the word processor operation, which not only makes it very difficult to use, but also requires a lot of time to find the recorded text. It has many drawbacks, such as:

<Object of the Invention> The present invention has been made in view of the above-mentioned drawbacks, and has a structure in which a word processor has a built-in cassette tape recorder that can be controlled by logic, and the operation of the cassette tape recorder can be controlled by the CPU of the word processor. The object of the present invention is to provide a word processor that can automatically write and read text files created based on word processor operations, read files, and search for files.

<Embodiment> FIG. 1 is a diagram showing a text processing device according to an embodiment of the present invention, and this text processing device includes a kana keyboard 1 capable of inputting kana characters. A key signal input by operating the kana keyboard 1 is given to an encoding circuit 3. Key signals from the function keyboard 2 are further input to the encoding circuit 3 . This function keyboard 2 includes an editing control key, which includes a conversion key for instructing conversion of kana characters into kanji or sentences mixed with kanji, and a conversion key for instructing conversion of kanji into kanji or a sentence containing kanji. There are conversion keys, previous candidate keys, etc.

The encoding circuit 3 encodes the key signals of the kana keyboard 1 and the function keyboard 2, and converts them into kana character data (
The Kana character code) is temporarily stored in the input buffer 4, and the coded signals of each key included in the function keyboard 2 are directly provided to the central processing unit (hereinafter referred to as CPU) 5.

The CPU 5 functions as an arithmetic processing means by executing an operation program shown in FIG. 2, which will be described later.
Includes kana-kanji conversion function, writing function and reading function. The CPU 5 is provided with a CR via the CRT control means 6.
A T display 7 is also connected to a printer 9 via a printer control means 8. The CRT display 7 is used to display human-generated kana sentences and converted kanji or kanji-mixed sentences. The printer 9 is used to print sentences mixed with kana or kanji.

The CPU 5 also includes a kana-kanji conversion processing section 10. A text buffer 11 and a kana-kanji conversion dictionary section 12 are connected.

A shortening memory 13 is connected to the kana-kanji conversion processing unit IO. Further, in the CPU 5, a tape recorder 14 for storing the registered text data is connected to the tape control means 1.
5.

Next, to explain these configurations in more detail, the kana-kanji conversion processing unit 10 works as a kana-kanji conversion means in cooperation with the CPU 5, and includes an output vanofer 10a, a shortened data setting buffer 10b, and a register. area 10c
The output buffer 10a stores data to be output, such as kana sentences, kanji characters, and kanji-mixed sentences displayed on one screen (one frame) of the CRT display 7. Ru. The abbreviated data setting buffer 10b stores abbreviated kana characters that should be newly registered as abbreviated data, kanji conversion data that should be used to convert them into sentences mixed with kanji, etc. Register area 1
・Oc has multiple storage areas (
Each register is used to store the number of homophones of a headword (for example, one character in kana) of homophone shortened data.

Tape recorder 142 Sentence 1: The Banofa 11 stores kana-written sentences with kanji mixed in them and converted by the kana-kanji conversion processing section 10 as civilization data.

The kana-kanji conversion dictionary section 12 has, for example, a read-only memory (
Storage area 1 consisting of ROM) etc. and storing word dictionaries.
2a, a storage area 12b1 for storing a list of conjugated words, a storage area 12c for storing a list of adjunct words, and the like. This word dictionary storage area 12a includes a kana heading section in alphabetical order,
The word stem and frequently changing part (
It includes a kanji notation section that stores kanji characters (hereinafter collectively referred to as word stems), and a part-of-speech data section that stores part-of-speech data and the like.

The shortened memo IJ 18 includes an RA including multiple storage areas.
M etc. are used, and the first character of the reading kana (i.e. kana input sentence) of the kanji-mixed sentence converted in the conversion unit (for example, segment unit) of the input sentence is memorized as a kana headword, and it can be converted as needed. Data on the frequency of use of the sentence (indicating how many times the same segmental unit of kanji-mixed sentences, etc. are used in the sentence) is stored. In other words, the shortened memo January 8 has an area for storing a plurality of shortened kana sentences, an area for storing kanji-mixed sentences corresponding to the shortened kana sentences corresponding to the storage area for each shortened kana sentence, and a storage area for each shortened kana sentence. and an area for storing the frequency of use for each.

Here, to briefly explain the kana-kanji conversion process performed by the kana-kanji conversion processing unit IO, the input kana sentence is searched in the word dictionary in order from the top of the kana characters, and the part-of-speech data for the word stem searched in the word dictionary is Read out.

Based on this part-of-speech data, a conjugation ratio table and i.
The 1st genus 1t7j table is searched, and the kanji 1st line sentences that match the kana sentences are read out and stored in the output sofa IOa.

FIG. 2 is a flowchart illustrating the specific operation of a document processing device according to an embodiment of the present invention, and below, referring to FIGS. 1 and 2, the specific operation of this embodiment will be explained. .

The CPU 5 determines in step 1 whether or not a kana character has been input. If the operator does not operate the kana keyboard 1 and operates the conversion keys and non-conversion keys included in the function keyboard 2]7
If not, in step I it is determined that the input is not a kana character, in step 2 it is determined that it is not a conversion key, and in step 3 it is determined that a non-conversion key is sufficient, then in step 32, for example, a tape is input. Registration is performed in the recorder 14 or text buffer 11, document data registered in the example is called up in step 40, and other processing is performed.

On the other hand, when the operator inputs a sentence formed by converting kana to kanji, the operator operates the kana keyboard 1 to input a kana sentence for each segment. At this time, each time a kana character is input, it is determined in step l, and the process proceeds to step 5. In step 5, the input kana characters are encoded by the encoding circuit 3 and stored in the input cover 4. The operations of steps 1 and 5 are then repeated each time a kana character is input. therefore,
The kana sentence of one segment is stored in the input cabanofa 4, and when the operator inputs one segment,
Depending on whether or not the kana sentence of the segment needs to be converted into kanji, a conversion key or a non-conversion key included in the function keyboard 2 is pressed.

Now, assuming that the conversion key is pressed, it is determined in step 2 and the process proceeds to step 6. It is determined whether or not it is a number (for example, one character). If the 1 entered this time
If the kana sentence of the segment is not the same as what has been input so far, it cannot be abbreviated and input, so one or more characters should be input. Therefore, if it is determined that the number of kana characters is two or more, the process proceeds to step 7. In step 7, the word dictionary is searched in order from the top of the one-segment kana sentences stored in the input buffer 4, and sentences with the same reading kana mixed with kanji are read out. In step 8, the address value in the word dictionary corresponding to the read kanji-mixed sentence (word stem) is temporarily stored in an internal buffer included in the kana-kanji conversion processing section 10. In step 9, read out kanji mixed sentences, etc. (word stems, conjugated endings, adjunct words)
is stored in the output vanofer IOa. Dekabanonoa lo
The characters stored in a are displayed on the CRT display 7.

Next, the operator determines whether the kanji-mixed text displayed on the CR, T display 7 is the desired font, and if it is a different font, so-called homophone, press the conversion key again to select the next one. Commands to read out candidate sentences containing kanji. In response to this, it is determined that the key manually pressed in step IO is a conversion key, and the process returns to step 7. As a result, the operations of steps 7 to 9 are repeated, and the next candidate sentence containing kanji is read out, memorized in the output sofa Oa, and displayed on the CRT display 7.

When a desired kanji-mixed sentence or the like is read out, the operator presses a key other than the conversion key (for example, a kana sentence key operated to input the next kana sentence). Accordingly,
In step 10, it is determined that a key other than the conversion key has been operated, and the process proceeds to step 11.

In step 11, the contents of the output banner [Oa] are transferred to the document memo 'J I 1 and written into the storage area immediately after the sentences input so far.

In step I2, the contents of the output banoffer IOa are transferred to the shortened data setting buffer 10b, and a shortened data creation process is performed.

Here, details of the shortened data creation process will be explained. The shortened data setting buffer] Ob includes areas b1 to b4 as shown in FIG. A delimiter code is written in area 1b. Frequency data (initially O) is written in area b2. In area b3, the first character of the kana sentence stored in the input cover sofa 4 is written as a headword.

Furthermore, each character code of the word stem corresponding to the headword read from the word dictionary (or address data of the word stem stored in the dictionary) is written in area b4. In this case, Rizan, which stores only the word base as abbreviated data, changes depending on the conjugation, so correction is required each time, and it is better to register only words that do not change.

Subsequently, in step 1B, 1 is added to the value of the register that has the same sound as the currently input headword included in the register area 10c, and the number of headwords is added by 1.

As a result, the number of headwords for all the sounds stored in the shortening memory 13 is stored in the register corresponding to each sound included in the register area 10c. Then, in step 14, it is determined whether the number of headwords stored in the register corresponding to the currently input sound among the registers included in the register area 10c has reached a predetermined number (n). If it is determined that the number is equal to or less than the predetermined number, the process proceeds to step 15. In step 15, it is determined whether the shortening memory 13 has any storage capacity remaining.

If it is determined that there is a remaining storage capacity of the shortening memory 13, the process proceeds to step 16. In step 16, the stored contents of the shortening memory 12 are shifted one by one to lower addresses, and the data stored in the shortening data setting buffer 10b is written to the first address. After that, return to step 1.

In this way, when a phrase that has never been input before is input, the abbreviated data for that phrase is written into the abbreviation memory 13 using the first character of the phrase as a headword. The above operations are performed every time a new phrase is input.

Next, the operation when the number of homophones reaches a predetermined number (n) will be explained. When the number of homophones reaches a predetermined number, it is determined in step 14 and the process proceeds to step 17. Step 1
At step 7, homophonetic headwords in the shortening memory 13 are searched, and usage frequency data for each kanji-mixed sentence etc. that is converted from the homophone headword to kanji is read out. Then, through the operations in steps 17 to 22, the least frequently used homophone headword is selected and deleted.

In this specific process, for example, the shortening memory 13 is searched to read out the usage frequency of one homophone headword. In step 18, it is determined whether or not the frequency of use is plural. If it is determined that the usage frequency is not plural, the process proceeds to step 19. In step 19, abbreviated data corresponding to homophonetic headwords with a singular usage frequency are deleted. In step 21, the contents of the register storing the number of homophone headwords are subtracted by 1. In step 22, the contents of the shortening memory 13 are sequentially shifted to fill up the deletion area. After that, the process returns to step 15.

Next, a description will be given of the operation when inputting a kana corresponding to a headword using the registered data in the abbreviation memory 13 and converting the kana to kanji by abbreviation input.

The operator operates the kana keyboard 1 to input one character of the kana, and then presses the conversion key.

The operations in this case are similar to those in steps 1.5 and 2 above. If it is determined in step 6 that the number of kana characters stored in the input buffer 4 is one, the process proceeds to step 23. In step 28, the one-character kana entered this time is used as a headword,
The abbreviated data of the same sound stored in the abbreviated memory 13 is searched, and the most frequently used abbreviated data is read out.

In step 24, it is determined whether there is a plurality of shortened data items that have just been read out. If a plurality of abbreviated data having the same sound are registered, in step 25, the abbreviated data stored in the upper address of the abbreviation memory 13 is selected and read out.

In other words, the abbreviated data of the most recently input kana that is the same as the headword of the currently input kana character is selected. Thereafter, the process proceeds to step 26. If it is determined in step 24 that the shortened data is singular, the process directly proceeds to step 26. In step 26, the selected shortened data or the currently input one
Code data such as sentences mixed with kanji of shortened data corresponding to kana characters are transferred to the output vanofa IOb and output to the CRT.
It is displayed on display 7. Then, the operator checks the displayed kanji-mixed text, etc., and confirms that it is the desired kanji-mixed text, etc., and then selects a key other than the conversion key and previous candidate key, such as the next kana character input key. Be manipulated.

In response, in step 27 it is determined that the key is not the conversion key, and in step 28 it is determined that it is not the previous candidate key, and the process proceeds to step 29. In step 29, 1 is added to the value of the usage frequency storage area corresponding to the shortened data read out from the shortened memory 13 this time. In step 30, data such as a sentence mixed with kanji characters converted by the shortening process and stored in the output sofa 10b is transferred to the document memory 11 and written therein.

On the other hand, when the contents of the output banner 10a are displayed on the CRT display 7 in step 26, when the operator confirms that the contents are not the desired sentences mixed with kanji, etc., he presses the conversion key again. In response, it is determined in step 27 that the conversion key has been operated, and the process returns to step 23. Then, the operations of steps 23 to 27 are repeated, and another entry word with the same sound is found in the shortened memory 1.
The abbreviated data stored in the lower address of No. 3 is selected, and a sentence containing kanji and the like corresponding to the abbreviated data is written to the output vanofer 10a. Then, the process is repeated until the operator confirms that it is a desired sentence mixed with kanji and presses a key other than the conversion key or the previous candidate key.

By the way, depending on how you use the kana-kanji conversion device,
It can also be used when performing normal conversion of a single character. In that case, a key called a previous candidate key, which means general conversion, is operated. If the previous candidate key is operated, step 2
This is determined at 8 and the process returns to step 7, where the normal conversion described above is performed.

In addition, if the no conversion key is operated, there is no need to convert the input kana sentence to a sentence mixed with kanji, so step 3
This is determined in step 31, and the process proceeds to step 31. In step 31, the contents of the input buffer 4 are directly transferred to the output sofa 10a, and then the process proceeds to step 11. Once the desired sentence 1: is registered in the sentence buffer 11 as described above, the operator can then In order to register the data on the cassette tape, the key code of the document data is input and an instruction to register the document data is given to the CPU 5.

That is, a registration instruction is given in step 32, and step 33
After inputting the key code 25 manually, by issuing a registration instruction again in step 34, CuF2 first controls the tape recorder 14 via the tape control means 15 in step 35, and displays the table of contents section of the recording tape 210 shown in FIG. After reading out the key code 22 and storing this key code 25 in the area next to the table of contents area already registered in step 36, the writing start address of the document is determined in step 37, and the tape is sent at that position. , write document number 23. Then, the CPU 5 sends the text buffer 1 in step 38.
The document data 24 of No. 1 is sequentially read out, and the document data 24 is written following the document number 23 on the tape.

Note that the document number 23 is automatically determined as the document number 23 on the apparatus side depending on the data writing state of the tape.

Next, when reading out the document data registered in this manner, first, in step 40, the call key is operated to give a call instruction to the CPU 5. Upon receiving this instruction, the CPU 5 takes step 4.
1, the tape recorder 14 is controlled via the tape control means 15, and the table of contents of the tape is read out and displayed on the CRT 7. After looking at the displayed contents, a desired key code is input in step 42, and a call instruction is given to the CPU 5 again in step 43. Upon receiving this instruction, the CPU 5 selects a text area that matches the key code in step 44, automatically cues that position, and then sequentially stores the text area 9 document data 24 in the document buffer 11 in step 45. let The operator converts the document data read in this way to C.
Display on RT7 and perform addition and correction printing.

<Effects of the Invention> As described above, the word processor of the present invention has a logic-controllable cassette tape recorder provided in the word processor main body, and a series of controls for the tape recorder are performed by the CPU in the word processor main body. , the operability is significantly improved.

[Brief explanation of drawings]

FIG. 1 is a block diagram of a text processing device according to the present invention. FIG. 3 is a diagram explaining the abbreviated data setting buffer in the output buffer of the device, and FIG. 4 is a diagram explaining the application area of the recording tape used in the device. It is.

Claims (1)

[Scope of Claims] 1. In a word processor for creating and editing texts, a logic-controllable cassette tape recorder is provided in the word processor main body, and a series of controls of the tape recorder are controlled by a CPU in the word processor main body.
A word processor characterized by: