发明名称 Spell-check for a keyboard system with automatic correction
摘要 User input is received, specifying a continuous traced path across a keyboard presented on a touch sensitive display. An input sequence is resolved, including traced keys and auxiliary keys proximate to the traced keys by prescribed criteria. For each of one or more candidate entries of a prescribed vocabulary, a set-edit-distance metric is computed between said input sequence and the candidate entry. Various rules specify when penalties are imposed, or not, in computing the set-edit-distance metric. Candidate entries are ranked and displayed according to the computed metric.
申请公布号 US8892996(B2) 申请公布日期 2014.11.18
申请号 US201213538658 申请日期 2012.06.29
申请人 Nuance Communications, Inc. 发明人 Unruh Erland
分类号 G06F17/00;G06F17/21;G09G5/00;G06F3/023;G06F3/0488;G06F17/27 主分类号 G06F17/00
代理机构 Perkins Coie LLP 代理人 Glenn Michael A.;Perkins Coie LLP
主权项 1. A method, comprising operations of: receiving user input specifying a continuous traced path across a keyboard presented on a touch sensitive display; resolving an input sequence of traced keys and auxiliary keys proximate to the traced keys by prescribed criteria; for each of one or more candidate entries of a prescribed vocabulary, computing a set-edit-distance metric between said input sequence and the candidate entry; where: the set-edit-distance computation imposes a penalty for omitting from the candidate entry all keys from a first group comprising a start key of the path and auxiliary keys to the start key;the set-edit-distance computation imposes a penalty for omitting from the candidate entry all keys from a second group comprising an end key of the path and auxiliary keys to the end key;the set-edit-distance computation imposes a penalty for omitting from the candidate entry all keys from a third group comprising any traced keys and their auxiliaries where at least a prescribed minimum change in direction of the path occurs;the set-edit-distance computation does not impose any penalty for omitting from the candidate entry any key of the input sequence outside all of the first, second, and third groups; andthe set-edit-distance computation does not impose any penalty the candidate entry using any key in the input sequence twice or more in succession; and ranking candidate entries according to the computed set-edit-distance metrics, and displaying an output of some or all of the ranked candidate entries; where at least one of the operations is performed by a processor.
地址 Burlington MA US