Word Sense Disambiguation Method Based on Graph Model and Word Vector

As a basic research of natural language processing, word sense disambiguation (WSD) has a very important influence on machine translation, classification tasks, retrieval tasks, etc. In order to solve the problem that existing disambiguation methods rely too much on knowledge base, a disambiguation method combining graph model and word vector is proposed in this paper. Firstly, in this method, the text data are preprocessed by removing punctuation marks and segmenting words. Secondly, the dependency relation is extracted by using the tool of PYLTP for dependency parsing, the words of dependency parent node are matched and the undirected graph is built, and the context knowledge of ambiguous words is selected according to the minimum path length set by the graph model. Finally, Word2Vec model is used to train Wikipedia corpus to obtain word vectors containing ambiguous words and contextual knowledge, and calculate the cross similarity of the word vector, the high mean similarity is regarded as the correct meaning of the ambiguous word. The effectiveness of the proposed method is verified by comparative experiments on the SEVAL-2007 Task# 5 dataset.