This paper proposes a numerical model of the network of two-Chinese-character compound words (two-character network, for short). In this network, a Chinese character is a node and a two-Chinese-character compound word links two nodes. The basic framework of the model is that an important character gets many edges. As the importance of a character, we use the frequency of each character appearing in publications. The direction of edge is given according to a random number assigned to nodes. The network generated by the model is small-world and scale-free, and reproduces statistical properties in the actual two-character network quantitatively.