JPH05257981A - Information retrieving device - Google Patents

Abstract

PURPOSE:To obtain an information retrieving device capable of string many pieces of information in the same storage capacity by providing header information obtained by a retrieval means and a means outputting correspondence information after the complement is performed by a complementing means corresponding to the header information. CONSTITUTION:Each processing of a program 4a stored in a ROM 4 is executed in a CPU 2 composed of a microprocessor, etc., in accordance with the input, from a keyboard 1. The keyboard 1 is connected with the CPU 2 via an interface means. In a ROM 4, header information and a dictionary 4b storing the correspondence information are stored and the information of the dictionary 4b is retrieved by using a character string inputted from the keyboard 1. In a RAM 3, an input buffer and a display buffer expanding data to be displayed, etc., are provided. Thus, the size of the correspondence information to be preliminarily stored can be reduced and more correspondence information can be stored in a storage medium having the same size.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention
The present invention relates to an information retrieving device that retrieves headline information stored in advance in storage means and outputs the retrieved headline information and corresponding information to a predetermined output means.

[0002]

2. Description of the Related Art Conventionally, in information retrieval devices such as electronic dictionaries, heading information (keywords and headwords) and corresponding information (notation and meaning) are stored in a storage device, and headings are 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.

[0003]

However, in the conventional method, even though the headword has information overlapping with the notation as shown in FIG. 4, for example, the information is stored in the storage device as it is. Therefore, there is a problem that as the number of words increases, the useless capacity of the storage area also increases.

It is an object of the present invention to solve the above problems and to provide an information retrieval apparatus capable of storing a large amount of information with the same storage capacity while keeping unnecessary information as little as possible.

[0005]

In order to achieve the above object, the present invention is a storage means for storing a plurality of heading information and corresponding information corresponding to the heading information, and heading information in the storage means for responding to input information. Search means for searching for, the complementing means for referring to the heading information obtained by the searching means to complement the corresponding information corresponding to the heading information, and the heading information obtained by the searching means and the heading information Means for outputting the correspondence information after being complemented by the complementing means.

[0006]

According to the present invention, the correspondence information is complemented and output by referring to the heading information. According to this, the size of the correspondence information stored in advance can be reduced, so that more correspondence information can be stored in the storage medium of the same size.

[0007]

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

FIG. 1 shows a block diagram of an information retrieval apparatus adopting the present invention. In the figure, reference numeral 2 is a CPU including a microprocessor and the like, which executes each processing of the program 4a stored in the ROM 4 according to an input from the keyboard 1.

Here, the keyboard 1 is connected to the CPU 2 through the interface means. The ROM 4 stores a dictionary 4b that stores heading information and corresponding information, and the information in the dictionary 4b is searched using a character string input from the keyboard 1. The RAM 3 has an input buffer 3 for temporarily storing input data from the keyboard.
a, a display buffer 3b for expanding data to be displayed, etc. are provided.

The display 6 is an LCD panel or C
It is composed of an RT display and is driven by a display driver 5 under the control of the CPU 2.

FIG. 2 is an external view of the apparatus in this embodiment, and 1 and 6 are the keyboard 1 and the display 6 in FIG. 1, respectively. 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 using the keyboard and information retrieved using the character string is displayed on the display. 3- (a) shows the 3-
(B) shows that the input has been completed, 3- (c) shows that the search key has been pressed to search for the word "speak", and 3- (d) shows that the search key has been pressed again. It shows a state in which the word "Kotobetsu fart" is displayed.

5 to 6 show the contents of the dictionary 4b, in which data is stored in the heading and the notation. The "/" in the heading indicates the division information, and as shown in FIG. 3, it is necessary to read the information when the information is displayed. FIG. 5 shows an example in which all headings are stored in hiragana. By doing so, when comparing an input word and a headword, it is not necessary to perform hiragana conversion for the headword, so the comparison process is performed. It will be easy. FIG. 6 shows an example of the present invention, in which notations store codes that refer to headings.
"c1" indicates a hiragana reference, and "c2" is a code indicating a katakana reference (c1 = 01H and c2 = 02H).

FIG. 7 is a flow chart of data processing.
First, key input processing is performed in step S1, and step S2
Then, the key is discriminated, and the process proceeds to any one of steps S3, S4 and S5 according to the discrimination result, and then proceeds to step S6. In step S3, when an input word is input from the character input key 1a, a process of setting it in the input buffer 3a is performed, and in step S4, input in the input buffer 3a when the search key 1b of the keyboard 1 is input. The dictionary is searched for a word as shown in FIG. In step S5, processes other than S3 and S4 are performed. 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. 8 shows the search process in step S4 in detail. During steps S101 to S104, the comparison is repeated until the input word becomes equal to or larger than the headword (headword is found). That is, in S101, the input word and the headword are compared, and in S102, it is determined whether the input word is smaller than the headword. If it is smaller, in S103, the headword is advanced by one, and in S104, it is determined whether the headword ends. At the end, the error message is set in the display buffer in S116 and the process returns. If not completed, the process returns to S101. When the input word is equal to or larger than the entry word in step S102 and the entry word is found, step S10
In step 5, the headword found and its notation are set in the display buffer in a series of processes thereafter.

First, in step S105, the pointer is set (that is, the start address written in PTR1, P
(TR2 is set to the head address of each heading), and it is checked in step S106 whether or not the written character refers to the heading (in this case, the written code is 01H, 02H or other). If the headline is not referred to, the written character is a kanji character, so the character is set in the notation display buffer as it is in step S107. Then step S
In step 108, the headline (reading of kanji) corresponding to the kanji (that is, up to the break) is set in the headline display buffer. At this time, PTR2 is advanced as much as necessary. Next, in step S109, the written pointer is advanced by the code length of the Chinese character. When it is determined in step S106 that the notation refers to the headline, the process proceeds to step S110, and the reference is hiragana reference (01H) or katakana reference (02
H) or not. In the case of katakana reference, the headline is converted into katakana by a series of processes in steps S111 to S113. That is, the value of PTR2 is put in the pointer SPTR2 for katakana conversion in S111, and the SPT is entered in S112.
Convert headings to katakana up to the break with reference to R2
At 113, the value of SPTR2 is entered in PTR2. Next, the process proceeds to step S114, and headings are set in the notation display buffer until the end of sharing or the end. Step S
The pointer denoted by 115 is advanced by the reference code length, and S
Proceeding to 117, it is judged whether the display is over, and when it is over, the process returns. If not, the process returns to S106. By repeating the above-described series of processes until the notation is completed, the contents of the display as shown in FIG. 3 (however, in the figure, hiragana rather than katakana) are set. S110
If it is a hiragana reference, the process proceeds to S114.

[Other Embodiments] (1) When the head of a heading is the same as a written word that is two or more characters before, the data capacity can be reduced by having the heading coded. The present invention can be applied to such a case. Although an example is shown in FIG. 9, since "i / i / da / she / pe" is the same as the previous heading "i / isobiru" in the three characters from the beginning, it is encoded with the code F3H. .

(2) In FIG. 10 and FIG. 11, the heading is not stored in advance in the heading, the kanji reading table is referred to, the kanji is associated with the kana, and the reference code length is “c1”. -"CF" (c1 = 01H, c2 = 0)
2H, c3 = 03H, ... cF = 0FH), it is shown that the reference of the heading is realized from the notation by being coded and stored.

Explaining the complement to the notation, the notation "Suppai c1", "C2", which corresponds to the heading "Oiterute", starts with "Tsui" or "Tsui" from the correspondence table of Kanji and its reading in FIG. Since it is known that it is "o", it is understood that it is read up to "o" in the heading by comparing it with the heading. Next, “c1” indicates that it corresponds to one hiragana character, and indicates that the heading “i” is referenced. Similarly, it is understood that the reading “ta” is determined for the Chinese character “standing” and that the heading “ter” corresponds to “c2”.

As described above, even if the division is not stored, it is possible to refer to the heading from the notation by using the kanji reading table.

[0021]

As is apparent from the above, according to the present invention, the capacity of the correspondence information can be reduced by referring to and outputting the correspondence information from the correspondence information, and the correspondence information can be complemented from the correspondence information. Then, the output similar to that in the case where the data is duplicated can be obtained. That is, since more words can be stored in the storage medium having the same capacity, a product containing more words can be provided at a low cost.

[Brief description of drawings]

FIG. 1 is a block diagram of an apparatus according to an embodiment of the present invention.

FIG. 2 is an external view of the same device.

FIG. 3 is an example showing an operation example of the apparatus.

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

FIG. 5 is a diagram showing contents of a dictionary showing hiragana headings.

FIG. 6 is a diagram showing contents of a dictionary showing reference codes for referring to headings from notations.

FIG. 7 is a flowchart of data processing.

FIG. 8 is a flowchart of a search process.

FIG. 9 is a diagram showing the contents of a dictionary showing an example in which headwords are coded.

FIG. 10 is a diagram showing the contents of a dictionary showing an example when there is no division.

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

[Explanation of symbols]

 1 Keyboard 1a Character Input Key 1b Search Key 2 CPU 3 RAM 3a Input Buffer 3b Display Buffer 4 ROM 4a Program 4b Dictionary 5 Display Driver 6 Display

Claims (3)

[Claims] 1. A storage means for storing a plurality of headline information and corresponding information corresponding to the headline information, a search means for searching the headline information in the storage means in response to input information, and a search means obtained by the search means. Outputting the headline information obtained by the search means and the corresponding information after being complemented by the complementing means corresponding to the headline information by referring to the headline information An information retrieving apparatus having means. 2. The information retrieving apparatus according to claim 1, wherein the complementing unit complements the kana part with respect to the correspondence information. 3. The storage means stores heading information and correspondence information in which portions related to a Chinese character portion and a kana portion are associated with each other.
Information retrieval device described.