MétaCan
Menu
Back to cohort
Record W134362049

Modeling Language Acquisition at Multiple Temporal Scales

2000· article· en· W134362049 on OpenAlexaffabout
Steve R. Howell, Suzanna Becker

Bibliographic record

VenueeScholarship (California Digital Library) · 2000
Typearticle
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsMcMaster University
Fundersnot available
KeywordsVerbContext (archaeology)Representation (politics)LinguisticsComputer scienceNounArgument (complex analysis)Artificial intelligenceNatural language processingCognitive sciencePsychologyCognitive psychologyHistory
DOInot available

Abstract

fetched live from OpenAlex

Modelling Language Acquisition at Multiple Temporal Scales Steve R. Howell (showell@hypatia.psychology.mcmaster.ca) Department of Psychology, McMaster University, 1280 Main Street West, Hamilton, Ontario, Canada Suzanna Becker (becker@mcmaster.ca) Department of Psychology, McMaster University, 1280 Main Street West, Hamilton, Ontario, Canada The problem of incorporating time in a neural network is an important one. Networks with feedback, such as Simple Recurrent Networks (SRNs) (Elman, 1990) have been argued to represent time more realistically through its effects on the processing of input, compared to standard feedforward networks. In effect, SRNs’ context units act as a memory, which incorporates a “smeared-out” representation of the network’s internal states over time. A problem does exist with this representation, however, especially for complex domains like that of language. The nature of argument agreement, embeddings and similar phenomena means that the SRN must be able to represent important past states (such as head noun for verb agreement) in spite of the declining effects of past context. While most word inputs will be related most strongly to words co- occurring close by in the input stream, verb agreement, for example, is largely determined by its corresponding noun, even in long, multiply-embedded sentences. SRN models should therefore be able to preserve representations of vital early structure for later use, in spite of the generally appropriate decline of short-term context. This issue has been addressed in an architectural fashion by others (Weckerly and Elman, 1992), but can perhaps be addressed more generally by allowing for more than one duration of context in an SRN’s operation. It is possible to apply the concept of hysteresis to the SRN’s context units. That is, the update from the hidden units to the context units may be other than the usual 1-to-1 copying; the context units may also incorporate self- recurrent connections of varying strengths. In particular, we have been experimenting with SRN’s using the hysteresis function suggested by Wermter, Arevian, and Panchev (1999) on the self-recurrent connections: Context i (t+1) = (1-Hy)*Hidden i (t) + Hy*Context i (t) We have conducted initial experiments using a test corpus derived from the original simplified test corpus used by Elman (1990). Our version differs from the original in that it includes not only consonant to vowel relations, but also word-to-word relations. That is, some of the consonant- vowel combinations (words) can only occur immediately following others. Thus in addition to the network needing to learn, for example, that u’s only come after G’s or U’s (Guuu), it must also learn that Guuu only comes after Da. It is in this capacity that the hysteresis parameter should most come into play, for it specifies, in effect, the duration of retention of the states of the context units. For short term letter to letter relations, small to zero hysteresis values should be adequate, as demonstrated originally by Elman’s success. In that experiment, the network error declined consistently within a word, but jumped at word boundaries, representing the fact that word distribution was random in that corpus. In our experiments, manipulating the hysteresis parameters was expected to bias the network in favour of either short or long term relationships. Also, simulated annealing of the learning rate, another technique not typically used with SRNs, is used in both control and experimental networks. In pilot work this feature smoothed oscillations in the gradient descent of error. The initial results of a number of simulation runs from different random initial conditions indicate that small hysteresis values (of other than 0) are indeed an advantage in learning this prediction task, with error per epoch declining noticeably, though not exceptionally, faster with 0.2 > Hys >0.1. Presumably this modest net gain is actually composed of both a larger gain for word-to-word relationships and a small decline for letter-to-letter prediction. Explorations of the exact nature of this advantage are underway, as is investigation of the best range of hysteresis parameters for various language tasks. With the ability to change the hysteresis of context layers, it becomes useful to incorporate multiple hidden layers into an SRN (Wermter, 1999), with layers having a different ‘span’ of context via different hysteresis settings. We also describe a model with multiple hidden layers that is being applied to more complex language corpora, and is designed to be able to learn at multiple time scales simultaneously, by capturing longer-range temporal structure in progressively higher layers. References Elman, J.L. (1990). Finding structure in time. Cognitive Science, 14, 179-211. Weckerly, J., & Elman, J.L. (1992). A PDP approach to processing center-embedded sentences. In Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society. Hillsdale, NJ: Erlbaum. Wermter, S., Arevian, G. & Panchev, C. (1999). Recurrent Neural Network Learning for Text Routing, Proceedings of the Ninth International Conference on Artificial Neural Networks, 2, 470-475.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication, Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.925
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0020.007
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.004

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.014
GPT teacher head0.212
Teacher spread0.198 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2000
Admission routes2
Has abstractyes

Explore more

Same venueeScholarship (California Digital Library)Same topicTopic ModelingFrench-language works237,207