When Learners Surpass Their Models: Mathematical Modeling of Learning from an Inconsistent Source
CSEF · 2014 Behavioral & Social Sciences
Overview
Objectives/Goals This project is a second-year study, in which I worked on developing and studying an algorithm to model successful learning from an inconsistent source. It has been reported in the literature that both adults and children can, to a different degree, modify and regularize the often inconsistent linguistic input they receive. Their regularization has been attributed to an innate sense of grammar, also known as universal grammar (UG). We aim to demonstrate that the observed regularization does not require such innate abilities. We present an algorithm to model and investigate the learning process of a learner mastering a set of (grammatical or syntactic) forms from an inconsistent source without possessing any innate biases about the language. Methods/Materials I conducted a thourough analytical study of the algorithm using the apparatus of Markov Chains and also a numerical study by writing several computer codes in Fortran. The results from my study were then compared to the data collected by E. Newport and J. Singleton. Results We show, both rigorously by proving two theorems about the algorithm, and numerically, that the algorithm possesses a frequency-boosting property, whereby the frequency of the most common form of the source is increased by the learner. Furthermore, I found several paterns showing the relationship of speed and quality of learning with various parameters Conclusions/Discussion We show that the algorithm possesses a frequency-boosting property, whereby the frequency of the most common form of the source is increased by the learner. We also explain several key findings of the Newport-Singleton experimental study. Ultimately, we show that it is possible for a learner to achieve results similar to those in the observational/experimental data without the learner having any innate biases or constraints about the patterns that exist in the language.
Summary statement
I developed and analyzed a mathematical model which shows that a learner can successfully learn from and surpass its inconsistent sources without any innate sense of grammar.
Help received
Prof. N. Komarova (UCI) provided supervision and conceptual guidance at several stages of my work. However, all my research and report were done solely by me.
Competition history
- CSEF 2014
Resources
Related projects
CSEF · 2013
The Development and Study of an Algorithm to Explain Successful Language Acquisition from an Inconsistent Source
CSEF · 2010
A Study in Understanding and Usage of the English Language through Probabilistic Modeling and Frequency
CSEF · 2017
Understanding Arithmetic Learning in Young Children through a Neural Network Model of Number Representation
ISEF · 2025
Telling the Difference: Understanding the Difficulties of Perceiving New Languages
CSEF · 2017
A Probabilistic Network Model of Neural Systems
CSEF · 2004
Second Language Learning: Is There an Ideal Age?
CSEF · 2013
Monolingual vs. Multilingual
CSEF · 2015
Investigating Influences on the Recognition of Mandarin Tones
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: California Science & Engineering Fair public projects