A Genetic Algorithm Approach for Veri cation of the Syllable Based Text Compression Technique Gokturk Ucoluk

Provided that an easy mechanism exists for it, it is possible to de-compose a text into strings that have lengths greater than one and occur frequently. Having in one hand the set of frequently occurring such strings and in the other the set of letters and symbols it is possible to compress the text using Human coding over an alphabet which is a subset of the union of these two sets. Observations reveal that in most cases the maxi-mal inclusion of the strings leads to an optimal length of compressed text. However the verication of this prediction requires the consideration of all subsets in order to nd the one that leads to the best compression. A Ge-netic Algorithm (GA) is devised and used for this search process. Turkish texts, where due to its aglunitative nature, the language provides a highly regular syllable formation, are used as a testbad.