JPH05342195A - Dictionary retrieving method - Google Patents

Abstract

PURPOSE:To store a lot of words with the same storage capacity by having 1 byte information with segmentation and header character codes added together. CONSTITUTION:Concerning the dictionary retrieving method for retrieving a dictionary describing header words and information corresponding to the header words by using the header words, it is expressed by the bit information of one bit that there are segmentation in the header words described in the dictionary, and the bit information is previously added at the positions of sections in character codes constituting the header words. For example, all the header are stored while being written in Japanese syllabary (KANA) and for the descriptions, codes for referring to the headers are stored. A code C1 shows KANA reference and a code C2 shows reference with the square form of KANA. On the other hand, the segmenting information is expressed by setting '1' at the seventh bit of a segmented character. Thus, the header information and the correspondent information can be outputted by utilizing the segmentation information, and the capacity of the header information can be reduced.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a dictionary search device, and more particularly,
The present invention relates to a dictionary search method for a dictionary search device that searches for heading information stored in advance in storage means and outputs the searched heading information and corresponding information to a predetermined output means.

[0002]

2. Description of the Related Art Conventionally, in a dictionary search device such as an electronic dictionary, headline information (keyword or headword) and corresponding information (notation or meaning) are stored in a storage device, and the headline information is searched by a predetermined method. It is known that information is searched and the searched headline information and corresponding information corresponding thereto are output using a display device or the like.

In particular, when outputting a heading and a notation, there is a method in which the division information is stored in advance in the heading in order to give the reading about the kanji of the notation from the heading.

Further, in order to gradually reduce the storage capacity, there is one in which a plurality of heading information and corresponding information are used as a block and compression is performed for each block, and these compressed information are respectively extracted from the beginning of the block at the time of retrieval. There is a device that sequentially develops each piece of information to obtain desired information.

[0005]

However, in such an information retrieving apparatus, hiragana and katakana are represented by different one-byte codes, and the division information is also stored.
Since the bytes are occupied, there is a problem that as the number of headwords increases, the storage capacity occupied by the division also increases.

Therefore, an object of the present invention is to solve the above problems and provide a dictionary search method capable of storing a large number of words with the same storage capacity by having the separation information and the index character code in one byte. Especially.

Further, in the dictionary search device for block compression, when the compressed information is expanded, the compressed information is expanded in order to obtain desired heading information and corresponding information. When the block is encoded by referring to the previous information, the block must be expanded again from the beginning, and there is a problem that a waiting time occurs due to the time required for expansion.

Further, in order to speed up the search, if a pointer indicating the address of each piece of information is stored in advance in the ROM or the like, if there are a large number of heading information, the same number of pointers must be held. However, a large storage capacity is required.

A second object of the present invention is to solve the above problems and to quickly re-expand information in a block searched once without having to store a pointer in a ROM or the like in advance. To provide a method.

[0010]

In order to achieve such an object, the invention of claim 1 is a dictionary search method for searching a dictionary in which a headword and information corresponding to the headword are described by the headword. In 1, the fact that the entry word written in the dictionary has a division is represented by 1-bit bit information, and the bit information is previously stored in a character code corresponding to the division position among the character codes forming the entry word. It is characterized in that it is added.

According to a second aspect of the present invention, there is provided a dictionary retrieval method for retrieving a dictionary in which a headword and a plurality of pieces of information corresponding to the headword are compressed by one block, and the dictionary is searched by the headword. When the information of the block is developed based on a plurality of the entry words and the information sequentially, the description positions of the entry words and the information are stored.

[0012]

According to the first aspect of the present invention, since the sharing information represents the sharing position with 1 bit, the information bit information described in the dictionary can be reduced as compared with the conventional case.

According to the second aspect of the present invention, by storing the entry position of the entry word and the corresponding information, the expansion is performed using the stored information even when new expansion is performed using the previous expansion information. All that is required is that there is no need to re-expand from the beginning of the block as in the conventional case.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described in detail below with reference to the embodiments shown in the drawings.

<First Embodiment> FIG. 1 is a block diagram of an information retrieval apparatus adopting the present invention.

In the figure, reference numeral 2 is a central processing unit (CPU) including a microprocessor, etc., and a read-only memory (ROM) according to an input from the keyboard 1.
4 executes each process of the program 4a stored in 4.

Here, the keyboard 1 is connected to the CPU 2 via an interface means (not shown). ROM4
Stores a heading information and a dictionary 4b storing the corresponding information, and the information of the dictionary 4b is searched by using a character string input from the keyboard 1. The RAM 3 is provided with an input buffer 3a for temporarily storing input data from the keyboard 1, a display buffer 3b for expanding data to be displayed, and the like.

The display 6 is an LCD panel or C
It is composed of an RT display and the like, and is driven through the display driver 5.

FIG. 2 is an external view of the information retrieving apparatus in this embodiment, and 1 and 6 respectively show the keyboard 1 and the display 6 in FIG. The keyboard 1 is composed of a character input key 1a for inputting an alphabet, a search key 1b for executing information search, a cursor key 1c, and the like.

FIG. 3 shows a state in which a character string is input and information retrieved using the character string is displayed. Display screen 3-
(A) is in the middle of inputting a character string, display screen 3- (b) shows that the input is completed, and display screen 3- (c) shows that the word "speak" was searched by pressing the search key. As for the state, 3- (d) shows a state in which the search key is pressed again to display the next word, "word of call".

FIG. 4 shows the contents of the dictionary 4b in the conventional example. The dictionary 4b stores headwords and notation data corresponding to the headwords.
The character code to be actually stored is shown below the headword and each word of the notation (see FIG. 10 for the character code table).

FIG. 5 shows an example of the contents of the dictionary 4b according to the present invention. Headings are all stored in hiragana, and notations store codes that refer to the headings. Code "c1" indicates a Hiragana reference,
The code “c2” is a code indicating a katakana reference. The division information is represented by setting 1 to the 7th bit of the divided character.

FIG. 6 is a flowchart of data processing executed by the CPU 2 of FIG.
In step S2, the key input process is performed, and in step S2, the key is identified. In step S3, when an input word is input from the character input key 1a, the CPU 2 performs a process of setting in the input buffer 3a, and in step S4, a search process is performed when the search key 1b of the keyboard 1 is input. ..
In step S6, a process of displaying the data set in the display buffer 3b on the display device 6 is performed. The above series of processes are repeated to perform the information search process.

FIG. 7 shows in detail the search process of step S4 of FIG. 6, in which the CPU 2 first checks in step S101 whether the 7th bit of each character of the entry word has "1". If so, it records in the internal memory what number it is. Then step S1
02 turns off the 7th bit of each character of the entry word (“0”)
To do. Then, in step S103, the input word and the entry word are compared. These series of processes are repeated until the input word is equal to or larger than the headword (the headword is found). When the headword is found, the process proceeds to step S107, and the found headword and its notation are set in the display buffer.

(Other Embodiments) FIGS. 8 and 9 show examples in which headwords are formed by alphabets.

FIG. 8 is an example of a description in the case of using a conventional idiom as an entry word, and the alphabet and the space as the division thereof are each stored in 1 byte. (For character codes, refer to FIG. 10 and FIG. 11.) FIG. 9 is a description example to which the present invention is applied. For a compound word that is an entry word, there is a space that is division information. It is expressed using.

<Second Embodiment> FIG. 12 is a block diagram showing a circuit configuration of the second embodiment. In the figure, reference numeral 52
Is a CPU such as a microprocessor, which executes each process of the program 54a stored in the ROM 54 according to an input from the keyboard 51.

Here, the keyboard 51 is connected to the CPU 52 via the interface means. The ROM 54 stores a dictionary 54b in which headline information and its corresponding information are compressed and stored, and the information of the dictionary 4b is searched using a character string input from the keyboard 51.
A method such as the Huffman method is used for compression in this case, and a slide dictionary method or the like is used as a method for referring to the previous character string in order to increase the compression rate.

The RAM 53 has an input buffer 53a for temporarily storing input data from the keyboard 51, a display user 53b for expanding data to be displayed, and a search information buffer 5 for storing information expanded when an information search is performed.
3c, and a pointer storage buffer 53d for storing pointers to each information in the expanded block. The display 56 is composed of an LCD (liquid crystal) panel, a CRT (cathode ray tube) display, or the like, and is driven via the display driver 55.

The external appearance of the apparatus in this embodiment is the first in FIG.
Similar to the embodiment, the keyboard 51 includes a character input key 51a for inputting an alphabet, a search key 51b for executing information search, a cursor key 51c, and the like.

Next, the operation of the above configuration will be described with reference to FIGS. 13 to 15 show
The flow of the program stored in the program storage area 54a of the ROM 54 is shown. FIG. 16 shows the data structure of the dictionary 4b, and FIG. 17 shows a state in which the address of each word is stored in the pointer storage buffer.

The INDEX in FIG. 16 is composed of the reading of the leading word of the block and the leading address, and each word in the word dictionary consists of the data size, the reading of the compressed word, and the compressed word data. In this case, the compression rate of each word data is increased by referring to the word data of the word before that.

FIG. 13 is a flow chart of data processing executed by the CPU 52 of FIG. First, step S1
In step 1, a key input process is performed, and in step S12, the key is discriminated. In step S13, the character input key 51
When an input word is input from a, a process of setting it in the input buffer 53a is performed, and in step S14, an information search process is performed when the search key 51b of the keyboard 51 is input. In step S15, when the search key 51b is input while displaying the searched information, a pre-post search process of searching the words before and after is performed. In step S17, a process of displaying the data set in the display buffer 53b on the display device 56 is performed. CPU 52
Repeats the above series of processing to process data.

FIG. 14 shows details of the information search process in step S14 of FIG. IN in step S201
The reading at the beginning of DEX is set and compared with the input word in S202. This is repeated in S203 and S204 while the input word is smaller, and the start address of the block corresponding to the input word is obtained in the dictionary order. When the start address of the block is found, the reading of the start word of the block is set in S205 and compared with the input word in S206. This is repeated while the input word is small, and at the same time, the address of each word is sequentially stored in the pointer storage buffer 53d. In step S210, a process of expanding the searched word is performed, and in step S211, the read and expanded word data is set in the display buffer. Next, in step S212, the address of the next entry word is stored in the pointer storage buffer 53d.

FIG. 15 shows details of the pre-post search processing in step S15 of FIG. In step S301, the previous search or the next search is discriminated. According to each case, the word address is obtained from the pointer storage buffer 53d in steps S302 and S303. In the case of the next search, the next entry word address is stored in the pointer storage buffer 53d in step S304. Then step S
The word data is expanded in 305, and the read and expanded word data is set in the display buffer in step S206.

Step S210 of FIG. 14 and FIG.
When the word data refers to the word data that precedes it in the expansion of the word data in step S305, the address of the pointer storage buffer 53d is referred to and the word data of the referenced word is also expanded. Decode the reference part. As an example, FIG. 18 shows a case where the word “love” shown in FIG. 15 is coded with reference to “love” two before that. The set of three numbers shown in parentheses in the figure is
It shows how many words the reference word is before, where it is the same, and how many bytes are the same. Actually, the coded one is embedded in the dictionary. In this case,
If "aijo" is searched, "(2,1,
2) Expand "information", obtain the address of "ai" from the pointer storage buffer, expand "love", and then decode "love".

(Other Embodiments) As shown in FIG. 19, when a block is determined, a process of first obtaining all pointers to all words in the block is performed in step S20 of FIG.
You may carry out instead of 5. By doing so, it is not necessary to find a new pointer for the next word at the time of pre- and post-search, so the process becomes simple.

Further, the reference to the previous information may be made multiple times.

[0039]

As is clear from the above, according to the invention of claim 1, the character code representing the heading information and the division information can be represented together in 1 byte or less, and the division information is used to make the heading information. By outputting the correspondence information with, the capacity of the headline information can be reduced.

According to the invention of claim 2, at the time of information retrieval,
By keeping the position of each piece of information in the compressed block in advance, when decompressing the information and decoding the forward reference, you do not have to perform the decompression process from the beginning of the block. It is only necessary to refer to the pointer and expand in information units, and high-speed processing can be performed.

[Brief description of drawings]

FIG. 1 is a block diagram of a dictionary search device embodying the present invention.

FIG. 2 is an external view of a dictionary search device embodying the present invention.

FIG. 3 is a diagram showing an operation example of a dictionary search device embodying the present invention.

FIG. 4 is a diagram showing the contents of a conventional dictionary.

FIG. 5 is a diagram showing a reference code for referencing a heading from a notation.

FIG. 6 is a flowchart of data processing.

FIG. 7 is a flowchart of a search process.

FIG. 8 is a diagram showing a heading of a conventional example.

FIG. 9 is a diagram showing an example in which headwords are also coded by forward reference.

FIG. 10 is a diagram showing an example when there is no division.

FIG. 11 is a diagram showing table contents of Chinese characters and their readings.

FIG. 12 is a block diagram showing a circuit configuration of a second embodiment.

FIG. 13 is a flowchart of data processing.

FIG. 14 is a flowchart of information search processing.

FIG. 15 is a flowchart of a pre-post search process.

FIG. 16 is an explanatory diagram of a data structure of a dictionary.

FIG. 17 is an explanatory diagram of a pointer storage buffer.

FIG. 18 is an explanatory diagram of encoding with forward reference.

FIG. 19 is a flowchart of an information search process according to another embodiment.

[Explanation of symbols]

 1, 51 keyboard 1a character input key 1b search key 2, 52 CPU 3, 53 RAM 3a, 53a input buffer 3b, 53b display buffer 4,54 ROM 4a, 54a program storage area 4b, 54b dictionary storage area 5, 55 display driver 6,56 indicator

Claims (2)

[Claims] 1. A dictionary search method for searching for a dictionary in which an entry word and information corresponding to the entry word are searched by the entry word, wherein the entry word written in the dictionary is divided.
A dictionary retrieval method characterized in that the bit information is represented by bit information of bits, and the bit information is added in advance to a character code corresponding to the position of the division in the character code forming the entry word. 2. A dictionary search method for searching a dictionary in which a headword and a plurality of pieces of information corresponding to the headword are compressed in units of one block by the headword, wherein the information of the compressed block in the search. The dictionary search method is characterized in that, when sequentially developing a plurality of the entry words and the information based on the above, the entry positions of the entry words and the information are stored.