JPH03257668A - Table retrieving system - Google Patents

Abstract

PURPOSE:To accelerate retrieval by providing an exclusive table, which is divided into the length of each word, in a word table and executing retrieval form the exclusive table corresponding to the length of the word. CONSTITUTION:A word input part 1 inputs a word to be the object of retrieval from a keyboard or the like and stores this word into an input buffer 2. A word analysis part 3 calculates the length of the word from the inputted word and decides the block of the word table to be retrieved from the length of the word. Namely, when the length of the word is one character, a one-character word table is decided, when the length of the word is two characters, a two- character word table is decided and when the length of the word is (n) characters, an (n)-character word table is decided. Therefore, a word table 4 prepares the exclusive tables for the respective lengths of these words. A word retrieval part 5 retrieves the exclusive table decided by the word analysis part 3 by binary search and a word judgement part 6 judges whether there is the inputted word in the exclusive table or not as the result of retrieval. Thus, the retrieval can be accelerated.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a table search method, and particularly to a table search method for searching for a specific word from a table storing a large number of words.

[Conventional technology]

Conventionally, in this type of table search method, all the words to be searched are stored in one table, and a specific word is usually found by performing a binary search on the table.

[Problem to be solved by the invention]

In the conventional table search method described above, all the words to be searched are stored in one table, so there is a problem that a large amount of search time is required when the number of words is very large.

[Means to solve the problem]

The table search method of the present invention is a table search method in which a specific word is searched from a table storing a large number of words. a word analysis unit for searching, a dedicated table of words classified according to the length of the word to be searched, and a word search unit that searches each of the dedicated tables according to the length of the input word; and a word determination unit that determines whether the input word is present in the dedicated table or not.

〔Example〕

Next, the present invention will be explained with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of the present invention, which includes a word input section 1, an input buffer 21, a word analysis section 31, a word table 4, a word search section 5
It is composed of a two-word judgment section 62 and a judgment result output section 7. A word input unit 1 inputs a word to be searched from a keyboard or the like, and stores this word in an input buffer 2. The word analysis unit 3 calculates the length of the input word, and determines the classification of the word table to be searched based on the length of the word. That is, if the word length is one character, there will be a one-letter word table, if the word length is two characters, there will be a two-letter word table, and if the word length is n characters, there will be an n-letter word table. The table is determined. For this reason, the word table 4 has dedicated tables for each length of these characters. The word search section 5 searches the dedicated table determined by the word analysis section 3 by binary search. As a result of the search, the word determination unit 6 determines whether or not there is a word input into the dedicated table. As a result of the judgment, the judgment result output unit 7 stores “1” in the result storage area if there is an input word.
If there is not, enter "O" and output the judgment result.

FIG. 2 is a flowchart of the process shown in FIG. 1, in which word table 4 is the dedicated table 1 shown in Table 1. Dedicated table 2. The processing flow will be explained by citing a specific example, assuming that the system has the following.

Table 1: Now, if the word “ABC” is input (step)
, the word analysis unit 3 analyzes this word to find the length and obtains three characters (step ■), and determines the dedicated table 3 to be used (step ■). The word search unit 5 searches for the word "ABC" from the dedicated table 3 of the word tables 4 (step ■)
. Since the corresponding word was found as a result of the search, the judgment result output section 7 is notified that it has been found, and the judgment result output section 7 enters "1'°" into the result storage area (steps ■, ■) and stores the judgment result. Output (step ■). Next, in step 1, write the word “
Assuming that "AB" is input, in step ■, two characters are obtained, and the word "AB" is searched from the dedicated table 2 to be used (step ■). As a result of the search, the corresponding word cannot be found, so it is difficult to judge. When the result output unit 7 is notified of this, the judgment result output unit 7 stores “0” in the result storage area.
(steps ■, ■) and move on to step ■.

〔Effect of the invention〕

As explained above, the present invention has a word table l: a dedicated table divided by word length, and searches are performed from the dedicated table corresponding to each word length, thereby speeding up the search. There is an effect.

FIG. 2 is a flow diagram of the process of FIG. 1;

1...Word input section, 2...Input buffer, 3...Word analysis section, 4...Word table,
5...Word detection unit, 6...Word judgment unit, 7
...Judgment result output section.

Claims (1)

[Claims] In a table search method that searches for a specific word from a table storing a large number of words, there is a word input section that inputs the word to be searched, a word analysis section that analyzes the input word to find the length of the word, and a word analysis section that analyzes the input word to find the length of the word. A dedicated table of words classified according to the length of the target word, a word search unit that searches each of the dedicated tables according to the length of the input word, and whether the input word is in the dedicated table or not. A table search method characterized by comprising a word judgment unit that judges whether a word exists or not.