In natural languages, there are big differences in what letters are the most common across words. In the Spanish language, the letter "e" is the most common, occurring 12.2% of the time, and the letter "k" is the least common, occurring only 0.01% of the time. That's why the Huffman coding algorithm can help to compress natural language documents. Huffman coding reduces the amount of bits required to represent data by choosing new bit codes for each source symbol, and choosing short codes for the most frequent source symbols. Here's a Spanish word encoded with Huffman coding:
1101101111111110
These are the codes for the letters in the word, a subset of the table of codes for all the letters in the Spanish alphabet:
letter bit code
a 011
c 11011
o 1111
s 1110
Decode the word according to the bit codes in the table. What is the original Spanish word represented by that encoding?