ОПРЕДЕЛЕНИЕ НАБОРА УСЛОВИЙ ДЛЯ АВТОМАТИЧЕСКОГО ПОИСКА ОПТИМАЛЬНОГО ВАРИАНТА ГИБРИДНОГО МАШИННОГО ПЕРЕВОДА ТЕКСТА НА ГРАФЕМНОМ УРОВНЕ

Abstract

The article is devoted to the Algorithmic Search for Optimal Solutions for evaluating andimproving the Quality of Hybrid Machine Translation of Text. The Object of the Research is Textson any Alphabetical Languages with different Bases (Alphabets), as well as their Translations intoother Alphabetical Languages.Currently, existing Methods and Means of Hybrid Machine Translationare characterized by a wide variety of Quality Assessment Algorithms, but the Disadvantageof these Methods is that most of them do not have Clear Criteria, Limitations and Schemes of Assessments,eventually, the Result of the Translation in most cases does not correspond to the Levelof Publication. The Aim of the Work is to determine a Set of Conditions for automatic search forthe Best Option of Hybrid Machine Translation of Text at the Level of Graphemes.The Main Tasksto be solved during the Research are the Search for Qualitative and Quantitative Conditions, includingthe maximum, minimum and average values of the Lengths of Translations, Reverse Translationsand Editorial Distances between Pairs of Texts that have the Same Meaning. The ScientificNovelty lies in use the Graphical Representation of the Model of Alphabetic Languages at theLevel of Graphemes in the Form of a Cartesian Coordinate System with a Dimension equal to aUnit Editorial Distance (by Levenstein). When solving the de Goui’s Theorem, the current Rules ofStandardization PR 50.1.027–2014 "Rules for the Provision of Translation and Special Types ofLinguistic Services", the Method of Decanonicalization and the Model "Original Text – Translation– Reverse Translation" were used. As a Result, Actual and Practically Applicable Solutionsfor the Problems under consideration are obtained. In this regard; this Work may be interest to awide range of Specialists engaged in Machine Translation and Translation Studies.