1. A method for animating messages in a natural language, said method comprising the steps of: providing a natural language text message to be animated; dividing said text into sentences; dividing said sentences into words; reducing each word to a normalized form; selecting a sequence of templates for a normalized text; combining the sequences of templates for each sentence in a certain order into a single common sequence of templates; selecting an animation for each template; combining the selected animation files into a resulting clip, wherein said combining the sequences of templates for each sentence in a certain order into a single common sequence of templates comprises the steps of: (a) selecting from a list all templates having all template words included in a sentence; (b) deriving from the list of templates obtained in the previous step (a) information regarding hierarchy of the templates, the template hierarchy level determining a template rank; (c) excluding the templates with a minimum rank from the list of templates obtained in the step (a) if templates belonging to the same hierarchy but having different levels are included in a single set of templates obtained in the step (a); (d) selecting from the list of templates obtained in the step (c), an optimum set of templates for which a target function has the maximum value, wherein the target function is given by: f ⁡ ( x ) = k 1 · 1 N crosses + k 2 · N coverage + k 3 · N rank + k 4 · N pairs ⁢ ⁢ in ⁢ ⁢ ⁢ correct ⁢ ⁢ sequence - k 4 · N pairs ⁢ ⁢ in ⁢ ⁢ incorrect ⁢ ⁢ ⁢ sequence -> MAX where: N crosses is a number of crossings of the template words in the set of templates, N coverage is an aggregate coverage of all words by the templates (number of all words from a sentence, encountered in the templates), N rank is an aggregate rank of all templates from the set, N pairs in correct sequence is a number of word pairs of the composite (i.e., consisting of a few words) templates corresponding to the sequence of words in a phrase, N pairs in incorrect sequence is a number of word pairs of the composite templates not corresponding to the sequence of words in a phrase, and k 1 , k 2 , k 3 , k 4 are empirically calculated coefficients having values of 0.4, 0.33, 0.4, 0.2, respectively.
5. The method of claim 1 , further determining whether any sequences of templates corresponding to the normalized text are available in the cache, and selecting same from the cache if available.