English Language Learning Pattern Matching Based on Distributed Reinforcement Learning
Hua Zhao and
Zaoli Yang
Mathematical Problems in Engineering, 2022, vol. 2022, 1-8
Abstract:
The rapid development of a new generation of information technology, the promotion of network technology, and the emergence of complex and diverse requirements for control objects make the structure of language learning models more and more distributed. Distributed learning theory emphasizes the central position of learners in the learning process and the universality of learning scenes. This paper explores the significance and value of various learning modes to improve students’ learning effect. By analyzing the research data and explaining various effective language learning models, this paper aims to establish a theoretical framework of English language learning models and explore more effective language model matching schemes. This paper analyzes the adaptive multiagent, reward function, Markov model, probability function model, etc. and conducts experiments on the basis of the designed model. The linear correlation parameters of the model and the English language pattern matching efficiency are analyzed and judged on several important indicators. Because the algorithm designed in this paper has a good effect on the control of error, the error reduction rate has reached 85.6%.
Date: 2022
References: Add references at CitEc
Citations:
Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/7876504.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/7876504.xml (application/xml)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:7876504
DOI: 10.1155/2022/7876504
Access Statistics for this article
More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().