专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07013264B2 System and method for matching a textual input to a lexical knowledge based and for utilizing results of that match 失效
标题翻译：用于将文本输入与基于词汇知识相匹配并用于利用该匹配的结果的系统和方法
公开(公告)号：US07013264B2
公开(公告)日：2006-03-14
申请号：US10977910
申请日：2004-10-29
申请人： William B. Dolan , Michael Barnett , Stephen D. Richardson , Arul A. Menezes , Lucretia H. Vanderwende
发明人： William B. Dolan , Michael Barnett , Stephen D. Richardson , Arul A. Menezes , Lucretia H. Vanderwende
IPC分类号： G06F17/30
CPC分类号： G06F17/30684 , G06F17/271 , G06F17/277 , G06F17/2785 , Y10S707/99932 , Y10S707/99935
摘要： The present invention can be used in a natural language processing system to determine a relationship (such as similarity in meaning) between two textual segments. The relationship can be identified or determined based on logical graphs generated from the textual segments. A relationship between first and second logical graphs is determined. This is accomplished regardless of whether there is an exact match between the first and second logical graphs. In one embodiment, the first graph represents an input textual discourse unit. The second graph, in one embodiment, represents information in a lexical knowledge base (LKB). The input graph can be matched against the second graph, if they have similar meaning, even if the two differ lexically or structurally.
摘要翻译：本发明可以用于自然语言处理系统中以确定两个文本段之间的关系（诸如意义上的相似性）。可以基于从文本段生成的逻辑图来识别或确定关系。确定第一和第二逻辑图之间的关系。无论第一个和第二个逻辑图之间是否存在精确的匹配，这是完成的。在一个实施例中，第一图表示输入的文本话语单元。在一个实施例中，第二个图表示词汇知识库（LKB）中的信息。输入图可以与第二个图匹配，如果它们具有相似的含义，即使两者在词汇或结构上不同。

2. 发明授权

US6161084A Information retrieval utilizing semantic representation of text by identifying hypernyms and indexing multiple tokenized semantic structures to a same passage of text 有权
标题翻译：信息检索利用文本的语义表示，通过识别多义词，并将多个标记语义结构索引到同一段文本
公开(公告)号：US6161084A
公开(公告)日：2000-12-12
申请号：US366499
申请日：1999-08-03
申请人： John J. Messerly , George E. Heidorn , Stephen D. Richardson , William B. Dolan , Karen Jensen
发明人： John J. Messerly , George E. Heidorn , Stephen D. Richardson , William B. Dolan , Karen Jensen
IPC分类号： G06F17/27 , G06F17/30
CPC分类号： G06F17/30684 , G06F17/271 , G06F17/277 , G06F17/2785 , Y10S707/99932 , Y10S707/99935
摘要： The present invention is directed to performing information retrieval utilizing semantic representation of text. In a preferred embodiment, a tokenizer generates from an input string information retrieval tokens that characterize the semantic relationship expressed in the input string. The tokenizer first creates from the input string a primary logical form characterizing a semantic relationship between selected words in the input string. The tokenizer then identifies hypernyms that each have an "is a" relationship with one of the selected words in the input string. The tokenizer then constructs from the primary logical form one or more alternative logical forms. The tokenizer constructs each alternative logical form by, for each of one or more of the selected words in the input string, replacing the selected word in the primary logical form with an identified hypernym of the selected word. Finally, the tokenizer generates tokens representing both the primary logical form and the alternative logical forms. The tokenizer is preferably used to generate tokens for both constructing an index representing target documents and processing a query against that index.
摘要翻译：本发明旨在利用文本的语义表示来执行信息检索。在优选实施例中，标记器从输入字符串生成表征输入字符串中表达的语义关系的信息检索令牌。标记器首先从输入字符串创建表示输入字符串中所选择的单词之间的语义关系的主逻辑形式。然后，标记器识别每个与输入字符串中所选择的一个字符之间具有“是”关系的超文本。然后，标记器从主逻辑形式构造一个或多个替代的逻辑形式。令牌化器通过输入字符串中的一个或多个所选择的单词中的每个替换逻辑形式来构造每个备选逻辑形式，用所选择的单词的所识别的超级词替换主逻辑形式中的所选择的单词。最后，tokenizer生成表示主逻辑表单和替代逻辑表单的令牌。令牌化器优选地用于生成用于构建表示目标文档的索引并针对该索引处理查询的令牌。

3. 发明授权

US6098033A Determining similarity between words 失效
标题翻译：确定单词之间的相似性
公开(公告)号：US6098033A
公开(公告)日：2000-08-01
申请号：US904223
申请日：1997-07-31
申请人： Stephen D. Richardson , William B. Dolan
发明人： Stephen D. Richardson , William B. Dolan
IPC分类号： G06F17/27
CPC分类号： G06F17/277 , G06F17/2785
摘要： The present invention provides a facility for determining similarity between two input words utilizing the frequencies with which path patterns occurring between the words occur between words known to be synonyms. A preferred embodiment of the facility utilizes a training phase and a similarity determination phase. In the training phase, the facility first identifies, for a number of pairs of synonyms, the most salient semantic relation paths between each pair of synonyms. The facility then extracts from these semantic relation paths their path patterns, which each comprise a series of directional relation types. The number of times that each path pattern occurs between pairs of synonyms, called the frequency of the path pattern, is counted. In the training phase, the facility identifies the most salient semantic relation paths between the input words, and extracts their path patterns. The facility then averages the frequencies counted in the training phase for the path patterns extracted for the input words in order to obtain a quantitative measure of the similarity between the input words.
摘要翻译：本发明提供了一种用于确定两个输入词之间的相似性的设施，该两个输入字利用在已知是同义词的单词之间出现的词之间出现的路径模式的频率。设施的优选实施例利用训练阶段和相似性确定阶段。在训练阶段，设施首先识别多对同义词，即每对同义词之间最突出的语义关系路径。然后，该设施从这些语义关系路径中提取它们的路径模式，每个路径模式包括一系列方向关系类型。计算每个路径模式发生在同义词对之间的次数，称为路径模式的频率。在训练阶段，设备识别输入单词之间最突出的语义关系路径，并提取其路径模式。然后，该设施对为训练阶段计数的针对输入词提取的路径模式的频率进行平均，以便获得输入单词之间的相似性的定量测量。

4. 发明授权

US07383169B1 Method and system for compiling a lexical knowledge base 失效
标题翻译：使用后向链接自然语言处理编译词汇知识库的方法和系统
公开(公告)号：US07383169B1
公开(公告)日：2008-06-03
申请号：US08227247
申请日：1994-04-13
申请人： Lucretia H. Vanderwende , Stephen D. Richardson , Karen Jensen , George E. Heidorn , William B. Dolan
发明人： Lucretia H. Vanderwende , Stephen D. Richardson , Karen Jensen , George E. Heidorn , William B. Dolan
IPC分类号： G06F17/27
CPC分类号： G06F17/2785
摘要： A lexical knowledge base is compiled automatically from a machine-readable source (such as an on-line dictionary or unstructured text). The preferred embodiment of the invention makes use of “backward linking,” by which inverse semantic relations are discerned from the text and used to augment the knowledge base. By this arrangement, on-line dictionaries and other texts can provide formidable sources of “common sense” knowledge about the world.
摘要翻译：词汇知识库从机器可读源（例如在线字典或非结构化文本）自动编译。本发明的优选实施例利用“反向链接”，通过该反向语义关系从文本中辨别并用于增加知识库。通过这种安排，在线词典和其他文本可以为世界提供强大的“常识”知识来源。

5. 发明授权

US07206735B2 Scaleable machine translation 有权
标题翻译：可扩展机器翻译
公开(公告)号：US07206735B2
公开(公告)日：2007-04-17
申请号：US11291741
申请日：2005-12-01
申请人： Aurl A. Menezes , Stephen D. Richardson , Jessie E. Pinkman , William B. Dolan
发明人： Aurl A. Menezes , Stephen D. Richardson , Jessie E. Pinkman , William B. Dolan
IPC分类号： G06F17/28
CPC分类号： G06F17/2872 , G06F17/2827
摘要： A method translates a textual input in a first language to a textual output in a second language. An input logical form is generated based on the textual input. When a plurality of transfer mappings in a transfer mapping database match the input logical form (or at least a portion thereof) one or more of those plurality of matching transfer mappings is selected based on a predetermined metric. Textual output is generated based on the selected transfer logical form.
摘要翻译：一种方法将第一语言的文本输入转换为第二语言的文本输出。基于文本输入生成输入逻辑表单。当传输映射数据库中的多个传输映射与输入逻辑形式（或其至少一部分）匹配时，基于预定度量来选择那些多个匹配传输映射中的一个或多个。基于选择的传输逻辑形式生成文本输出。

6. 发明授权

US07050964B2 Scaleable machine translation system 有权
公开(公告)号：US07050964B2
公开(公告)日：2006-05-23
申请号：US09899755
申请日：2001-07-05
申请人： Arul A. Menzes , Stephen D. Richardson , Jessie E. Pinkham , William B. Dolan
发明人： Arul A. Menzes , Stephen D. Richardson , Jessie E. Pinkham , William B. Dolan
IPC分类号： G06F17/28 , G06F17/21
CPC分类号： G06F17/2872 , G06F17/2827
摘要： A computer implemented method translates a textual input in a first language to a textual output in a second language. An input logical form is generated based on the textual input. When a plurality of transfer mappings in a transfer mapping database match the input logical form (or at least a portion thereof) one or more of those plurality of matching transfer mappings is selected based on a predetermined metric. Textual output is generated based on the selected transfer logical form.

7. 发明授权

US06871174B1 System and method for matching a textual input to a lexical knowledge base and for utilizing results of that match 有权
标题翻译：用于将文本输入与词汇知识库进行匹配并利用该匹配的结果的系统和方法
公开(公告)号：US06871174B1
公开(公告)日：2005-03-22
申请号：US09572765
申请日：2000-05-17
申请人： William B. Dolan , Michael Barnett , Stephen D. Richardson , Arul A. Menezes , Lucretia H. Vanderwende
发明人： William B. Dolan , Michael Barnett , Stephen D. Richardson , Arul A. Menezes , Lucretia H. Vanderwende
IPC分类号： G06F17/27 , G06F17/30 , G06F15/62
CPC分类号： G06F17/30684 , G06F17/271 , G06F17/277 , G06F17/2785 , Y10S707/99932 , Y10S707/99935
摘要： The present invention can be used in a natural language processing system to determine a relationship (such as similarity in meaning) between two textual segments. The relationship can be identified or determined based on logical graphs generated from the textual segments. A relationship between first and second logical graphs is determined. This is accomplished regardless of whether there is an exact match between the first and second logical graphs. In one embodiment, the first graph represents an input textual discourse unit. The second graph, in one embodiment, represents information in a lexical knowledge base (LKB). The input graph can be matched against the second graph, if they have similar meaning, even if the two differ lexically or structurally.
摘要翻译：本发明可以用于自然语言处理系统中以确定两个文本段之间的关系（诸如意义上的相似性）。可以基于从文本段生成的逻辑图来识别或确定关系。确定第一和第二逻辑图之间的关系。无论第一个和第二个逻辑图之间是否存在精确的匹配，这是完成的。在一个实施例中，第一图表示输入文本话语单元。在一个实施例中，第二个图表示词汇知识库（LKB）中的信息。输入图可以与第二个图匹配，如果它们具有相似的含义，即使两者在词汇或结构上不同。

8. 发明授权

US06246977B1 Information retrieval utilizing semantic representation of text and based on constrained expansion of query words 有权
标题翻译：使用文本的语义表示并基于查询词的约束扩展的信息检索
公开(公告)号：US06246977B1
公开(公告)日：2001-06-12
申请号：US09368071
申请日：1999-08-03
申请人： John J. Messerly , George E. Heidorn , Stephen D. Richardson , William B. Dolan , Karen Jensen
发明人： John J. Messerly , George E. Heidorn , Stephen D. Richardson , William B. Dolan , Karen Jensen
IPC分类号： G06F1727
CPC分类号： G06F17/30684 , G06F17/271 , G06F17/277 , G06F17/2785 , Y10S707/99932 , Y10S707/99935
摘要： The present invention is directed to performing information retrieval utilizing semantic representation of text. In a preferred embodiment, a tokenizer generates from an input string information retrieval tokens that characterize the semantic relationship expressed in the input string. The tokenizer first creates from the input string a primary logical form characterizing a semantic relationship between selected words in the input string. The tokenizer then identifies hypemyms that each have an “is a” relationship with one of the selected words in the input string. The tokenizer then constructs from the primary logical form one or more alternative logical forms. The tokenizer constructs each alternative logical form by, for each of one or more of the selected words in the input string, replacing the selected word in the primary logical form with an identified hypernym of the selected word. Finally, the tokenizer generates tokens representing both the primary logical form and the alternative logical forms. The tokenizer is preferably used to generate tokens for both constructing an index representing target documents and processing a query against that index.
摘要翻译：本发明旨在利用文本的语义表示来执行信息检索。在优选实施例中，标记器从输入字符串生成表征输入字符串中表达的语义关系的信息检索令牌。标记器首先从输入字符串创建表示输入字符串中所选择的单词之间的语义关系的主逻辑形式。然后，标记器识别每个与输入字符串中所选择的一个字符之间具有“是”关系的次要词。然后，标记器从主逻辑形式构造一个或多个替代的逻辑形式。令牌化器通过输入字符串中的一个或多个所选择的单词中的每个替换逻辑形式来构造每个备选逻辑形式，用所选择的单词的所识别的超级词替换主逻辑形式中的所选择的单词。最后，tokenizer生成表示主逻辑表单和替代逻辑表单的令牌。令牌化器优选地用于生成用于构建表示目标文档的索引并针对该索引处理查询的令牌。

9. 发明授权

US6076051A Information retrieval utilizing semantic representation of text 失效
标题翻译：利用文本语义表示的信息检索
公开(公告)号：US6076051A
公开(公告)日：2000-06-13
申请号：US886814
申请日：1997-03-07
申请人： John J. Messerly , George E. Heidorn , Stephen D. Richardson , William B. Dolan , Karen Jensen
发明人： John J. Messerly , George E. Heidorn , Stephen D. Richardson , William B. Dolan , Karen Jensen
IPC分类号： G06F17/27 , G06F17/30
CPC分类号： G06F17/30684 , G06F17/271 , G06F17/277 , G06F17/2785 , Y10S707/99932 , Y10S707/99935
摘要： The present invention is directed to performing information retrieval utilizing semantic representation of text. In a preferred embodiment, a tokenizer generates from an input string information retrieval tokens that characterize the semantic relationship expressed in the input string. The tokenizer first creates from the input string a primary logical form characterizing a semantic relationship between selected words in the input string. The tokenizer then identifies hypernyms that each have an "is a" relationship with one of the selected words in the input string. The tokenizer then constructs from the primary logical form one or more alternative logical forms. The tokenizer constructs each alternative logical form by, for each of one or more of the selected words in the input string, replacing the selected word in the primary logical form with an identified hypernym of the selected word. Finally, the tokenizer generates tokens representing both the primary logical form and the alternative logical forms. The tokenizer is preferably used to generate tokens for both constructing an index representing target documents and processing a query against that index.
摘要翻译：本发明旨在利用文本的语义表示来执行信息检索。在优选实施例中，标记器从输入字符串生成表征输入字符串中表达的语义关系的信息检索令牌。标记器首先从输入字符串创建表示输入字符串中所选择的单词之间的语义关系的主逻辑形式。然后，标记器识别每个与输入字符串中所选择的一个字符之间具有“是”关系的超文本。然后，标记器从主逻辑形式构造一个或多个替代的逻辑形式。令牌化器通过输入字符串中的一个或多个所选择的单词中的每个替换逻辑形式来构造每个备选逻辑形式，用所选择的单词的所识别的超级词替换主逻辑形式中的所选择的单词。最后，tokenizer生成表示主逻辑表单和替代逻辑表单的令牌。令牌化器优选地用于生成用于构建表示目标文档的索引并针对该索引处理查询的令牌。

10. 发明授权

US06070134A Identifying salient semantic relation paths between two words 失效
标题翻译：识别两个词之间的突出语义关系路径
公开(公告)号：US06070134A
公开(公告)日：2000-05-30
申请号：US904418
申请日：1997-07-31
申请人： Stephen D. Richardson , William B. Dolan
发明人： Stephen D. Richardson , William B. Dolan
IPC分类号： G06F17/30
CPC分类号： G06F17/30734
摘要： The present invention identifies salient semantic relation paths between two words using a knowledge base. For a group of semantic relations occurring in the knowledge base, the facility models with a mathematical function the relation between a frequency of occurrence of unique semantic relations and the number of unique semantic relations that occur at that frequency. This mathematical function has a vertex frequency identifying a transition point in the mathematical function. The facility then determines the level of salience of unique semantic relations of the group such that the level of salience of unique semantic relations increases with the frequency of occurrence of the unique semantic relations approaches the vertex frequency of the mathematical function with which the relation between the frequency of occurrence of the unique semantic relations and the number of unique semantic relations occurring at that frequency is modeled. The facility is then able to determine the level of salience of a particular path between two words by combining the levels of salience determined for the semantic relations in the path.
摘要翻译：本发明使用知识库识别两个词之间的突出语义关系路径。对于在知识库中发生的一组语义关系，设备模型具有数学函数，即唯一语义关系的发生频率与在该频率发生的唯一语义关系的数量之间的关系。该数学函数具有标识数学函数中的转变点的顶点频率。该设备然后确定该组的唯一语义关系的显着性水平，使得独特语义关系的显着性水平随着独特语义关系的出现频率而增加接近数学函数的顶点频率，建立了唯一语义关系的发生频率和在该频率发生的唯一语义关系的数量。然后，该设施能够通过组合为路径中的语义关系确定的显着性水平来确定两个单词之间的特定路径的显着性水平。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式