JPH01200471A - Document generating device - Google Patents

Abstract

PURPOSE:To effectively use a document development use memory by searching a reading KANA (Japanese syllabary) character-string which has been stored and stopping the storage of an input KANA character-string which has been stored and stopping the storage of an input KANA character-string, when the same one exists. CONSTITUTION:When a reading KANA character-string inputted from a character input part 1 is the same as a reading KANA character-string which is read out of a document development use memory 5 by a search by a document editing part 21 of a CPU 2, write to the memory 5 is not executed. Subsequently, by a KANA-to-KANJI converting part 20, said character-string is converted to a KANJI mixed character-string at every one conversion unit and the KANJI mixed character-string which has been stored together with the reading KANA character-string in the memory 5 is displayed on a CRT 8. Accordingly, the document development use memory can be used effectively and its capacity increases substantially.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a sentence creation device, and particularly to a Japanese sentence creation device that efficiently stores “reading data” of a document being created in a memory. The present invention relates to a document creation device for vocabulary.

[Prior Art] Japanese notation requires several thousand characters, and a system in which one key corresponds to one character, such as in English typewriters, requires an enormous number of keyboards. Therefore, for kanji, a J-kana kanji conversion method is known in which the reading of the kanji is input and converted into kanji, thereby creating a document containing a mixture of kanji and kana characters.

As shown in the functional block diagram of FIG. 4, such a document creation device generally includes a keyboard 1, a central office J! I
! It consists of a device 2, a hiragana-kanji conversion key output 3, a cursor control section 4, a document exhibition memory 5, a CRT system display device 6, a font holding memory 7, and a CRT display device 8. The keyboard 1 is equipped with character keys such as kana characters, alphabetic characters, and numbers, and function keys such as a kanji conversion key and a copy key. It is composed of a section 21.

In this device, when a character string containing kanji and kana is input from the keyboard 1 in its pronunciation and the kanji conversion key is operated, the hiragana-kanji conversion unit 20 converts the kanji input δ by the time the kanji conversion key is operated. Search for kanji with the same reading as the character string using the Hiragana-Kanji Conversion Key Old 3,
Convert to a string containing kanji. This converted character string containing kanji is edited by the sentence IN collection section 21 according to the preset formula A, and is stored in the Bunkichi expansion memory 5. This stored document is read by the CRT control device 6, which refers to the font stored in the font holding memory 7 and converts the characters, symbols, etc. that make up the read document into a display font. CR
It is input to the T display device 8 and displayed as a document image.

Here, the pointing device of the cursor control unit 4 can be used to specify the deletion range when there is a part to be deleted in the created document, or to specify the copy range when copying an already created character string to another part. used for.

In the expenditure creation device with the above configuration, the - layer converted character string containing kanji and 5! Generally, character string data in pronunciations is stored in the document exhibition memory 5 in pairs with character strings containing kanji so that they can be reconverted into IS character strings. When storing the character/character string data of the pronunciation kana, information indicating the length of the pronunciation kana data is added for each converted wheel position, as shown in the data format of FIG. 5(a). Further, for the converted character string data containing kanji, pointer information and information on the length of the character string containing kanji are added without indicating the storage location of the pronunciation kana data. In addition, in FIG. 5(a), character string data containing kanji is represented as display data, and in FIG. 6, the data II4 is shown.
It shows the structure in a generalized manner.

On the other hand, in this type of document creation device, a character string containing Chinese characters that has already been input is often copied and used. When making such copies, conventional document creation devices not only copy character strings containing kanji, but also copy kana data as shown in FIG. 5(b). In other words, "requested by the manuscript creator" as shown in the example in Figure 5.
When copying a character string, the pronunciation data of ``I was sent from a doctor'' is copied along with its length information and stored in the document exhibition memory 5.

However, in the configuration shown in FIG. 5(b) in which exactly the same pronunciation kana data is stored, there is a problem in that the stored contents become redundant and the document development memory 5 cannot be used effectively.

゛Therefore, the name of the present invention is to add, in addition to the information on the length of the character string of the pronunciation kana, information on the number of links indicating how many kanji-mixed character strings share one character string of the pronunciation kana, When copying a character string containing kanji, update the link number information related to the reading kana, and add information on the storage location of the link number information to the kanji mixed character string, and check the reading kana of the copied kanji character string. proposed a system that allows searching based on information on the storage location of link number information and referring to pronunciations. (Tokyo Patent Application) On the other hand, even during normal input, it is extremely common to input the same character string repeatedly.However, as shown in Figure 5(b), conventional methods that store all data with the same reading The following method is used for the configuration.

In other words, the entered expenditure "Requested by the manuscript creator" is changed to "manuscript", "by the creator", and "requested" when inputting.
Assume that the data was inputted from .

Next, when "Genkou" is input, the converted kanji are unconditionally placed in the display data menu, and the readings are placed in the reading data memory. Therefore, the stored contents become redundant and the memory capacity quickly becomes full. Then, you will not be able to input the next data unless you discard the data, so discard the first one. but,
After this, there is a problem that re-conversion is not possible.

Therefore, there is a problem in that a memory with a large storage capacity is required to store the unreadable data of a long document as it is.

(5F, the problem that Ming is trying to solve) This invention was made in consideration of the actual situation in Moeki, so is there a memory for the exhibition room? It can be used effectively to store a large amount of f- with limited storage capacity.
The purpose of this invention is to provide an expenditure preparation device that allows users to memorize and retrieve information.

(Means for Solving the Problems) Therefore, in the present invention, before inputting input data into an expenditure storage memory, the reading data in this memory is searched, and if the same data as the input data is found, I try not to enter it.

Preferably, in addition to the ``Yomi-ga-na length'' and ``Yomi-ga-na'' that were the structure of the Yomi-ga-na data in the memory for document expansion,
Add an area called ``Number of Links'', search for reading data before inputting it into the memory for expenditure display, and search for reading data that is the same as the ``reading data'' in the already created document reading memory. If there is, we only update the ``number of links'' and do not input them, and we make sure that the ``readings'' are not duplicated.

[Operation] According to the above configuration, when a character string containing kanji is input, a search is performed to see if there is a character string with the same pronunciation, and if there is a character string with the same pronunciation, for example, information on the number of links that the character string has is searched. Only one is updated, and the character string with reading is not stored. Therefore, only one character string with the same pronunciation is stored, and the number of types that need to be stored can be reduced by the amount of duplication of the pronunciation character string JS, making effective use of storage capacity. Can be done.

[Example] Hereinafter, examples of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a diagram showing a flowchart of one embodiment of processing in the expenditure preparation device of the present invention, and FIG. 2 is a diagram showing changes in memory arrangement when inputting data with the same reading. Statement m shown in Figure 4 is executed in G East 21. Note that the hardware configuration is different from the one in which the sentence 1a collection section 21 has a search function that searches for data that has already been input, and a reference function that checks whether the same reading exists. Since it is the same as that shown in Fig. 4,
While quoting the components of the diagram, 98JI! Explain the flow.

First, as shown in Figure 2 (a), the character input section displays the message ``Requested by the manuscript creator.''
(Display) When displayed on the screen, 1j is displayed in the text m expansion menu, pointer information P11 to PI3 indicating the storage location of the pronunciation data, and length information Lll to LI3 indicating the length of the data are displayed. Display data DD including display character information D11 to 013, number of links LK1 to LK3, length information LNI to LN3 indicating the length of data, and reading data including reading information Yll to YI3. YD is stored.

Here, FIG. 3 is a diagram generalizing the data format of FIG. 2.

The link number information indicates whether the reading data is shared by several character strings containing kanji. For example, if it is shared by two character strings containing kanji, it is stored as a value of "2". .

Here, in the state shown in FIG. 2(a), the number of links LN is 1 because each reading kana data is not shared.

In this state, enter the next character string "Genkotsu" (
In step 100), the sentence 1B collection unit 21 searches for the beginning of the pronunciation data in the document storage memory, and sets this as I (step 101).

Next, it is determined whether the length of the reading data and the length of the input character are equal (step 102). If they are equal, the length of this character string is set to N, and the reading of the input character string and the reading of the character string in memory are determined. Let the leftmost characters be J and K, respectively (step 103).

Then, the γ cut in step 104) is performed to determine whether or not J=, and if J=, that is, the readings of the left end of the input string in memory and the input character string are the same, the length N is subtracted by one. Step 105) It is determined whether this N is 0 (Step 106).

If N=O, that is, there are no more characters next, the number of links of the data with the corresponding reading in this memory is incremented (step 107), and then the pointer information of the displayed character data is changed to the data with the corresponding reading. In addition to indicating the number of links in the head of the f-event, the display data of the input character string is arranged as display data.

However, "Genkou" has a number of N = 4, so if
−1=3≠0. Therefore, the next pronunciation data on the memory J> and the input character string are taken out and set as J, respectively (step 109).

Then, step 1 of determining whether or not J=
Return to step 04 and repeat this process sequentially.

In this way, the reading of the data is read as follows:
When a match is made with "Genkotsu" in l, this link number information LNI is incremented from 1 to 2 (step 107), and the display data includes the display characters "manuscript" as shown in Figure 1 (b). Is the information 014 pointer information that indicates the "genkotsu" of the reading data? [IP L
4 and length information LN4 (step 108).
), this manual processing is temporarily completed.

Next, it is assumed that the character string "toothpick" is input as shown in FIG. 2(C).

Steps 100 to 1 in the same way as when inputting "Genkotsu"
Operation 04 is performed, but since J= is not true, a determination is made as to whether or not there is any data for the next reading (Swap tab 110).

If there is, the beginning of the next reading data is set to 1 (step 111), and the process returns to step 102.

If not, set link number information LN5 to 1 and length information to 4.
The pronunciation information YI4 is input into the memory of the pronunciation data (step 112).

Then, display data information "paper" is arranged as display data so that the pointer information indicates this pronunciation information (step 113).

In this way, when only the number of links is updated or new reading data is added, the input mode is returned (step 114).

On the other hand, when deleting, the number of links is decremented in the same way, and when it reaches 0, it is deleted from the data that is not readable.

In this way, this document creation device can prevent an increase in the storage amount of illegible data, which increases the memory cost.

In this example, link number information is added to the reading data, and when the same data is repeatedly input, this link number information is incremented, when it is deleted, it is decremented, and when it becomes 0, this reading is However, if this deletion is not necessary, the link number information can be omitted.

[Effects of the Invention] As explained above, according to the document creation device of the present invention, prior to inputting input data into the reading memory in the expenditure storage memory, To improve memory efficiency, V-digitize the data with the same reading and stop storing the data with the same reading to prevent duplication of the data with the same reading. Can be done.

[Brief explanation of the drawing]

FIG. 1 shows the expenditure preparation device according to the embodiment of the present invention! l!
Flowchart t7-t diagram showing an example of L raccoon, Figure 2 (a) to Figure 2 (C) are the data of the sentence exhibition memory +V4 M
FIG. 3 is a diagram generally showing the structure of this data jf4, FIG. 4 is a block diagram showing the general configuration of the expenditure preparation device, and FIGS. Figure (b) shows changes in the structure of data M4 in the conventional memory.
The figure is a diagram generally showing a conventional structure. 1...Keyboard, 2...Central Office J! ll! Device,
3... Hiragana-kanji conversion unit, 4... Pointing device, 5... Expenditure expansion memory, 6... CRT control device, 2゜... Hiragana-kanji conversion unit, 21... - Expenditure Editorial Department. Figure 1

Claims (2)

[Claims] (1) An input means for inputting a character string mixed with kanji as a reading kana, a kanji conversion means converting the input character string of reading kana into a character string mixed with kanji for each conversion unit, and the input reading kana a pronunciation storage unit that stores the character string as one conversion unit character string in a predetermined position, and a kanji storage unit that stores the character string mixed with kanji together with information on the storage position of the corresponding pronunciation character string. and display means for displaying the memorized character string mixed with kanji, and after displaying, converting it back to the character string in ichidan-yomi kana, and then converting it to another character string mixed with kanji. A document creation device with a reconversion function that enables the reconversion function is equipped with a search means for searching already stored pronunciation character strings, and checks whether or not the same one exists, prior to storing the pronunciation character string. judge,
If the same character string exists, storage of the character string in the pronunciation is stopped, and only in the case that the same character string does not exist, the storage means stores the kana character string in the pronunciation. Document production device. (2) The pronunciation kana storage unit of the storage means is configured to store the pronunciation character string together with link number information indicating how many kanji-mixed character strings the pronunciation kana character string is shared by. Therefore, when storing a pronunciation string, if there is a pronunciation string that is the same as an already memorized pronunciation string, the number of links for the already memorized pronunciation string is updated. Claim No. (1) characterized in that
Document production device described in Section 1.