MétaCan
Menu
Back to cohort
Record W1974219706 · doi:10.1109/icmlc.2009.5212797

A special parser for learning English composition - Error analysis & learners' model for ILTS

2009· article· en· W1974219706 on OpenAlexaff
Liang Chen, Naoyuki Tokuda

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversity of Northern British Columbia
Fundersnot available
KeywordsComputer scienceParsingNatural language processingSentenceArtificial intelligenceGrammarTable (database)Word (group theory)Matching (statistics)Speech recognitionEmbeddingLinguisticsDatabase

Abstract

fetched live from OpenAlex

By embedding the function of automatically correcting nearly free format English translations of given Japanese sentences, we have developed a new ILTS(intelligent language tutoring system) for improving English Writing Skills in a L2 tutoring environment. In addition to a diagnostic engine capable of identifying grammatical, lexical and word usage errors of students' input translations and returning error contingent feedback, we have developed a simple table look-up parser for displying the grammar trees. The table look-up parser parses a user input, which is always erronous, by simply matching the extended part-of-speech tag sequence of a closing sentence in a template of ILTS to the entries of a look-up-table, in which each extended part-of-speech tag array corresponds to one grammar tree. The complexity of the table look-up parser is O(n), where n denotes the length of a sentence. This shows a marked improvement over the general purpose parser of which the complexity is O(n3).

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.016
Threshold uncertainty score0.054

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0160.007

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.027
GPT teacher head0.306
Teacher spread0.278 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations1
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicNatural Language Processing TechniquesFrench-language works237,207