| 摘要 |
PROBLEM TO BE SOLVED: To provide a full text retrieval system by an N-gram, wherein restriction of the number of retrieval characters, delay of processing, and enlargement of an index database are improved. SOLUTION: This full text retrieval system has: an indexer part 2 generating a hash table having a hash key generated from a split character string of one character or above of text information and a hash value showing an address of data having the division character string at the head inside the index database, and the index database including an additional character string added with one or more succeeding characters in the text information to the division character string and an appearance position of the additional character string; a character string retrieval part retrieving the has value corresponding to the hash key, and retrieving the additional character string present in address data of the index database shown by the hash value; and a character string comparison calculation part 3 comparing identity of a retrieval target character string and the additional character string, and performing appearance position matching calculation of the additional character string. COPYRIGHT: (C)2007,JPO&INPIT
|
