ZIPPER: The holistic spell checker

L. Alhusaini
{"title":"ZIPPER: The holistic spell checker","authors":"L. Alhusaini","doi":"10.1109/ICAICT.2012.6398519","DOIUrl":null,"url":null,"abstract":"This article discusses a novel problem with a novel solution. The thesis of this work is to perform document and text editing. We look specifically at providing a document editor with a tool for text editing and that tool is holistic spell checker. We propose ZIPPER, a holistic spell checker, that finds out user misspell words all at once. Our approach to this approximated problem is probabilistic. We use Markovian tree that exploits the dependencies amongst characters in a word. For computation over Markovian tree, we use a set of probabilistic and information theory metrics. For link quantification, we use information theory metric which is pointwise mutual information. Probabilistically, we use belief propagation using message passing paradigm for node quantification. To create a suggestion list for each misspelled word, we decompose Markovian tree into clique tree. For computation over clique tree, where each node is a complete word, we use information theory metrics like: entropy for computing the value of a complete word, and mutual information for computing how much value there is between two words.","PeriodicalId":221511,"journal":{"name":"2012 6th International Conference on Application of Information and Communication Technologies (AICT)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 6th International Conference on Application of Information and Communication Technologies (AICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICT.2012.6398519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This article discusses a novel problem with a novel solution. The thesis of this work is to perform document and text editing. We look specifically at providing a document editor with a tool for text editing and that tool is holistic spell checker. We propose ZIPPER, a holistic spell checker, that finds out user misspell words all at once. Our approach to this approximated problem is probabilistic. We use Markovian tree that exploits the dependencies amongst characters in a word. For computation over Markovian tree, we use a set of probabilistic and information theory metrics. For link quantification, we use information theory metric which is pointwise mutual information. Probabilistically, we use belief propagation using message passing paradigm for node quantification. To create a suggestion list for each misspelled word, we decompose Markovian tree into clique tree. For computation over clique tree, where each node is a complete word, we use information theory metrics like: entropy for computing the value of a complete word, and mutual information for computing how much value there is between two words.
拉链:整体拼写检查
本文讨论了一个具有新颖解决方案的新颖问题。本工作的主要内容是文档和文本的编辑。我们特别着眼于为文档编辑器提供一个文本编辑工具,这个工具就是整体拼写检查器。我们提出ZIPPER,一个全面的拼写检查,发现用户拼写错误的单词一次。我们解决这个近似问题的方法是概率的。我们使用马尔可夫树来利用单词中字符之间的依赖关系。对于马尔可夫树的计算,我们使用了一组概率和信息论度量。对于链路的量化,我们采用点互信息的信息论度量。在概率上,我们使用消息传递范式的信念传播进行节点量化。为了给每个拼写错误的单词创建一个建议列表,我们将马尔可夫树分解为团树。对于团树的计算,每个节点都是一个完整的词,我们使用信息理论度量:熵用于计算一个完整词的值,互信息用于计算两个词之间的值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信