A multidimensional partitioning scheme for developing English to Bangla dictionary

K. M. Azharul Hasan, Esmot Ara, F. Hoque, Jenifar Yasmin
{"title":"A multidimensional partitioning scheme for developing English to Bangla dictionary","authors":"K. M. Azharul Hasan, Esmot Ara, F. Hoque, Jenifar Yasmin","doi":"10.1109/ICCITECHN.2010.5723835","DOIUrl":null,"url":null,"abstract":"In this paper we describe a multidimensional implementation scheme for developing English to Bangla dictionary using multidimensional Array. We have converted the string into an integer key and partitioned the keys based on number of letters a word. Multidimensional arrays are good to store dense data. It is hard to use multidimensional array for sparse data. We have compressed the sparse multidimensional array by computing the offset value. We found good results for storage and retrieval costs. Our proposed model is explained with sufficient example and performance analysis is described with experimental results. The proposed scheme shows superiority over traditional schemes.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2010.5723835","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we describe a multidimensional implementation scheme for developing English to Bangla dictionary using multidimensional Array. We have converted the string into an integer key and partitioned the keys based on number of letters a word. Multidimensional arrays are good to store dense data. It is hard to use multidimensional array for sparse data. We have compressed the sparse multidimensional array by computing the offset value. We found good results for storage and retrieval costs. Our proposed model is explained with sufficient example and performance analysis is described with experimental results. The proposed scheme shows superiority over traditional schemes.
一种开发英孟词典的多维划分方案
本文描述了一种利用多维数组开发英汉语词典的多维实现方案。我们将字符串转换为整数键,并根据单词的字母数对键进行分区。多维数组适合存储密集数据。对于稀疏数据,使用多维数组是很困难的。我们通过计算偏移值来压缩稀疏多维数组。我们发现了存储和检索成本的良好结果。用充分的实例说明了所提出的模型,并用实验结果进行了性能分析。该方案与传统方案相比具有明显的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信