Research on the Construction of Knowledge Graphs for Text-Based English Teaching Mining Based on Deep Learning

Existing knowledge graph construction methods have deficiencies in semantic understanding and dynamic knowledge updating, and are difficult to adapt to complex teaching scenarios. This paper proposes an English knowledge graph construction algorithm (DSL-KG) based on dynamic semantic learning. Through deep semantic mining and dynamic association modeling, it realizes the automatic extraction and graph construction of knowledge points in teaching texts. The DSL-KG algorithm builds entity recognition and relationship classification models with BERT as the core, combines GNN to model the dynamic relationship between knowledge points, and adopts a multitask learning mechanism to achieve joint optimization. The experimental simulation is based on English textbooks and test corpora. The results show that the DSL-KG algorithm achieves an F1-score of 93.8% in entity recognition, an accuracy rate of 91.5% in relationship classification, an increase in knowledge graph coverage to 87.2%, and a construction time of 4.8 seconds per text, which shows significant advantages over traditional methods and existing deep learning models. Practical application verification shows that the algorithm can efficiently generate knowledge graphs, and provide knowledge point recommendations and learning path planning support in intelligent teaching systems, providing a technical foundation for the intelligent development of English teaching.

Authors

Institutions

Publication Details

Published
2025-04-23
DOI
https://doi.org/10.1109/acctcs66275.2025.00166
Citations
2
Primary Topic
Educational Technology and Pedagogy
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on the Construction of Knowledge Graphs for Text-Based English Teaching Mining Based on Deep Learning

Lan Ge, Zhaohui Huang
2 citations
Educational Technology and Pedagogy
4.96
article

Research on the Construction of Knowledge Graphs for Text-Based English Teaching Mining Based on Deep Learning

Lan Ge, Zhaohui Huang
article en
2 citations

Abstract

Existing knowledge graph construction methods have deficiencies in semantic understanding and dynamic knowledge updating, and are difficult to adapt to complex teaching scenarios. This paper proposes an English knowledge graph construction algorithm (DSL-KG) based on dynamic semantic learning. Through deep semantic mining and dynamic association modeling, it realizes the automatic extraction and graph construction of knowledge points in teaching texts. The DSL-KG algorithm builds entity recognition and relationship classification models with BERT as the core, combines GNN to model the dynamic relationship between knowledge points, and adopts a multitask learning mechanism to achieve joint optimization. The experimental simulation is based on English textbooks and test corpora. The results show that the DSL-KG algorithm achieves an F1-score of 93.8% in entity recognition, an accuracy rate of 91.5% in relationship classification, an increase in knowledge graph coverage to 87.2%, and a construction time of 4.8 seconds per text, which shows significant advantages over traditional methods and existing deep learning models. Practical application verification shows that the algorithm can efficiently generate knowledge graphs, and provide knowledge point recommendations and learning path planning support in intelligent teaching systems, providing a technical foundation for the intelligent development of English teaching.

Beijing Polytechnic (CN)
Openalex Percentile: Top 5%
Educational Technology and Pedagogy
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.