{"title":"拉链:整体拼写检查","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":"{\"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}","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}
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.