| 摘要 |
When searching a database in a database data processing system, the input search data is broken down into elements, 31. Selected elements are converted to terms, such as phonetically encoded Soundex terms, which can only have a finite set of possible values, 33, each representing various pronunciations and spellings of similar sounding words. The terms are compared, 35, against an inverted database index of terms, 39, to determine which database records relate to - i.e. either closely or exactly match - the input search data. Through statistical analysis, 36, match records are given a record weight which may be used to calculate how closely the input data actually is to each match record, 37. Extremely large databases can be searched quickly and efficiently, without requiring precise input search data entry. The invention may also be used to compare or supplement one database against another.
|
