Usage of Fourier transformation theory in machine translation

Kharkevych, Galyna; Kharkevych, Yu. I.; Kal’chuk, I. V.; Sobchuk, Valentyn

doi:10.1109/atit50783.2020.9349329

Cited by 7 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Таким образом, можно сделать вывод, что для более качественного машинного перевода технических текстов, очевидно, следует использовать преобразование Фурье именно прямоугольных линейных матричных методов суммирования, использование которых находит свое подтверждение в работах прикладного характера [38][39][40][41]. Более того, его использование позволит качественно повысить скорость и частоту идентификации текстовой информации с дальнейшей обработкой и использованием в формате качественных цифровых данных.…”

unclassified

О Зависимости Качества Машинного Перевода Текста От Используемого Преобразования Фурье

Sobchuk¹,

Kharkevych²

2021

PC&I

View full text Add to dashboard Cite

Machine translation is widely used in the translation of commercial, technical, scientific information that is connected with the process of globalization and, accordingly, the expansion of the network of business relations. Mathematical methods related to machine translation of the texts have recently received new development due to the intensive development of Fourier transformation theory. Thus, the requirements for filtering accuracy in the processing of contrast signals and images have increased, allowing to create efficient filtering algorithms. Frequency algorithms are the most efficient of all the existing filtering algorithms, i.e., those where the coefficients of decomposition of the noisy signal by Fourier basis are the subject to processing. When using Fourier filtering algorithms, the properties of Fourier transformation play an important role, that depend on belonging to a particular class of differential functions. The necessary condition for the existence of the continuous Fourier transformation is the absolute convergence of some functions by means of which the real studied process is describing. In practice, the so-called “summation functions” are often used as simulated functions, which can be constructed using a linear matrix summation of Fourier series. As for the latter, scientists distinguish between both triangular and rectangular linear matrix methods. This paper is devoted to the study of the convergence conditions of Fourier transformations of both triangular and rectangular linear matrix methods for summing Fourier series. Moreover, this article shows that the rate of convergence of Fourier transformation of the rectangular linear Abel-Poisson method is at times faster than the rate of convergence of the analogous triangular linear Abel-Poisson method. This result can further significantly influence the choice of the more effective Fourier transformation used in the process of machine translation of the text.

show abstract

unclassified