JPH10105578A - Similar word retrieving method utilizing point - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an algorithm for enabling access to required information only with known information when a user does not know the exact name of an object to be retrieved. SOLUTION: This similar word retrieving method utilizing point is composed of a stage for inputting an input key to be retrieved to an input part 10 while utilizing an input device, stage for calculating the point of a comparison object word by matching the input key with the comparison object word stocked in a stock part 13 through a calculation part 11, stage for sorting the comparison object words, of which the points are calculated in the calculation stage, by point rankings at the calculation part 11, and stage for displaying the sorted words by point rankings at an output part 12. Then, when constructing a data base, the point is applied for the unit of spelling or syllable in data and data are displayed in order from the highest point so that the exact input key can be retrieved.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a similar word search method, and more particularly to a similar word search using a score for assigning a score to a database and searching for information according to the level of data in the database with respect to an input key. It is about the method.

[0002]

2. Description of the Related Art At present, as the importance of information is recognized worldwide, almost all information is stored in a database. An information user accesses these databases to extract necessary information. I have. Also, various algorithms are used to efficiently extract various information stored in these databases.

[0003]

A conventional information database search method employs a tree structure as a basic method. Since this method allows the user to access the desired information through various steps, it takes a lot of time to access the information, and it is necessary to know the exact position of the desired information on the tree. Because of this, various problems occur in access to information.

If a tree structure access method with a jump function such as "go KBS" is used to make up for this problem, necessary information can be quickly accessed. However, this method has a problem that when applied to a telephone directory service, the user must know the name of the destination accurately. That is, the telephone number guide service can search for the telephone number desired by the user if the user knows the exact name of the person he is trying to find. Many

[Outside 1]

[0005] Accordingly, the present invention provides an algorithm that allows a user to access necessary information with only known information even when the user does not know the exact name of the object to be searched. With the goal.

[0006]

To achieve the above object, according to the present invention, there is provided a similar word search method using a score, comprising the steps of: inputting an input key to be searched using an input device; Calculating a score of the comparison target word by matching the comparison target word stored in the storage unit; sorting the comparison target words whose scores have been calculated in the calculation step according to a score ranking; and sorting the sorted words. Are displayed for each score order.

According to the method of the present invention, when constructing a database, data is displayed in the order in which the highest score is obtained by giving a score to each spelling unit or syllable unit, thereby searching for an accurate input key. You can do it.

The present invention has been proposed to solve the problem of erroneous input that may occur when input keys are used in information retrieval and the problem of input keys that occur when various abbreviations of the same object or object are used. It is a method. For example,

[Outside 2]

The above and other objects, features and advantages will become more apparent through the following detailed description in conjunction with the accompanying drawings.

[0010]

Embodiments of the present invention will be described below in detail with reference to the drawings. FIG. 1 is a block diagram of an apparatus for implementing a similar word search method according to the present invention.
The device according to FIG. 1 operates as follows. That is, after data is input to the input unit (10) by an input device such as a keyboard, the calculation unit (11) performs matching for all possible methods of the comparison target word of the input data, and performs the matching of the comparison target word. After calculating the points, the points are sorted in descending order of the points and displayed on the output unit (12). Calculation unit (11)
The comparison target word used in (1) is fetched from the storage unit (13). In the storage unit (13), the data in the database is stored in a state where a score is already given according to the importance.

[Outside 3]

FIG. 2 shows an embodiment according to the present invention. FIG. 2 shows that the constructed database is 3
It is a figure showing the search algorithm state order for calculating a score when there are two states. In this embodiment,
When constructing a database, a score is given for each state (S1, S2, S3). At this time, the score of each state can be separately given according to the importance of the state. In such a situation, the score for this input key is compared from the left to the right as shown in FIG. 2 and the state of the database is compared with the state of the input key. In such a case, the scores are summed up and sorted in order from the one having the highest score among the various scores finally issued.

[Outside 4]

FIG. 5 is a diagram showing a state order of a search algorithm when an attempt is made to search for the word "KOREA" in English as yet another embodiment according to the present invention. In the case of English sentences, a database is constructed by giving points in English alphabet units. Searcher changes input key to "COREA"
"KOREA" will be displayed even if you mistakenly enter
There is a high probability that a point is obtained and displayed as an accurate input key.

FIG. 6 is a diagram showing a state order of a search algorithm when a search is made for an English sentence "International Business Machine" according to yet another embodiment of the present invention. Generally, the English sentence is more widely known as "IBM" and it is presumed that few people know the exact name. Also in this case, according to the similar word search method using the score of the present invention, "IBM
"Is selected as shown in FIG.
When building the "European Business Machine" in the database, give 10 points to important alphabets such as "I", "B", and "M", and give a very small point to the rest. Thus, an accurate input key can be searched using only the abbreviation without knowing the exact name of the search target.

In the similar word search method using scores according to the present invention, a certain time is required for input key and database matching, but the performance of a computer is also rapidly improving due to rapid development of technology. Therefore, it is possible to solve the problem of speed associated with such matching.

The preferred embodiments of the present invention disclose an example, and those skilled in the art can make various modifications, changes, additions, etc. within the spirit and scope of the present invention. Modifications and the like should be considered as belonging to the appended claims.

[0016]

As described above, the present invention uses an input key when searching for all database information in order to assist the user in accessing necessary information using only information and terms known to the user himself / herself. It can be used in the field of information and communication industry, for example, when an error in a word (character group or word group) is corrected by a spelling method using a computer word processor.

[Brief description of the drawings]

FIG. 1 is a block diagram of an apparatus for implementing a similar word search method according to the present invention.

FIG. 2 is a diagram showing a search algorithm state sequence of three characters according to the present invention.

FIG. 3 is a diagram showing a search algorithm state order of eight Korean characters (Korea Telecommunications Corporation) based on the present invention.

FIG. 4 is based on the state sequence diagram of FIG. 3;

[Outside 5]

FIG. 5 is a diagram showing five letters (KORE) according to the present invention.
FIG. 4A is a diagram showing a state order of the search algorithm of FIG.

FIG. 6 is a diagram illustrating the English language “International” according to the present invention;
FIG. 21 is a diagram showing a state order of a search algorithm of “Business Machine”.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 10 Input part 11 Calculation part 12 Output part 13 Storage part

Claims (1)

[Claims] A step of inputting an input key to be searched using an input device; and a step of calculating a score of the comparison target word by matching the input key with a comparison target word stored in a storage unit. A similar word search method using a score, comprising: sorting the words to be compared whose scores have been calculated in the calculation step according to the score ranking; and displaying the sorted words according to the score ranking.