A New Dependency Parsing Tree Generation Algorithm Based on the Semantic Dependency Relationship Between Words

In this paper it presents a new dependency parsing tree (DPT) generation algorithm. Different from other similar algorithms, which based on statistical probability model, the algorithm converts the dependency parsing tree generation problem into a semantic segments dividing problem. In this paper, the co-occurrence frequency of words is firstly analyzed, and it is pointed out that the co-occurrence frequency of words can be used as the basis for the judgment of semantic dependence relationship between words. Then it further analyzes the change of co-occurrence frequency entropy of words in a semantic unit (sentence is used as the basic semantic unit in this paper). And we present an algorithm to divide a sentence into semantic fragments in which words has tight semantic relationship with each other. Based on the above work, this paper divides the DPT generation algorithm into three steps. The first step is to divide the sentence into semantic fragments. The second step is to distinguish semantic core word and non-semantic core words according to the semantic dependency relationship between words in a semantic fragment. Then in the last step the DPT is generated according semantic dependency relationship between semantic core words. Based on court documents which collected from web, the experiments of our DPT generation algorithm are conducted in this paper. And the results show that the DPT generation algorithm in this paper maintains a high degree of consistency with the DPT tree generated by human.