Optimization algorithms of deciphering as the elements of a linguistic theory

This paper presents an outline of the linguistic theory which may be identified with the partially ordered set of optimization algorithms of deciphering. An algorithm of deciphering is the operational definition of a given linguistic phenomenon which has the following three components: a set of admissible solutions, an objective function and a procedure which finds out the minimum or the maximum of the objective function.The paper contains the description of the four algorithms of the proposed type:1. The algorithms which classifies the letters into vowels and consonants.2. The algorithm which identifies the morphemes in the text without the boundaries between words.3. The algorithm which finds out the dependency tree of a sentence.4. The algorithm which finds out the mapping of the letters of an unknown language into the letters of a known one.