JPH01303522A - Data retrieving method - Google Patents

Abstract

PURPOSE:To take the desired data out of a data base by processing a retrieval key with use of a dictionary having the same concept as a word dictionary in case an input retrieval key is not coincident with a word of the word dictionary and retrieving the data base with the processed retrieval key. CONSTITUTION:A retrieval key is compared with a word in a word dictionary memory 20. When no coincidence is obtained from this comparison, the spelling of the word is corrected by the substitution or replacement of spellings so that the coincidence is obtained between the retrieval key and the word of the memory 20. In case an exact word (retrieval key) is unknown, a homonym or another word having the same concept as the relevant one is inputted to an information processor as a retrieval key. The information processor calls successively the homonyms of the retrieval key or the words of the same concept with use of a homonym dictionary memory 22 and a same concept dictionary memory 24 and compares these called words with the words in the memory 20. Thus the information processor obtains a correct retrieval key and retrieves a data base. As a result, the desired data is surely obtained.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a data retrieval method for retrieving data contained in a database.

[Conventional technology]

Databases LL have become indispensable in today's information society because they allow a large amount of data to be classified and filed according to various purposes, and the data in the files can be easily retrieved as needed. When retrieving data from a database, when a search key or combination of multiple search keys that matches a word in the search target data is input into the information processing device, the information processing device uses the search key or combination of multiple search keys. Users can search the database by searching the database, find the corresponding search target data, and retrieve the desired data.

[Problem to be solved by the invention]

However, with conventional data search methods, if the search key input to the information processing device does not completely match the search target data or a part of it, the search target data cannot be found, and the required data cannot be found. could not be taken out. Therefore, for example, if there is a spelling error in the entered search key word, or if the operator does not remember the exact word in the search target data, there is a problem that the desired data cannot be obtained. Ta.

The present invention has been made in order to eliminate the drawbacks of the prior art, and is a data search method that allows desired data to be retrieved even when the input search key does not completely match a word in the search target data. is intended to provide.

[Means to solve the problem]

In order to achieve the above object, there is provided a data search method according to the present invention, in which a search key is input into an information processing device, a database is searched, and data corresponding to the input search key is retrieved. The input search key is compared with the word stored in the word dictionary in the information processing device, and if the two do not match, the information processing device stores the word dictionary, synonym dictionary, and same concept dictionary in the information processing device. The present invention is characterized in that the search key is processed using the above-described search key, and the database is searched using the processed search key.

[Effect]

According to the present invention configured as described above, the same word as a search key for searching data in a database is registered in the word dictionary in the information processing device, and the search key input to the information processing device is used in the word dictionary. If the two match, the database is searched as is.If the two do not match, the spelling is corrected by replacing or exchanging the spelling, and the search key is found in the word dictionary. - Search the database by the failed search key.

On the other hand, if the operator does not know the exact word (search key) in the search target data, input a synonym or a word with the same concept into the information processing device as the search key.
# The information processing device uses the built-in synonym dictionary and same concept dictionary to call out synonyms or words with the same concept of the input search key one after another, compares these with the words in the word dictionary, and finds the correct word. Find the search key and search the database.

Therefore, the search key you entered may be misspelled, or
Even if the operator does not know the exact search key, desired data can be reliably obtained.

〔Example〕

A preferred embodiment of the data search method according to the present invention will be described in detail with reference to the accompanying drawings.

FIG. 4 is a block configuration diagram of an information processing device for implementing the data search method according to the present invention.

In FIG. 4, the information processing device is a central processing unit (CP
U) 10 is connected via a bus 12 to an input word ff 14 consisting of a keyboard, an output device 16 such as a CRT display or a printer, and a database 18 stored in an external storage device. A word dictionary memo 1J20 in which the same word as the search key is registered, a synonym dictionary memory 22 storing synonyms of various words and words with the same concept, a concept dictionary memory 24, and a program for the work executed by the CPU 10. An instruction memory 26 containing an instruction memory 26 and a working memory 26 into which inputted search keys, words in the word dictionary memory 20, etc. are written are connected.

For example, the operator wants to obtain data with the search key "rtrolley", but since the operator does not know the search key, he tries to search database 18 by selecting rcarJ as the search key based on the concept of r car J. . However, when the operator should input rcarJ,
Suppose you accidentally typed ``rcaf''.

At this time, the CPU 10 receives the ``rcaf'' from the input device 14.
is input and an instruction to start the search is received (step 30 in FIG. 1). According to the program in the infrastructure memory 26, the input ``rcaf'' is used as an input key and the data is stored in the working memory 28 as shown in FIG. At the same time as writing, the word is displayed on the display of the output bag W16.Next, the CPU 10 searches the word dictionary in the word dictionary memory 20, and searches the word dictionary to see if there is the input ``rcaf''. The spelling of the key is checked (step 31). If there is no spelling error as a result of the spell checking, the process proceeds from step 32 to step 39, where the database 18 is searched and the corresponding data is read out, and the output device 1
Output to 6.

On the other hand, if the entered search key does not match the word in the word dictionary, the process proceeds from step 32 to step 33, where the spelling is corrected. Replace with text (Figure 2 Step 3
31) Write the search key with the replaced characters in the spelling correction tank of the working memory 28 as shown in FIG. 5, and display it on the display. After that, CPUl0 searches the word dictionary to check whether the correction is correct (step 332.3
33), if the corrected search key is incorrect, determine whether all character replacements have been completed (step 334); if not, step 331)
Return to If the corrected search key is correct, the process proceeds to step 34 in FIG.

If the correct search key cannot be obtained even after all characters have been replaced, the process proceeds from step 334 to step 335, in which adjacent characters are replaced, written to the working memory 28, and displayed on the display. It is determined whether the word dictionary is searched and the search key is correct (steps 336 and 337). If the search key is correct, the process proceeds to step 34 in Figure 1. If the search key is not correct, all The characters are exchanged with each other (step 3.38), and the process returns to step 34 in FIG.

If the search key is spelled correctly in the spelling correction process, CPU10 searches the database 18 and reads out the data (step 34.39). If this is not possible, search the synonym dictionary in the synonym dictionary memory 22 and make corrections using synonyms (step 35, FIG. 3).
That is, the CPU 10 checks whether or not there is a synonym for the input key -rcaf,1 in the synonym dictionary, and if there is a synonym, writes it to the synonym in the working memory 28 and displays it on the display. , and also checks whether the word is also included in the word dictionary (steps 351, 352, and 353 in Figure 3). If the word obtained by searching the synonym dictionary matches the word in the word dictionary, is the first
Proceeding to step 36 in the figure, the database 18 is searched (step 39). If there is no match, the next synonym is read out and similarly checked to see if it is the correct search key (steps 354, 351 to 353).

In this way, if the correct search key cannot be obtained even after completing the correction using synonyms for "rcaf", the first spelling corrected word "raaf" is read out from step 355) and step 356. Step 3
Go back to 51 and search the synonym dictionary for that word,
Determine whether the correct search key was obtained. Then, if the correct search key is not obtained even though the correction work using synonyms has been completed for all the words written in the input key and spelling correction tank of the working memory 28, the CPU 10 The process proceeds from step 36 to step 37 in FIG. 1 to perform correction based on the same concept. This correction based on the same concept is performed using the same concept dictionary in the concept dictionary memory 24 in substantially the same manner as the correction based on synonyms. The LT, CPU10, calls up the same concept words of rcarJ in the spelling correction tank of the working memory 28 one after another,
rtrolley" and searches the database 18.

In this way, according to the embodiment, even if the operator misspells the search key or does not know the exact word in the target search data, the operator can input synonyms or words with the same concept. By doing so, desired data can be easily retrieved.

〔Effect of the invention〕

As described above, according to the present invention, desired data can be retrieved from a database even if a search key is misspelled or the user does not know the correct search key.

[Brief explanation of the drawing]

FIG. 1 is a flowchart of a data retrieval method according to an embodiment of the present invention, FIG. 2 is a flowchart of a spelling correction operation in the embodiment, FIG. 3 is a flowchart of a synonym correction operation in the embodiment, and FIG. 5 is a block configuration diagram of an information processing apparatus for executing the embodiment, and FIG. 5 is a diagram showing an example of a method of writing to a working memory. 10...CPU, 1B---Database, 20---Word dictionary memory, 22
・−・・Synonym dictionary memory, 24 ・−・−・Concept dictionary memory. Agent Patent Attorney Tomo Murakami - Figure 2 Figure 3

Claims (1)

[Claims] (1) In a data search method in which a search key is input into an information processing device to search a database and retrieve data corresponding to the input search key, the input search key is entered into a word dictionary in the information processing device. When the two words do not match, the information processing device processes the search key using a word dictionary, a synonym dictionary, and a same concept dictionary in the information processing device. A data search method, characterized in that the database is searched using a search key.