| 摘要 |
PROBLEM TO BE SOLVED: To retrieve desired information with a high probability even when there is a simple input error when retrieving the information by inputting a character string to become a key. SOLUTION: Based on an input character string, a character string to become a candidate is extracted out of stored character strings, the lengths of both the input character string and each of candidate character strings are counted and in the case of the same length, the number of times of non-coincidence is detected by successively comparing characters from the end but in the case of the different lengths, when a non-coincident character is detected after successively comparing characters from the end, only concerning a short character string, characters thereof are compared again. At the time point when the comparison is completed concerning one character string, the number of times of non-coincidence, for which the number of times of re-comparison and the number of remaining characters are added, is detected, a character string candidate coincident with the input character string within an allowable range is determined on the basis of the detected number of times of non-coincidence, and information is retrieved with that candidate as a key.
|
