Maaheer Amaeer, K. Hasan, Md. Ashiq Mahmood, Piyal Shuvro, Abdul Awal
{"title":"一种高效的16位Unicode转换孟加拉语自然文本压缩方案","authors":"Maaheer Amaeer, K. Hasan, Md. Ashiq Mahmood, Piyal Shuvro, Abdul Awal","doi":"10.1109/ICIET48527.2019.9290703","DOIUrl":null,"url":null,"abstract":"Text compression is an important area of research for natural language processing community. Due to huge number of characters in Unicode, it takes 16 bits to manage the total codes. Each of the language has a block of codes. We describe a technique to compress the 16 bit Unicode Bangla natural text along with English characters by 8-bit encoding. The encoding and decoding schemes consist of two steps. In step1 we replace some frequently used Bangla phrases with the extended ASCII characters and in the second step we assign the ASCII characters by an 8-bit binary value. We create a bit stream by appending the sequence of the binary values that we get after encoding the text. From this bit stream every 16 bit is taken and converted into a Unicode character. It creates an arbitrary sequence of Unicode characters with the values of the encoded bit stream. The scheme guarantees at least 50% compression in the worst case and 63% in the average case. This Unicode character sequence is then stored or transmitted. To decode it, we use the reverse process that was used for encoding. Finally we compare our result with well-known Huffman and LZW algorithm. Experimental result shows the effectiveness of the scheme.","PeriodicalId":427838,"journal":{"name":"2019 2nd International Conference on Innovation in Engineering and Technology (ICIET)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Efficient Compression Scheme for Bangla Natural Text by 16 Bit Unicode Transformation\",\"authors\":\"Maaheer Amaeer, K. Hasan, Md. Ashiq Mahmood, Piyal Shuvro, Abdul Awal\",\"doi\":\"10.1109/ICIET48527.2019.9290703\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Text compression is an important area of research for natural language processing community. Due to huge number of characters in Unicode, it takes 16 bits to manage the total codes. Each of the language has a block of codes. We describe a technique to compress the 16 bit Unicode Bangla natural text along with English characters by 8-bit encoding. The encoding and decoding schemes consist of two steps. In step1 we replace some frequently used Bangla phrases with the extended ASCII characters and in the second step we assign the ASCII characters by an 8-bit binary value. We create a bit stream by appending the sequence of the binary values that we get after encoding the text. From this bit stream every 16 bit is taken and converted into a Unicode character. It creates an arbitrary sequence of Unicode characters with the values of the encoded bit stream. The scheme guarantees at least 50% compression in the worst case and 63% in the average case. This Unicode character sequence is then stored or transmitted. To decode it, we use the reverse process that was used for encoding. Finally we compare our result with well-known Huffman and LZW algorithm. Experimental result shows the effectiveness of the scheme.\",\"PeriodicalId\":427838,\"journal\":{\"name\":\"2019 2nd International Conference on Innovation in Engineering and Technology (ICIET)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 2nd International Conference on Innovation in Engineering and Technology (ICIET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIET48527.2019.9290703\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 2nd International Conference on Innovation in Engineering and Technology (ICIET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIET48527.2019.9290703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Efficient Compression Scheme for Bangla Natural Text by 16 Bit Unicode Transformation
Text compression is an important area of research for natural language processing community. Due to huge number of characters in Unicode, it takes 16 bits to manage the total codes. Each of the language has a block of codes. We describe a technique to compress the 16 bit Unicode Bangla natural text along with English characters by 8-bit encoding. The encoding and decoding schemes consist of two steps. In step1 we replace some frequently used Bangla phrases with the extended ASCII characters and in the second step we assign the ASCII characters by an 8-bit binary value. We create a bit stream by appending the sequence of the binary values that we get after encoding the text. From this bit stream every 16 bit is taken and converted into a Unicode character. It creates an arbitrary sequence of Unicode characters with the values of the encoded bit stream. The scheme guarantees at least 50% compression in the worst case and 63% in the average case. This Unicode character sequence is then stored or transmitted. To decode it, we use the reverse process that was used for encoding. Finally we compare our result with well-known Huffman and LZW algorithm. Experimental result shows the effectiveness of the scheme.