Bibliographic record
Abstract
The rapid development of information technology is driving the advancement of natural language processing. The retrieval of grammatical problems in natural language processing is one of its specific tasks, particularly in the context of online learning. Therefore, a retrieval method based on fuzzy tree matching is proposed to tackle the issue of grammatical multiple-choice questions (MCQs) in online English, and its effectiveness is validated through experiments. The experimental results indicate that for incomplete queries, the MRR value STPK of the grammatical MCQ questions STP is increased by 7.9% compared to the proposed method. Compared to the traditional POS sorting algorithm, this algorithm demonstrates a 2.1% improvement. When the recall rate is 0.1, the accuracy rate of other methods is below 0.4, while the method proposed in the study surpasses 0.4. In the case of a comprehensive query, STPK the MRR value for t is STP increases by 29.6%. The proposed method in the research generally maintains an accuracy rate between 0.2 and 1.0. However, when other methods achieve an accuracy rate of 0.2, the proposed method’s accuracy rate drops below 0.2. Overall, the proposed method effectively enhances the retrieval accuracy of online English grammar MCQs compared to existing statistical and grammatical analysis methods. This improvement holds great significance for the actual retrieval of online English grammar multiple-choice questions.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.814 | 0.795 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; the direct Gemma label and the distilled Codex classifier agree on what is shown here.
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".