This study applies the Apriori algorithm to analyse patterns, syntactic structures, and thematic clusters in Chinese studies data from various genres. This study aims to identify recurring linguistic elements in order to shed light on the dynamic nature of the Chinese language across different contexts and time periods. The Apriori algorithm is…

Many patterns found in natural language syntax have multiple possible explanations or structural descriptions. Even within the currently dominant Minimalist theoretical framework (Chomsky 1995, 2000), it is not uncommon to encounter multiple analyses for the same phenomenon proposed in the literature. A natural question, then, is whether one could…

Contribution: A problem-solving approach (PSA) model derived from major computational thinking (CT) concepts. This model can be utilized to formulate solutions for different algorithmic problems and translate them into effective active learning methods. Background: Different teaching approaches for programming are widely available; however, being…

Purpose: This study sought to 1) identify linguistic features important for Chinese text complexity with a theory-based and systematic approach, and 2) address how feature sets and algorithms affect the performance of Chinese text complexity models. Method: Texts from Chinese language arts textbooks from Grades 1 to 6 (N = 1,478) in Mainland China…

Various studies have been conducted on applying intelligent recognition technology, especially speech recognition technology to improve English learning ability, mostly listening and speaking. However, few studies have touched on how image-to-text recognition technology can be used for writing. The present research was conducted to fill this gap…

Evaluating creativity of verbal responses or texts is a challenging task due to psychometric issues associated with subjective ratings and the peculiarities of textual data. We explore an approach to objectively assess the creativity of responses in a sentence generation task to (1) better understand what language-related aspects are valued by…

Language is one of the hallmarks of intelligence, demanding explanation in a theory of human cognition. However, language presents unique practical challenges for quantitative empirical research, making many linguistic theories difficult to test at naturalistic scales. Artificial neural network language models (LMs) provide a new tool for studying…

Syntactic structures are unobserved theoretical constructs which are useful in explaining a wide range of linguistic and psychological phenomena. Language acquisition studies how such latent structures are acquired by human learners through many hypothesized learning mechanisms and apparatuses, which can be genetically endowed or of general…

The Indian Institute of Science is proud to host the fully in-person sixteenth iteration of the International Conference on Educational Data Mining (EDM) during July 11-14, 2023. EDM is the annual flagship conference of the International Educational Data Mining Society. The theme of this year's conference is "Educational data mining for…

The document describes the ALMO programing language. (Author)

An algorithmic language (ALGAMS) was proposed by the group on programing automation for medium type machines. The language is a subset of ALGOL-60. The paper discusses the syntax and semantics of ALGAMS. (Author/GO)

THE STUDY IS CONCERNED WITH THE LINGUISTIC PROBLEM INVOLVED IN TEXT COMPRESSION--EXTRACTING, INDEXING, AND THE AUTOMATIC CREATION OF SPECIAL-PURPOSE CITATION DICTIONARIES. IN SPITE OF EARLY SUCCESS IN USING LARGE-SCALE COMPUTERS TO AUTOMATE CERTAIN HUMAN TASKS, THESE PROBLEMS REMAIN AMONG THE MOST DIFFICULT TO SOLVE. ESSENTIALLY, THE PROBLEM IS TO…

Binary algorithmic logic may prove useful for teaching grammar, especially in the case of 'closed-system items.' (Text is in French.) Available from Instituut voor Toegepaste Linguistiek, Vesaliusstraat 2, B. 3000 Leuven, Belgium. (TL)

This paper discusses an alternate formalism for context-free phrase structure grammar. The author feels that if a grammar is stated completely explicitly it can be represented in the form of a relational network of the type proposed by Lamb. He discusses some formal properties of such networks and makes some revisions to Lamb's formulation which…