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.