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

1. 发明授权

US06879718B2 Efficient method and system for determining parameters in computerized recognition 有权
标题翻译：用于确定计算机识别参数的有效方法和系统
公开(公告)号：US06879718B2
公开(公告)日：2005-04-12
申请号：US09993077
申请日：2001-11-06
申请人： Gregory N. Hullender
发明人： Gregory N. Hullender
IPC分类号： G06K9/62 , G06K9/68 , G06K9/00
CPC分类号： G06K9/6293
摘要： In computerized recognition having multiple experts, a method and system is described that obtains an optimum value for an expert tuning parameter in a single pass over sample tuning data. Each tuning sample is applied to two experts, resulting in scores from which ranges of parameters that correct incorrect recognition errors without changing correct results for that sample are determined. To determine the range data for a given sample, the experts return scores for each prototype in a database, the scores separated into matching and non-matching scores. The matching and non-matching scores from each expert are compared, providing upper and lower bounds defining ranges. Maxima and minima histograms track upper and lower bound range data, respectively. An analysis of the histograms based on the full set of tuning samples provides the optimum value. For tuning multiple parameters, each parameter may be optimized by this method in isolation, and then iterated.
摘要翻译：在具有多个专家的计算机识别中，描述了在单次通过采样调谐数据中获得专家调谐参数的最佳值的方法和系统。每个调整样本都应用于两位专家，从而确定在不改变该样本的正确结果的情况下校正不正确识别错误的参数范围。要确定给定样本的范围数据，专家会在数据库中返回每个原型的分数，分数分为匹配和非匹配分数。比较来自每个专家的匹配和不匹配得分，提供上限和下限定义范围。最大值和最小直方图分别跟踪上限和下限范围数据。基于整套调谐样本的直方图分析提供了最佳值。为了调整多个参数，每个参数可以通过隔离的方法进行优化，然后迭代。

2. 发明授权

US07818332B2 Query speller 有权
标题翻译：查询拼写器
公开(公告)号：US07818332B2
公开(公告)日：2010-10-19
申请号：US11465023
申请日：2006-08-16
申请人： Elliott K. Olds , Gregory N. Hullender , Haoyong Zhang , Janine R. Crumb , Jianfeng Gao , Ming Zhou , Mu Li , Yajuan Lv
发明人： Elliott K. Olds , Gregory N. Hullender , Haoyong Zhang , Janine R. Crumb , Jianfeng Gao , Ming Zhou , Mu Li , Yajuan Lv
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/3064
摘要： Candidate suggestions for correcting misspelled query terms input into a search application are automatically generated. A score for each candidate suggestion can be generated using a first decoding pass and paths through the suggestions can be ranked in a second decoding pass. Candidate suggestions can be generated based on typographical errors, phonetic mistakes and/or compounding mistakes. Furthermore, a ranking model can be developed to rank candidate suggestions to be presented to a user.
摘要翻译：自动生成用于纠正输入到搜索应用程序中的拼错查询条件的候选建议。可以使用第一解码通道来生成每个候选建议的得分，并且通过建议的路径可以被排列在第二解码通行证中。可以根据印刷错误，语音错误和/或复合错误生成候选建议。此外，可以开发排名模型来排列要呈现给用户的候选建议。

3. 发明授权

US07428530B2 Dispersing search engine results by using page category information 有权
标题翻译：使用页面类别信息分散搜索引擎结果
公开(公告)号：US07428530B2
公开(公告)日：2008-09-23
申请号：US10883460
申请日：2004-07-01
申请人： Bama Ramarathnam , Gregory N. Hullender , Darren A. Shakib , Nicole A. Hamilton
发明人： Bama Ramarathnam , Gregory N. Hullender , Darren A. Shakib , Nicole A. Hamilton
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99932 , Y10S707/99933 , Y10S707/99937
摘要： Systems and methods for dispersing search engine results by category. A search engine application queries a searchable index of document data associated with a plurality of electronic documents in response to a search request to identify one or more electronic documents having document data matching data included in the search request. The search engine application disperses identified electronic documents according to category data included in the document data for display to a user.
摘要翻译：按类别分散搜索引擎结果的系统和方法。搜索引擎应用程序响应于搜索请求查询与多个电子文档相关联的文档数据的可搜索索引，以识别具有包括在搜索请求中的文档数据匹配数据的一个或多个电子文档。搜索引擎应用根据包括在文档数据中的类别数据来分散所识别的电子文档以供用户显示。

4. 发明授权

US07379597B2 Method and mechanism to reduce handwriting recognizer errors using multiple decision trees 失效
标题翻译：使用多个决策树来减少手写识别器错误的方法和机制
公开(公告)号：US07379597B2
公开(公告)日：2008-05-27
申请号：US11294260
申请日：2005-12-05
申请人： Gregory N. Hullender , John R. Bennett , Patrick M. Haluptzok
发明人： Gregory N. Hullender , John R. Bennett , Patrick M. Haluptzok
IPC分类号： G06K9/00 , G06K9/68 , G06F3/042
CPC分类号： G06K9/6292 , G06K9/00416 , G06K9/00429
摘要： An improved method and mechanism for recognizing chirographs (handwritten characters) input into a computer system. A primary recognizer is provided for converting chirographs to code points, and secondary recognizers such as binary CART trees are developed and trained to differentiate chirographs which produce certain code points at the primary recognizer. Each such secondary recognizer is associated with each selected code point. When a chirograph is received, the chirograph is provided to the primary recognizer whereby a code point corresponding thereto is received. If the code point corresponds to one of the secondary recognizers, the chirograph is passed to the secondary recognizer, and a code point is returned from the secondary recognizer. If not, the code point provided by the primary recognizer is returned. The invention sets forth an automated process for training the CART trees and for optimizing the recognition mechanism by discarding CART trees which do not improve on the recognition accuracy of the primary recognizer.
摘要翻译：用于识别输入到计算机系统中的手写字符（手写字符）的改进方法和机制。提供用于将手迹转换为码点的主要识别器，并且开发和训练诸如二进制CART树的二次识别器以区分在一次识别器处产生某些代码点的手迹。每个这样的二次识别器与每个选择的代码点相关联。当接收到手迹时，将手迹提供给主识别器，从而接收对应于其的码点。如果代码点对应于二级识别器中的一个，则将手迹传递到二次识别器，并从次级识别器返回代码点。如果没有，则返回由主识别器提供的代码点。本发明提出了一种用于训练CART树的自动化过程，并且通过丢弃不能提高主识别器的识别精度的CART树来优化识别机制。

5. 发明授权

US06675169B1 Method and system for attaching information to words of a trie 有权
公开(公告)号：US06675169B1
公开(公告)日：2004-01-06
申请号：US09390182
申请日：1999-09-07
申请人： John R. Bennett , Gregory N. Hullender , Donald D. Karlov
发明人： John R. Bennett , Gregory N. Hullender , Donald D. Karlov
IPC分类号： G06F1700
CPC分类号： G06F17/30958 , G06F17/30625 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99942 , Y10S707/99944
摘要： A method and improved data structure for attaching information to words in a trie of nodes. Each node of a trie includes a single tag bit which is interpreted according to information specified in a header of the trie. The information may specify that a node may be tagged with multiple tags, whereby if the tag bit is set in a given node, the node further includes a bitmask indicating which one or ones of the tags apply to that node. A value mask may be provided in the header indicating which of the tags (if any) have values associated therewith, whereby information representative of the value such as the value itself or a pointer thereto is stored in each node tagged with at least one tag having an associated value. Partial enumeration of tagged nodes may be provided by storing a count of the number of tagged words under a node, wherein if a trie has multiple tags, each tag may be selectively and separately enumerated as specified in header information. Partial enumeration may be combined with global enumeration of each word, with multiple tags, and/or with tags that have associated values.

6. 发明授权

US06418239B1 Method and mechanism for providing partial results in full context handwriting recognition 有权
标题翻译：在全面的手写识别中提供部分结果的方法和机制
公开(公告)号：US06418239B1
公开(公告)日：2002-07-09
申请号：US09572668
申请日：2000-05-16
申请人： Gregory N. Hullender , Patrick M. Haluptzok
发明人： Gregory N. Hullender , Patrick M. Haluptzok
IPC分类号： G06K900
CPC分类号： G06K9/00879
摘要： A method and mechanism for displaying partial results of full context handwriting recognition. As handwritten characters are entered into a system, a shape matcher associates the character with a plurality of alternate code points, with each alternate code point having probability information associated therewith. The alternate code points are placed at the end of a queue, and a cost is determined from each alternate code point to any immediately preceding alternate in the queue. The cost is based on the probability information of the alternates and a transition cost therebetween. Then, the lowest cost path back from each of the alternates at the end of the queue to an alternate at the beginning of the queue is determined. If each lowest cost path back converges to a common alternate in the queue, the common alternate and any previous alternates on the path back are recognized as the code points for each of the handwritten characters associated therewith. Because further context cannot affect change the value of these code points, the alternates corresponding to these code points are removed from the queue, and the code points appropriately displayed on a screen as recognized characters, to allow editing thereof. The ability to provide partial results with no loss of accuracy may be extended to include the case where the language model is an arbitrarily complex non-determinsitic state machine including the case where the state machine may be generated from a dictionary.
摘要翻译：一种用于显示完整上下文手写识别部分结果的方法和机制。随着手写字符被输入到系统中，形状匹配器将字符与多个替代代码点相关联，每个替代代码点具有与其相关联的概率信息。替代代码点被放置在队列的末尾，并且从每个替代代码点确定队列中任何紧接在前的备选项的成本。成本基于替代品的概率信息和它们之间的转换成本。然后，确定从队列结束处的每个备选项返回到队列开始处的替代的最低成本路径。如果每个最低成本路径返回收敛到队列中的公共备用，则路径返回上的公共备用和任何先前的交替节点被识别为与其相关联的每个手写字符的代码点。由于进一步的上下文不能影响改变这些代码点的值，所以与队列中的这些代码点相对应的替代物被从队列中移除，并且代码点被适当地显示在屏幕上作为识别的字符，以允许其编辑。可以扩展提供部分结果而不损失精度的能力，包括语言模型是任意复杂的非确定性状态机的情况，包括可以从字典生成状态机的情况。

7. 发明授权

US06304878B1 Method and system for improved enumeration of tries 有权
标题翻译：改进计数计数的方法和系统
公开(公告)号：US06304878B1
公开(公告)日：2001-10-16
申请号：US09199949
申请日：1998-11-23
申请人： Donald D. Karlov , Gregory N. Hullender , John R. Bennett
发明人： Donald D. Karlov , Gregory N. Hullender , John R. Bennett
IPC分类号： G06F1700
CPC分类号： G06F17/30625 , Y10S707/99933 , Y10S707/99943
摘要： A method and system for enumerating a trie of states of nodes. A node near the middle of a state of alphabetically ordered nodes is selected as a skip node and moved to the logical beginning of the state. The skip node is provided with a pointer to a jump node that is at the skip node's former position, and the node immediately to the left of the node's former position is marked as a soft terminal node. As a result of the alphabetic ordering, the segment of nodes before the jump node are alphabetically before the skip node, while the segment of nodes after the jump node are alphabetically after the skip node. The segments of the state may be recursively split into further segments via further skip nodes, jump nodes and soft terminal nodes, and, once the segments are split as desired, the nodes within the segment may be sorted. When searching the state, if a skip node is reached that does not equal the search character, the search moves to the jump node if the search character is greater than the skip node, or to the next node if the search character is less than the skip node. The search of the nodes continues, essentially as a binary search when skip nodes are encountered, and a linear search otherwise, until a node is found that matches the search character or a soft or regular terminal node is reached.
摘要翻译：一种枚举节点状态特征的方法和系统。按字母排序节点状态附近的节点被选择为跳过节点并移动到状态的逻辑开头。跳过节点具有指向跳过节点之前的位置的跳转节点的指针，并且紧邻节点之前位置左侧的节点被标记为软终端节点。作为字母排序的结果，跳过节点之前的节点的段按照跳过节点之前的字母顺序排列，跳过节点之后的节点段按照跳过节点之后的字母顺序排列。状态的段可以经由进一步的跳过节点，跳跃节点和软终端节点被递归地分割成进一步的分段，并且一旦分段根据需要被分割，则可以对分段内的节点进行排序。当搜索状态时，如果到达不等于搜索字符的跳过节点，如果搜索字符大于跳过节点，则搜索移动到跳转节点，如果搜索字符小于搜索字符，搜索移动到下一个节点跳过节点。当遇到跳过节点时，节点的搜索基本上作为二进制搜索，否则直接找到与搜索字符匹配的节点或达到软或正常终端节点的节点。

8. 发明授权

US08868471B1 Evaluation of task judging results 有权
标题翻译：评估任务评估结果
公开(公告)号：US08868471B1
公开(公告)日：2014-10-21
申请号：US13239275
申请日：2011-09-21
申请人： Gregory N. Hullender
发明人： Gregory N. Hullender
IPC分类号： G06F17/10 , G06F9/00 , G05B11/00 , G05B17/00
CPC分类号： G06K9/00671 , G06Q10/101
摘要： Embodiments of systems and methods can determine evaluations of the quality of task results provided by judges. Certain embodiments can determine the quality evaluations with relatively little overlap of judges (e.g., two or three judges). The quality evaluations may include determining an error rate or a confidence index for a judge or for a particular judgment made by the judge. Certain embodiments may determine the quality evaluations by intercomparing judging results from multiple judges without requiring human intervention, comparison to evaluation data known (or assumed) to be accurate, or input from an external judge review panel. In some implementations, task results can be combined with a confidence score (based at least in part on the quality evaluation of the judge who provided the task result), and this information can be used as training data to improve performance of machine learning algorithms.
摘要翻译：系统和方法的实施例可以确定法官提供的任务结果的质量评估。某些实施例可以用相对较少的法官重叠（例如，两名或三名法官）来确定质量评估。质量评估可能包括确定法官的错误率或信心指数或法官作出的特定判断。某些实施例可以通过不需要人为干预来比较来自多个判断的判断结果来确定质量评估，与已知（或假设）准确的评估数据进行比较，或者从外部评估审查小组输入。在一些实现中，任务结果可以与置信度分数相结合（至少部分地基于提供任务结果的判断者的质量评估），并且该信息可以用作训练数据以改善机器学习算法的性能。

9. 发明授权

US07181067B2 Efficient method and system for determining parameters in computerized recognition 有权
标题翻译：用于确定计算机识别参数的有效方法和系统
公开(公告)号：US07181067B2
公开(公告)日：2007-02-20
申请号：US11050392
申请日：2005-02-02
申请人： Gregory N. Hullender
发明人： Gregory N. Hullender
IPC分类号： G06K9/00
CPC分类号： G06K9/6293
摘要： In computerized recognition having multiple experts, a method and system is described that obtains an optimum value for an expert tuning parameter in a single pass over sample tuning data. Each tuning sample is applied to two experts, resulting in scores from which ranges of parameters that correct incorrect recognition errors without changing correct results for that sample are determined. To determine the range data for a given sample, the experts return scores for each prototype in a database, the scores separated into matching and non-matching scores. The matching and non-matching scores from each expert are compared, providing upper and lower bounds defining ranges. Maxima and minima histograms track upper and lower bound range data, respectively. An analysis of the histograms based on the full set of tuning samples provides the optimum value. For tuning multiple parameters, each parameter may be optimized by this method in isolation, and then iterated.
摘要翻译：在具有多个专家的计算机识别中，描述了在单次通过采样调谐数据中获得专家调谐参数的最佳值的方法和系统。每个调整样本都应用于两位专家，从而确定在不改变该样本的正确结果的情况下校正不正确识别错误的参数范围。要确定给定样本的范围数据，专家会在数据库中返回每个原型的分数，分数分为匹配和非匹配分数。比较来自每个专家的匹配和不匹配得分，提供上限和下限定义范围。最大值和最小直方图分别跟踪上限和下限范围数据。基于整套调谐样本的直方图分析提供了最佳值。为了调整多个参数，每个参数可以通过隔离的方法进行优化，然后迭代。

10. 发明授权

US6094506A Automatic generation of probability tables for handwriting recognition systems 失效
标题翻译：自动生成手写识别系统的概率表
公开(公告)号：US6094506A
公开(公告)日：2000-07-25
申请号：US548261
申请日：1995-10-25
申请人： Gregory N. Hullender
发明人： Gregory N. Hullender
IPC分类号： G06K9/62 , G06K9/18 , G06K9/46
CPC分类号： G06K9/6217 , G06K9/6256
摘要： A computer system and method for generating probability tables for use in recognizing handwritten characters. The system receives handwritten characters as a sequence of strokes. The system characterizes each stroke by its shape and position. The position is represented as a pair of coordinates specifying the starting and ending points of the stroke. The system represents an input handwritten character by a string representing the shapes of the strokes and by a string of the pairs of coordinates of the strokes. The strings are ordered by the sequence in which the strokes are written. The system compares all possible pairs of a large sample of handwritten characters one to another by comparing the shape and position of each stroke in one character with those of the corresponding stroke of the other character. When comparing the two strokes, the system generates a pair of shapes and the sum of the squared distances between the starting points and the ending points of the two strokes. Based on these comparisons, the system generates the probabilities that any two handwritten characters that have the same number of strokes and that have a certain pair of shapes in the same relative place in their strings will represent the same character and that any two handwritten characters that have the same number of strokes and that have a pair of positions in the same relative place in their corresponding strings such that the sum of distances between the pair of positions is a certain distance, will represent the same character.
摘要翻译：用于生成用于识别手写字符的概率表的计算机系统和方法。系统接收手写字符作为笔画序列。该系统通过其形状和位置来表征每个行程。位置表示为一对坐标，指定笔画的起点和终点。系统通过表示笔画的形状的字符串和笔画的坐标对的字符串表示输入的手写字符。字符串按照写入笔画的顺序排序。该系统通过将一个字符中的每个笔画的形状和位置与另一个字符的相应笔画的形状和位置进行比较，将手写字符的大样本之间的所有可能对相互比较。当比较两个笔画时，系统生成一对形状，并且两个笔画的起始点和终点之间的平方距离之和。基于这些比较，系统生成概率，任何两个具有相同笔划数量的手写字符并且在其字符串中的相同相对位置中具有一定形状的表示相同的字符，并且任何两个手写字符具有相同数量的笔画，并且在其相应的字符串中具有相同相对位置的一对位置，使得该对位置之间的距离之和为一定距离，将代表相同的字符。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式