A genetic algorithm approach for verification of the syllable-based text compression technique

Ucoluk G., Toroslu I.

JOURNAL OF INFORMATION SCIENCE, cilt.23, sa.5, ss.365-372, 1997 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 23 Sayı: 5
  • Basım Tarihi: 1997
  • Doi Numarası: 10.1177/016555159702300503
  • Dergi Adı: JOURNAL OF INFORMATION SCIENCE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.365-372
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

Provided that an easy mechanism exists for it, it is possible to decompose a text into strings that have lengths greater than one and occur frequently. Having in one hand the set of such frequently occurring strings and in the other the set of letters and symbols, it is possible to compress the text using Huffman coding over an alphabet which is a subset of the union of these two sets. Observations reveal that, in most cases, the maximal inclusion of the strings leads to an optimal length of compressed text. However, the verification of this prediction requires the consideration of ail subsets in order to find the one that leads to the best compression. A genetic algorithm is devised and used for this search process. In Turkish texts, because of the agglutinative nature of the language, a highly regular syllable formation provides a useful testbed.