Text recognizer and method using non-cumulative character scoring in a forward search
    2.
    发明公开
    Text recognizer and method using non-cumulative character scoring in a forward search 审中-公开
    在向前搜索使用非累积等级标记文字识别装置和方法

    公开(公告)号:EP0953933A3

    公开(公告)日:2001-01-24

    申请号:EP99108289.2

    申请日:1999-04-28

    申请人: MOTOROLA, INC.

    IPC分类号: G06K9/68 G06K9/00

    CPC分类号: G06K9/00879

    摘要: In a method of recognition of handwritten input, a preprocessing module (200) of a recognizer (203) having a recognition module (202), segments handwritten input into strokes, to provide stroke vectors. A search module (204) generates hypothetical character strings for scoring by the recognition module (202). A character hypothesis is generated which is a data set of a character, a start vector and an end vector. The recognizer (203) provides a non-cumulative score for the character hypothesis, where the score represents a likelihood of the character being present in the handwritten input at a position starting at the start vector and ending at the end vector. The recognizer (203) delivers to the search module a result that is either the score for the selected first character hypothesis or a result that allows the search module to temporarily ignore the hypothesis or to kill it altogether. The search module maintains or disregards the first hypothetical character string dependent on the result. The process is repeated for other character hypotheses and other hypothetical character strings.

    Diacritical processing for unconstrained, on-line handwriting recognition using a forward search
    3.
    发明公开
    Diacritical processing for unconstrained, on-line handwriting recognition using a forward search 有权
    处理的区别标记使用前向搜索在胁迫下手写认识到如果不能写

    公开(公告)号:EP0944020A3

    公开(公告)日:2002-05-29

    申请号:EP99105383.6

    申请日:1999-03-16

    申请人: MOTOROLA, INC.

    IPC分类号: G06K9/22

    CPC分类号: G06K9/00865 G06K9/00416

    摘要: Handwritten ink is scanned to identify potential diacriticals. A list of diacriticals (19) is generated by traversing the ink. Potential diacritical-containing characters are processed by scoring them with and without a diacritical to generate a first and second score. The first score is compared to the second score to in order to make a decision as to which variant of the potential diacritical-containing character produced a highest score. The highest score is used as a score for a theory and the decision is recorded. A data structure (50) is added to the theory. Each data unit in the data structure (50) corresponds to an entry in the list of diacriticals (19). As a new theory is created by propagation, contents of the data structure (50) are copied into the new theory. Thus, the data structure (50) is used to ensure that all handwritten ink is used and is used only once.

    Text recognizer and method using non-cumulative character scoring in a forward search
    4.
    发明公开
    Text recognizer and method using non-cumulative character scoring in a forward search 审中-公开
    在向前搜索使用非累积等级标记文字识别装置和方法

    公开(公告)号:EP0953933A2

    公开(公告)日:1999-11-03

    申请号:EP99108289.2

    申请日:1999-04-28

    申请人: MOTOROLA, INC.

    IPC分类号: G06K9/68

    CPC分类号: G06K9/00879

    摘要: In a method of recognition of handwritten input, a preprocessing module (200) of a recognizer (203) having a recognition module (202), segments handwritten input into strokes, to provide stroke vectors. A search module (204) generates hypothetical character strings for scoring by the recognition module (202). A character hypothesis is generated which is a data set of a character, a start vector and an end vector. The recognizer (203) provides a non-cumulative score for the character hypothesis, where the score represents a likelihood of the character being present in the handwritten input at a position starting at the start vector and ending at the end vector. The recognizer (203) delivers to the search module a result that is either the score for the selected first character hypothesis or a result that allows the search module to temporarily ignore the hypothesis or to kill it altogether. The search module maintains or disregards the first hypothetical character string dependent on the result. The process is repeated for other character hypotheses and other hypothetical character strings.

    摘要翻译: 在识别手写体输入的方法,一个识别器(203),其具有识别模块(202)段输入手写笔划入,的一个预处理模块(200),以提供笔划向量。 搜索模块(204)基因利率假设的字符串进行打分由识别模块(202)。 字符假设是所有这是一个字符,在开始矢量和结束矢量的数据集生成的。 识别器(203)提供对字符假设,其中分数darstellt字符存在于手写输入的位置处开始在开始矢量和结束矢量结束的可能性的非累积得分。 识别器(203)传送到搜索模块的结果所做的是无论是分数所选firstCharacter假设或结果确实允许搜索模块暂时忽略的假设或完全杀死它。 搜索模块保持或忽略第一个假设的字符串依赖的结果。 该过程被重复使用其它字符假设和其他假设的字符串。

    Diacritical processing for unconstrained, on-line handwriting recognition using a forward search
    5.
    发明公开
    Diacritical processing for unconstrained, on-line handwriting recognition using a forward search 有权
    处理的区别标记使用前向搜索在胁迫下手写认识到如果不能写

    公开(公告)号:EP0944020A2

    公开(公告)日:1999-09-22

    申请号:EP99105383.6

    申请日:1999-03-16

    申请人: MOTOROLA, INC.

    IPC分类号: G06K9/22

    CPC分类号: G06K9/00865 G06K9/00416

    摘要: Handwritten ink is scanned to identify potential diacriticals. A list of diacriticals (19) is generated by traversing the ink. Potential diacritical-containing characters are processed by scoring them with and without a diacritical to generate a first and second score. The first score is compared to the second score to in order to make a decision as to which variant of the potential diacritical-containing character produced a highest score. The highest score is used as a score for a theory and the decision is recorded. A data structure (50) is added to the theory. Each data unit in the data structure (50) corresponds to an entry in the list of diacriticals (19). As a new theory is created by propagation, contents of the data structure (50) are copied into the new theory. Thus, the data structure (50) is used to ensure that all handwritten ink is used and is used only once.

    摘要翻译: 手写墨水被扫描以确定潜在的变音符号。 是通过遍历墨水产生发音符号的列表(19)。 潜在含有变音字符是由具有和不具有变音得分它们,以产生第一和第二得分处理。 第一得分相比于第二得分,以便作出决定的潜在含有变音字符是哪个变种产生了最高分。 得分最高的是作为一种理论的分数和判决记录。 的数据结构(50)被添加到理论。 在该数据结构(50)的每个数据单元对应于发音符号的列表(19)中的条目。 作为一个新的理论是由繁殖而产生,该数据结构(50)的内容被复制到新的理论。 因此,所述数据结构(50)被用来确保完成了所有的手写墨水被使用并且只使用一次。