SIMILARITY COMPUTING METHOD, SIMILARITY COMPUTING PROGRAM, AND COMPUTER-READABLE STORAGE MEDIUM STORING IT

摘要

PROBLEM TO BE SOLVED: To dynamically and efficiently find similarity matching context in information search. SOLUTION: A CPU (processing unit) inputs a search query from a main storage part or an input part (S201), performs graph creation processing for graphic expression (S203), and stores it (S205). The processing unit finds a solution candidate f represented by a partial function from a set of node and link of the query Q to a set of node and link of a database D (S206). The processing unit adds a label to the node or the link of the query Q according to a thesaurus T to create a search query Q' (S207) and finds a solution candidate f' (S209). The processing unit finds a solution candidate score s(f') serving as a real value showing goodness of the candidate f' as the solution candidate (S211) and finds context similarity S(x, L) in the context between an existing label of the node or the link in the query Q and other labels L (S213). The processing unit stores the S(x, L) in a storage part (S215) and displays it in a display part (S217). COPYRIGHT: (C)2005,JPO&NCIPI