公开(公告)号：US20050060304A1

公开(公告)日：2005-03-17

申请号：US10940564

申请日：2004-09-14

申请人： Prashant Parikh

发明人： Prashant Parikh

IPC分类号： G06F7/00 ,  G06F17/21 ,  G06F17/30 ,  G09G5/00

CPC分类号： G06F17/30011 ,  G06F17/30625 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99936 ,  Y10S707/99942

摘要： A method performed in connection with an arrangement of nodes representable as a graph, and an inverted index containing a correlation among keywords and nodes such that at least some nodes containing a given keyword are indexed to that given keyword, involves receiving a word, searching the inverted index to determine whether the word is a keyword and, if the word is a keyword, jumping to a node identified in the inverted index as correlated to that keyword, otherwise, learning a meaning for the word based upon reaching a result node and applying at least one specified rule such that a new input containing the word can be received thereafter and the word from the new input will be treated according to the learned meaning.

摘要翻译： 一种与可表示为图形的节点的结构相关联的方法，以及包含关键字和节点之间的相关性的反向索引，使得至少包含给定关键字的节点被索引到该给定关键字，涉及接收单词，搜索 反转索引以确定该单词是否是关键字，并且如果该单词是关键字，则跳转到与该关键字相关的反向索引中标识的节点，否则，基于到达结果节点并应用来学习该单词的含义 至少一个指定的规则，使得可以在其后接收包含该单词的新输入，并且将根据所学习的含义处理来自新输入的单词。