Paper: Optimization Algorithms Of Deciphering As The Elements Of A Linguistic Theory

ACL ID C88-2134
Title Optimization Algorithms Of Deciphering As The Elements Of A Linguistic Theory
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1988
Authors

This paper presents an outline of the linguistic theory which may be identified with the partially ordered set of optimi- zation algorithms of deciphering. An algorith~L of deciphering is the operational definition of a given linguistic phenomenon which ha~, the following three components: a set of admissible solutions, an objective function and a proaodure which finds out the mini,4~m or the maximum of the objective function. The p~er contains the description of the four algorithms of the proposed type: ~. The algorithm which classifies the letters into vowels and consonants. 2. The ~Lgorithm 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 th...