字母连接和字符映射算法

M. Saleem
{"title":"字母连接和字符映射算法","authors":"M. Saleem","doi":"10.1109/ICICT.2005.1598624","DOIUrl":null,"url":null,"abstract":"The theme behind this algorithm is to provide a technique that can be incorporated into a word processing application or a hybrid that allows the end user to write documents in languages which require alphabets to be joined together. This concept will be referred to as Letter Joining hereafter. Languages, the likes of Urdu, Hindi, Punjabi etc, have more than one type of image for a single alphabet. Consider for example the English alphabet 'B'. Its equivalent in the Urdu language is the letter pronounced as 'Bay'. 'Bay' has 4 forms that it can acquire in written Urdu. The first being when it is joined at the beginning of a word. The second being when it is joined in the middle of the word. The third being when it is joined at the end of a word and the last one being a standalone one. To know when to write which form of 'Bay' in a typed document is a complicated task and this is exactly what this algorithm is meant to accomplish. It will decide, based on the previous and next character, on which form of the alphabet it should reproduce.","PeriodicalId":276741,"journal":{"name":"2005 International Conference on Information and Communication Technologies","volume":"875 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A synopsis Letter joining and character mapping algorithm\",\"authors\":\"M. Saleem\",\"doi\":\"10.1109/ICICT.2005.1598624\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The theme behind this algorithm is to provide a technique that can be incorporated into a word processing application or a hybrid that allows the end user to write documents in languages which require alphabets to be joined together. This concept will be referred to as Letter Joining hereafter. Languages, the likes of Urdu, Hindi, Punjabi etc, have more than one type of image for a single alphabet. Consider for example the English alphabet 'B'. Its equivalent in the Urdu language is the letter pronounced as 'Bay'. 'Bay' has 4 forms that it can acquire in written Urdu. The first being when it is joined at the beginning of a word. The second being when it is joined in the middle of the word. The third being when it is joined at the end of a word and the last one being a standalone one. To know when to write which form of 'Bay' in a typed document is a complicated task and this is exactly what this algorithm is meant to accomplish. It will decide, based on the previous and next character, on which form of the alphabet it should reproduce.\",\"PeriodicalId\":276741,\"journal\":{\"name\":\"2005 International Conference on Information and Communication Technologies\",\"volume\":\"875 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 International Conference on Information and Communication Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICT.2005.1598624\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 International Conference on Information and Communication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICT.2005.1598624","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

该算法背后的主题是提供一种技术,可以合并到文字处理应用程序或混合应用程序中,允许最终用户使用需要将字母连接在一起的语言编写文档。这个概念以后将被称为字母连接。像乌尔都语、印地语、旁遮普语等语言,对于一个字母有不止一种类型的图像。以英语字母“B”为例。它在乌尔都语中的对应发音是“Bay”。“Bay”在乌尔都语中有四种形式。第一个是当它连接在单词的开头时。第二个是当它连接在单词的中间时。第三个是在单词的末尾连接,最后一个是独立的。要知道在键入的文档中何时写入哪种形式的“Bay”是一项复杂的任务,这正是该算法要完成的任务。它将根据前一个字符和下一个字符决定它应该复制哪种形式的字母表。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A synopsis Letter joining and character mapping algorithm
The theme behind this algorithm is to provide a technique that can be incorporated into a word processing application or a hybrid that allows the end user to write documents in languages which require alphabets to be joined together. This concept will be referred to as Letter Joining hereafter. Languages, the likes of Urdu, Hindi, Punjabi etc, have more than one type of image for a single alphabet. Consider for example the English alphabet 'B'. Its equivalent in the Urdu language is the letter pronounced as 'Bay'. 'Bay' has 4 forms that it can acquire in written Urdu. The first being when it is joined at the beginning of a word. The second being when it is joined in the middle of the word. The third being when it is joined at the end of a word and the last one being a standalone one. To know when to write which form of 'Bay' in a typed document is a complicated task and this is exactly what this algorithm is meant to accomplish. It will decide, based on the previous and next character, on which form of the alphabet it should reproduce.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信