| 摘要 |
PROBLEM TO BE SOLVED: To efficiently carry out processing when a plurality of searching key words are input. SOLUTION: If a relation between two input key words is an unambiguous relation wherein the two words are only directly and continuously used and another key word never exist between them, both key words are connected to be one key word. For example, if both a relation of "rainbow" to "tokyo" and a relation of "land" to "rainbow" are unambiguous relations, the respective input key words are connected to be a searching key word of "tokyorainbowland", by which candidates of the destination are searched. COPYRIGHT: (C)2010,JPO&INPIT |
