KADYSNET: A NOVEL APPROACH TO DYSLEXIA PREDICTION IN CHILDREN: COMBINING HANDWRITTEN TEXT RECOGNITION WITH A HYBRID CNN-BILSTM-CTC MODEL AND PERSONALIZED LEARNING STRATEGIES
Bibliographic record
Abstract
This study introduces a novel approach for early dyslexia detection in children through automated handwriting analysis, integrating a hybrid CNN-BiLSTM-CTC architecture with personalized learning strategies. Our method combines a custom CNN-BiLSTM-CTC model with tailored educational interventions to support dyslexic learners. We analyzed children's handwritten text images in English, collected from specially designed tests involving word rewriting, sentence reconstruction, and paragraph composition, particularly challenging tasks for dyslexic individuals. Notably, our CNN-BiLSTM-CTC model achieved the best result with an accuracy of 97.67%, outperforming other architectures. Compared to pre-trained models like EfficientNetB7, DenseNet121, and MobileNetV2, our custom CNN-BiLSTM-CTC model demonstrated superior performance. Key contributions include the development of a novel CNN-BiLSTM-CTC architecture for handwriting analysis and the integration of personalized learning strategies to enhance educational outcomes. By facilitating earlier and more accurate detection, this approach can significantly improve educational support for children at risk of dyslexia. Future research will focus on expanding the dataset and conducting longitudinal studies to assess the long-term impact. Customization and CNN-BiLSTM hybridization together enhance performance by capturing subtle handwriting variations and integrating spatial with sequential learning.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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; a candidate call from one teacher head, not a consensus.
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".