Efficient learning strategy of Chinese characters based on network approach

Abstract

Based on network analysis of hierarchical structural relations among Chinese characters, we develop an efficient learning strategy of Chinese characters. We regard a more efficient learning method if one learns the same number of useful Chinese characters in less effort or time. We construct a node-weighted network of Chinese characters, where character usage frequencies are used as node weights. Using this hierarchical node-weighted network, we propose a new learning method, the distributed node weight (DNW) strategy, which is based on a new measure of nodes' importance that takes into account both the weight of the nodes and the hierarchical structure of the network. Chinese character learning strategies, particularly their learning order, are analyzed as dynamical processes over the network. We compare the efficiency of three theoretical learning methods and two commonly used methods from mainstream Chinese textbooks, one for Chinese elementary school students and the other for students learning Chinese as a second language. We find that the DNW method significantly outperforms the others, implying that the efficiency of current learning methods of major textbooks can be greatly improved.

8 pages, 6 figures

References in corpus (6)

• Mitigation of Malicious Attacks on Networks
• Network Physiology reveals relations between network topology and physiological function
• Languages cool as they expand: Allometric scaling and the decreasing need for new words
• Zipf's Law Leads to Heaps' Law: Analyzing Their Relation in Finite-Size Systems
• Evolution of the most common English words and phrases over the centuries
• Self-organization of progress across the century of physics

Cited by in corpus (7)

• Computational Socioeconomics
• Robustness of partially interdependent network formed of clustered networks
• The influence of the broadness of the degree distribution on network's robustness: comparing localized attack and random attack
• $k$-core percolation on complex networks: Comparing random, localized and targeted attacks
• Maximum Entropy, Word-Frequency, Chinese Characters, and Multiple Meanings
• Optimizing the Learning Order of Chinese Characters Using a Novel Topological Sort Algorithm
• The 'Letter' Distribution in the Chinese Language