المؤلفون: Zhao, Xiaoda, Jin, Xiaoyan

المصدر: Security & Communication Networks; 3/7/2022, p1-11, 11p

مصطلحات موضوعية: DEEP learning, PROGRAMMING languages, COMPUTER assisted language instruction, TEACHING methods, UNIVERSAL language, EVALUATION methodology

مستخلص: With the advancement of globalization, an increasing number of people are learning and using a common language as a tool for international communication. However, there are clear distinctions between the native language and target language, especially in pronunciation, and the domestic target language, the learning environment is far from ideal, with few competent teachers. In addition, such learning cannot achieve computer-assisted language learning (CALL) technology. The efficient combination of computer technology and language teaching and learning methods provides a new solution to this problem. The core of CALL is speech recognition (SR) technology and speech evaluation technology. The development of deep learning (DL) has greatly promoted the development of speech recognition. The pronunciation resource collected from the Chinese college students, whose majors are language education or who are planning to obtain better pronunciation, shall be the research object of this paper. The study applies deep learning to the standard but of target language pronunciation and builds a standard evaluation model of pronunciation teaching based on the deep belief network (DBN). On this basis, this work improves the traditional pronunciation quality evaluation method, comprehensively considers intonation, speaking speed, rhythm, intonation, and other multi-parameter indicators and their weights, and establishes a reasonable and efficient pronunciation model. The systematic research results show that this article has theoretical and practical value in the field of phonetics education. [ABSTRACT FROM AUTHOR]

: Copyright of Security & Communication Networks is the property of Hindawi Limited and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Nofre, David

المصدر: IEEE Annals of the History of Computing IEEE Annals Hist. Comput. Annals of the History of Computing, IEEE. 32(2):58-68 Jun, 2010

المؤلفون: Wesely, Pamela, Plummer, Elizabeth

المصدر: Japan Association for Language Teaching Computer Assisted Language Learning Journal (JALT CALL Journal); 2021, Vol. 17 Issue 3, p233-255, 23p

مصطلحات موضوعية: COMPUTER assisted language instruction, ATTITUDES toward language, PROGRAMMING languages, FOREIGN language education, ATTITUDES toward technology, LEARNING, UNIVERSAL language

مستخلص: This quantitative study explored how secondary world language (WL) learners' attitudes about computer-assisted language learning (CALL) were related to their attitudes and self-confidence about their language class and the prevalence of computer usage in their language classroom. Research has suggested positive correlations between these factors, but it has focused on learner attitudes about specific technological tools, not on CALL as an integral, regular, consistent component of the learning process. An 81-item online survey was administered to WL learners of Spanish, French, and German in 37 US secondary schools in one Midwestern state (N = 1031). The results indicated several strong positive correlations: (1) between learner attitudes about the use of technology in their language class and learner attitudes and self-confidence about their language class, and (2) between the prevalence of computer usage in their language classroom, learner attitudes and self-confidence about their language class, and learner attitudes about the use of technology in their language class. Additionally, even a once-a-week usage of computers correlated with more positive attitudes about language class. The study thus suggests that secondary WL learners experience CALL as an integral, normalized part of the language classroom, and that the attitudinal benefits of more computer usage can be leveraged to enhance all learning. [ABSTRACT FROM AUTHOR]

: Copyright of Japan Association for Language Teaching Computer Assisted Language Learning Journal (JALT CALL Journal) is the property of Castledown Publishers and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: SANAN, DAVID, YONGWANG ZHAO, SHANG-WEI LIN, LIU YANG

المصدر: ACM Transactions on Programming Languages & Systems; Apr2021, Vol. 43 Issue 1, p1-46, 46p

مصطلحات موضوعية: PROGRAMMING languages, UNIVERSAL language, SCALABILITY, TECHNICAL specifications, SIMULATION methods & models

مستخلص: To make feasible and scalable the verification of large and complex concurrent systems, it is necessary the use of compositional techniques even at the highest abstraction layers. When focusing on the lowest software abstraction layers, such as the implementation or the machine code, the high level of detail of those layers makes the direct verification of properties very difficult and expensive. It is therefore essential to use techniques allowing to simplify the verification on these layers. One technique to tackle this challenge is top-down verification where by means of simulation properties verified on top layers (representing abstract specifications of a system) are propagated down to the lowest layers (that are an implementation of the top layers). There is no need to say that simulation of concurrent systems implies a greater level of complexity, and having compositional techniques to check simulation between layers is also desirable when seeking for both feasibility and scalability of the refinement verification. In this article, we present CSim2 a (compositional) rely-guaranteebased framework for the top-down verification of complex concurrent systems in the Isabelle/HOL theorem prover. CSim2 uses CSimpl, a language with a high degree of expressiveness designed for the specification of concurrent programs. Thanks to its expressibility, CSimpl is able to model many of the features found in real world programming languages like exceptions, assertions, and procedures. CSim2 provides a framework for the verification of rely-guarantee properties to compositionally reason on CSimpl specifications. Focusing on top-down verification, CSim2 provides a simulation-based framework for the preservation of CSimpl rely-guarantee properties from specifications to implementations. By using the simulation framework, properties proven on the top layers (abstract specifications) are compositionally propagated down to the lowest layers (source or machine code) in each concurrent component of the system. Finally, we show the usability of CSim2 by running a case study over two CSimpl specifications of an Arinc-653 communication service. In this case study, we prove a complex property on a specification, and we use CSim2 to preserve the property on lower abstraction layers. [ABSTRACT FROM AUTHOR]

: Copyright of ACM Transactions on Programming Languages & Systems is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Sitender, Bawa, Seema

المصدر: IETE Journal of Research; Jan-Feb2021, Vol. 67 Issue 1, p117-128, 12p

مصطلحات موضوعية: PROGRAMMING languages, UNIVERSAL language, SANSKRIT language, LANGUAGE policy, NATURAL language processing

مصطلحات جغرافية: INDIA

الشركة/الكيان: INDIAN Institute of Technology (Mumbai, India)

مستخلص: Machine translation has become the most challenging as well as demanding field of research and as a result, to develop a fully automatic 100% correct machine translation system has not been achieved till date. More than 7000 of languages are being used worldwide for communication purposes and in India alone 22 languages have been recognized as official languages for communication purposes. Various efforts have been made to solve this problem by different researchers using different approaches. With the enhancement in technology and internet, automatic translation has become more important to share the knowledge. The authors in this paper described a mechanism of translation using machines for one of the ancient Indian Language Sanskrit to the latest computer understandable language Universal Networking Language (UNL). The proposed system uses two databases: one for the analysis purpose consists of more than 300 rules and the other for the generation of UNL which consists of about 1500 rules. For the performance evaluation, the authors selected 500 Sanskrit sentences in such a way that covers maximum UNL relations from various sources. The sentences are manually converted from English to Sanskrit language taken from Spanish Language center, Hindi to English language taken from IIT Bombay Hindi–UNL expressions and NCERT class 8th Sanskrit book titled "Ruchita Part 3". The proposed system achieves a BLEU score of 0.85. The proposed system gives 93.18% efficiency in resolving UNL relation successfully. [ABSTRACT FROM AUTHOR]

: Copyright of IETE Journal of Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Gonçalves, M. A. F, Lorini, F. J., Benetti, C., Eckhardt, M., Scheuer, C. J.

المصدر: International Journal of Advanced Manufacturing Technology; Oct2020, Vol. 110 Issue 9/10, p2713-2725, 13p, 3 Color Photographs, 8 Black and White Photographs, 5 Diagrams, 4 Charts

مصطلحات موضوعية: PROGRAMMING languages, UNIVERSAL language, ALGORITHMS, FOREST thinning

مستخلص: This work aimed to develop a universal parameterized language for programming numerically controlled machines. For proposed language interpretation and compilation, a computational application called parameterized programming module (PPM) was developed, based on Pascal programming fundamentals and incremented with the G-code. The proposed parameterized language has a different structure from those provided by the command manufacturers, constituting a complementary tool for parameterization in numerical programming. In order to validate the proposed system, angular, transversal, and longitudinal turning thinning operation through single and multiple cycles were programmed, which proved the algorithm's operability. Additionally, the performed test results show that the developed algorithm proved to be reliable in the numerical code interworking and compilation. [ABSTRACT FROM AUTHOR]

: Copyright of International Journal of Advanced Manufacturing Technology is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Ramsdell, Lea

المصدر: Journal of Latin American Cultural Studies (13569325); Sep2020, Vol. 29 Issue 3, p445-459, 15p

مصطلحات موضوعية: PUNTA music, LANGUAGE attrition, CULTURAL appropriation, PROGRAMMING languages, UNIVERSAL language, WORLD culture, OCCUPATIONAL prestige

مصطلحات جغرافية: COLOMBIA, CENTRAL America

مستخلص: Beginning in the 1990s, governments as well as international entities, such as UNESCO, heeded the alarm from scholars and community activists that many of the world's languages were on the road to extinction. In the context of the Americas, programmes to protect the languages of indigenous and Afrodescendant populations were developed but rarely fully funded. The Garífuna of Central America and the Palenqueros of San Basilio de Palenque in Colombia are two Afrodescendant communities with their own languages that have been declared as Masterpieces of Oral and Intangible Cultural Heritage by UNESCO. In the face of the erosion of their cultures and languages, community members nurtured popular music forms sung in their respective languages in order to increase their linguistic prestige. Garífuna punta rock and paranda as well as Palenquero champeta have endured both condemnation and appropriation by dominant cultures and the global culture market. In the end, however, they have successfully attracted the youth of both communities to their heritage languages, serving as a vehicle to stem language loss. [ABSTRACT FROM AUTHOR]

: Copyright of Journal of Latin American Cultural Studies (13569325) is the property of Routledge and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Henderson, Felicity

المصدر: TLC Journal; 2021, Vol. 5 Issue 4, p96-98, 3p

مصطلحات موضوعية: LANGUAGE teachers, RHYME, DOUGH, UNIVERSAL language, PROGRAMMING languages

مستخلص: The article discusses the changes in the language caused by the influence of German and French and the influence of the printing press and social influences over the centuries which have led to small changes in pronunciation. Topics include changes in social influence have also been important, such as the need to make an emotional impact or send social signals; and Pronunciation has drifted with its borrowings, adaptations and inventions is as marked by its exceptions as much by its rules.

المؤلفون: Telle, Jan Arne, Hernández-Orallo, José, Ferri, Cèsar

المصدر: Machine Learning; Sep2019, Vol. 108 Issue 8/9, p1653-1675, 23p

مصطلحات موضوعية: UNIVERSAL language, CONCEPT learning, TEACHERS, MOBILE learning, PROGRAMMING languages, NEUROLINGUISTICS

مستخلص: The theoretical hardness of machine teaching has usually been analyzed for a range of concept languages under several variants of the teaching dimension: the minimum number of examples that a teacher needs to figure out so that the learner identifies the concept. However, for languages where concepts have structure (and hence size), such as Turing-complete languages, a low teaching dimension can be achieved at the cost of using very large examples, which are hard to process by the learner. In this paper we introduce the teaching size, a more intuitive way of assessing the theoretical feasibility of teaching concepts for structured languages. In the most general case of universal languages, we show that focusing on the total size of a witness set rather than its cardinality, we can teach all total functions that are computable within some fixed time bound. We complement the theoretical results with a range of experimental results on a simple Turing-complete language, showing how teaching dimension and teaching size differ in practice. Quite remarkably, we found that witness sets are usually smaller than the programs they identify, which is an illuminating justification of why machine teaching from examples makes sense at all. [ABSTRACT FROM AUTHOR]

: Copyright of Machine Learning is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: CIRCUS, AERO

المصدر: Australian Aviation; 2021, Issue 380, p86-89, 4p

مصطلحات موضوعية: UNIVERSAL language, ENGLISH language, PROGRAMMING languages