{"title":"Ink-Link","authors":"A. El-Nasan, G. Nagy","doi":"10.1109/ICPR.2000.10018","DOIUrl":null,"url":null,"abstract":"Wide acceptance of inexpensive writing tablets with high functionality motivates the development of individualized, adaptive on-line recognition of cursive script. We demonstrate a lexical algorithm based on bigram matches. The solution we propose is to (i) Generate a match list by partial-word matching against a reference list in the owner's script. (ii) Identify each unknown word by eliminating, from a large lexicon, every word that partially matches the transcript of any word on the reference list that is not on the match list, or that fails to match any word on the match list. With perfect feature-level matching, a surprisingly short reference list yields a high recognition rate.","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"241 1","pages":"2573-2576"},"PeriodicalIF":0.0000,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Ink-Link\",\"authors\":\"A. El-Nasan, G. Nagy\",\"doi\":\"10.1109/ICPR.2000.10018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wide acceptance of inexpensive writing tablets with high functionality motivates the development of individualized, adaptive on-line recognition of cursive script. We demonstrate a lexical algorithm based on bigram matches. The solution we propose is to (i) Generate a match list by partial-word matching against a reference list in the owner's script. (ii) Identify each unknown word by eliminating, from a large lexicon, every word that partially matches the transcript of any word on the reference list that is not on the match list, or that fails to match any word on the match list. With perfect feature-level matching, a surprisingly short reference list yields a high recognition rate.\",\"PeriodicalId\":74516,\"journal\":{\"name\":\"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition\",\"volume\":\"241 1\",\"pages\":\"2573-2576\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.2000.10018\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2000.10018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

价格低廉、功能强大的书写平板的广泛接受,推动了草书个性化、自适应在线识别技术的发展。我们展示了一个基于双字匹配的词法算法。我们提出的解决方案是:(i)通过对所有者脚本中的引用列表进行部分单词匹配来生成匹配列表。(ii)通过从大型词典中剔除与参考列表中不在匹配列表上的单词的部分匹配,或与匹配列表中任何单词都不匹配的单词,来识别每个未知单词。通过完美的特征级匹配,短得惊人的参考列表产生了高识别率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Ink-Link
Wide acceptance of inexpensive writing tablets with high functionality motivates the development of individualized, adaptive on-line recognition of cursive script. We demonstrate a lexical algorithm based on bigram matches. The solution we propose is to (i) Generate a match list by partial-word matching against a reference list in the owner's script. (ii) Identify each unknown word by eliminating, from a large lexicon, every word that partially matches the transcript of any word on the reference list that is not on the match list, or that fails to match any word on the match list. With perfect feature-level matching, a surprisingly short reference list yields a high recognition rate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.70
自引率
0.00%
发文量
0
期刊最新文献
Complexity of Representations in Deep Learning Extraction of Ruler Markings For Estimating Physical Size of Oral Lesions. TensorMixup Data Augmentation Method for Fully Automatic Brain Tumor Segmentation Classifying Breast Histopathology Images with a Ductal Instance-Oriented Pipeline. Directionally Paired Principal Component Analysis for Bivariate Estimation Problems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1