JPS6318435A - Device for retrieving word of electronic dictionary - Google Patents

Abstract

PURPOSE:To efficiently use an electronic dictionary, by retrieving interval data from the head of an index block with a readout circuit and reading out a first word data in accordance with the interval data, and then, discriminating whether or not the block is the one to which the word data belong. CONSTITUTION:In retrieving interval data, a CPU 11 reads out the next stored index data 19 by regarding the data 19 as the first stored index data of the index data group belonging to the block 20. When the leading index data 19 of the block 20 is found, the CPU 11 successively reads out the index data group from the data 19 until the index data which coincides with an index candidate is found. In such way, interval data 21 is provided at the end of the index data 19 for the index data 19 extended over two blocks so that the leading index data of the block 20 can easily be discriminated in accordance with the interval data 21.

Description

DETAILED DESCRIPTION OF THE INVENTION (Industrial Field of Application) The present invention relates to a middle-fill search device in an electronic dictionary.

(Prior art) Conventionally, electronic dictionaries used in, for example, English word dictionary stores word data in alphabetical order, and also store 141,579 data because a binary search is used to search for words. The storage area was divided into multiple blocks.When searching from the single 8n8 electronic dictionary to be searched, the English word data stored at the beginning of each block is read out and the same search is performed using a known binary search method. I was trying to figure out the block to which the single iJi belongs.

(Problem to be solved by the invention) However, since it is necessary to memorize the 11-word word at the beginning of each block, it is not possible to memorize the IP word across the previous and subsequent blocks. O. However, since each block has a fixed length, the word data cannot be stored exactly, and there is always an empty area in each block where nothing is stored, and the storage capacity of the electronic dictionary is not used efficiently. Ta.

(Objective) The object of the present invention is to provide a tJi word search device for an electronic dictionary that can solve the above problems, eliminate empty areas in the electronic dictionary, reduce memory, and perform searches as before. be.

(Means for Solving the Problems) In order to achieve the above object, the present invention divides the storage area into a plurality of blocks as shown in FIG. 1, and stores a large number of word data in alphabetical order. Also, a storage means 1 which stores word data stored in the vicinity of breaks between the divided blocks among the sequentially stored words with break data indicating block breaks, and a word to be searched. an input means 2 for inputting a block, an indexing means 3 for determining the beginning of the block in the storage means 1 according to a predetermined order, and a search means 3 for searching for break data from the beginning of the block determined by the determining means 3, The reading means 4 reads the first word data belonging to the block based on the first word data belonging to the block, and the search should be performed based on the read word data! The gist of the present invention is a retrieval system for the middle crystal 11 of an electronic dictionary, which comprises a determining means 5 for determining whether or not the iI word data is a yielding block.

(Operation) When the reading means 4 searches for break data from the beginning of the block determined by the indexing means 3 and reads out the first word data that yields to that block based on the break data, the determining means 5 determines whether the data has been read out. Based on the word data, it is determined whether the block contains the searched word data.

(Embodiment) The present invention will be described below according to an embodiment in which the invention is embodied in an English word processor.

FIG. 2 shows an electrical block circuit showing the electrical configuration of an English word processor, and a central processing unit (under jX, referred to as CPU) 11 as an indexing means, reading means, and judgment means is a program consisting of a read-only memory (ROM). It operates based on the 1Iil control program stored in the memory 12, and inputs character data based on the operation from various types of input horns 13 arranged on the keyboard.

The CPtJll has a working memory 14 consisting of a readable and rewritable memory (RAM) that stores character data input using the keys 13 and sentences and data created by the cPU 11, and a large number of English word data as a storage means. a dictionary memory 15 consisting of a read-only memory (ROM) storing tj, and data for converting the word data in the dictionary memory 15 into ASCII code.
It is connected to a code conversion table 16 consisting of a read-only memory (ROM). And C.P.
Based on the character data or document data stored in the working memory 14, U11 causes the display H17 to display the character or sentence m, and also operates the printer device 18 to print the document.

The dictionary memory 16 has a large number of headings constructed using a data compression method using a well-known Huffman code. 91 days of i are stored in the alphabet, and the data 19 of each headword contains the compound 15 for the headword edict! A derived word code indicating the derived Jn of the type is also stored.

The storage area of the dictionary memory 16 is divided into a plurality of blocks 20 as shown in FIG. 3, and a large number of headword data 19 are stored in alphabetical order starting from the first block 20. ing. The number of bytes of each block 20 of the scripture memory 16 (512 bytes in this embodiment) is set in advance, and the number of bytes of each block 20 of the scripture memory 16 is set in advance, and the number of bytes of each block 20 of the scripture memory 16 is set in advance. , in this embodiment, there are two blocks straddling the front and rear blocks 20 (in this case, five blocks 20).
Break data 21 indicating a block break is added to the end of the headword data 19 and stored. Therefore,
When writing/entering the headword data 19 into the dictionary memory 15, the headword data 1 is written at a position that is an integral multiple of 512 bytes.
When 9 is old, the crossword data 21 is inserted at the end of the headword data 19.

As mentioned above, this break data 21 is
? Data 19 is the previous and subsequent block 2o1. : Indicates the block break to be stored across, and also indicates that the headword data 19 belongs to the previous block 20 in this embodiment.

Next, the search processing operation of the CPU 11 will be explained according to the flowchart shown in FIG.

Now, when CPtJll inputs the English word to be searched using key 13, CPU II asks ``Do you have the same English word 6?'' Create a heading i+Ff candidate in which j can be a derived word of a certain headword based on its spelling, and create headword data 19 that matches the various heading candidates.
is searched from the dictionary memory 15.

This search is performed using a binary search method. In this binary search method, the CPLll first determines the starting address of the block 20 (Step 1), reads the contents of 3 bytes backward from the starting address, and searches to see if there is any cutoff data 21 in it (Step 1). 2.3)
. If there is no break data 21, CP (Jll) increments the address, reads the contents of 3 bytes backwards, and searches whether there is break data 921 in the same way as before (step 2). 3).

Then, when searching the break data 21 (step 3)
, the CPU 11 next stores the stored headword data 19.
Is the heading 8 stored first among the heading edict data group belonging to the block 20? 1 data 19 and is read out. Then, headword data 1 at the beginning of block 20
When the CPU finds out the heading word data 19, the CPU sequentially reads out the heading item data 19 that matches the heading Hn candidate.
Search for.

In this embodiment, break data 21 is provided at the end of the data 19 for one headword data that spans blocks, and based on the break data 21, the headword data 19 at the beginning of the block 2o is Since it is now possible to easily determine which one is, it is no longer necessary to store n data 19 in each heading in block 2o without straddling other blocks, which creates unused storage space in each block. Therefore, the dictionary memory 15 can be used very efficiently and the memory capacity can be reduced.

Note that this invention is not limited to the above embodiments,
In the embodiment, the break data 21 is the front and rear blocks 2o.
The heading 50 data stored across the 841 is added [f] to indicate that it belongs to the previous block 2o, but this is added to the previous and subsequent blocks 20:v
It may also be implemented by adding the heading Qn to the beginning of the stored block 19 to indicate that it belongs to the subsequent block 20.

In this case, when the CPU 11 first determines the starting address of the block 20, it reads data forward from the final address of the previous block 20 to search for end-of-line data 21. Then, when the break data 21 is searched, the CPU 11 selects the headword data 19 which is the first stored headword data 19 of the headword data group belonging to the rear block 20 and which is the headword data 19 formed by adding this break data 21.
It is determined that this is the case and is read out.

In addition, in the embodiment described above, the memory 16 stores data 19 of a large number of headwords in alphabetical order, which are constructed by data compression using a known Huffman code, and the data 19 of each headword ratio includes the corresponding headword. It was a dictionary memory that also stored ``derivative edicts'' that indicate multiple types of derivative words for a header edict, but it is not limited to this, and in short, it is divided into multiple blocks, and the dictionary memory is divided into multiple blocks. If the data stored by the partitioned block is not restricted by adding i.
Of course, the present invention may be implemented using a dictionary memory that sequentially stores word data other than headword data including imperial edicts.

(Effects of the Invention) As described in detail above, according to the present invention, it is possible to eliminate unnecessary empty areas in the multiplex dictionary, and it has an excellent effect of reducing memory.

[Brief explanation of the drawing]

Fig. 1 is a claim correspondence diagram for explaining the invention in detail, Fig. 2 is an electrical block circuit diagram of an English word processor embodying the invention, and Fig. 3 also explains the contents of the dictionary memory. FIG. 4 is a flowchart for explaining the search processing operation, and FIG. 5 is an explanatory diagram for explaining the contents of the dictionary memory, showing another example of the present invention. In the figure, 1 is a storage means, 2 is an input means, 3 is an indexing means, 4 is a reading means, 5 is a judgment means, 11 is a central processing unit, 12 is a program memory, 15 is a dictionary memory, 1
9 is heading in data, 20 is a block, and 21 is break data.

Claims (1)

[Scope of Claims] 1. The storage area is divided into a plurality of blocks, a large number of word data are stored in alphabetical order, and there is a break between the divided blocks among the sequentially stored words. a memory means (1) for storing word data stored nearby with break data indicating block breaks; an input means (2) for inputting a word to be searched; a determining means (3) for determining the beginning of the block in the storage means (1); and searching for break data from the beginning of the block determined by the determining means (3), and searching for break data from the beginning of the block based on the break data. A reading means (4) for reading out the first word data belonging to the block; and a judgment means (4) for judging whether the word data to be searched belongs to the block based on the read word data (4).
5) An electronic dictionary word search device comprising: 2. The word data stored across blocks in the storage means (1) belongs to the previous block, and the break data added to the word data is added to the end of the word data. If the first word data of the next block is word data that spans the previous block, the reading means (4) always appends it to the word data sequentially from the beginning of the next block backwards. 2. A word search device for an electronic dictionary according to claim 1, wherein the electronic dictionary word search device reads out the break data side and determines the first word data belonging to the subsequent block. 3. The word data stored across blocks in the storage means (1) belongs to the later block, and the break data added to the word data is added to the beginning of the word data. If the first word data of the next block is word data that spans the previous block, the reading means (4) always appends it to the word data sequentially from the end of the previous block forward. 2. The electronic dictionary word search device according to claim 1, wherein the electronic dictionary word search device reads out the break data side and determines the first word data belonging to the subsequent block.