{'fraction_non_alphanumeric': 0.024242424242424242, 'fraction_numerical': 0.00404040404040404, 'mean_word_length': 5.19375, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Alternative source coding model for mobile text communication

This paper presents a new source coding model for the efficient transmission of mobile text messages. Unlike conventional text messages, which are sent in the form of character sequences, the proposed method uses key-code sequences that reflect the user's typing history for authoring the message. The key-code representation can be as efficient as 4 bits per key-code by utilizing existing dictionary-based text entry systems and mobile phones equipped with the standard reduced keyboard. Experiments that use an optimal dictionary show that the key-code representation can save 2.95 bits per character compared to the conventional ASCII representation. Further, computation of the entropy shows that the optimal code-word length of the ASCII representation in kth-order approximation, where probability distributions of blocks of k symbols are given, cannot be comparable to that of the key-code in (k-l)-order approximation.