Abstract:

Relation words are the connected components of compound sentences, and the function of them is mainly associating clauses and marking the sense relations between clauses, but in the process of studying the automatic identification of the relation words of Modern Chinese compound sentences based on rules, we find that most of the relation markers identified in multiple compound sentences are fake relation words. Therefore, it is needed to determine whether a relation word is true, and the basis for determination is confirming the collocations between relation markers, yet it is a difficulty. This paper proposes two algorithms to solve this problem: (1)utilizing the resolution space tree to get all the collocations between relation markers; (2)pruning the solution space tree in order to delete the useless set of collocations. The results of experiments show that the two algorithms not only are generalpurpose, but also the accuracy can be improved to 98.9% and the remaining 1.1% can get approximate solutions, which shows the good effectiveness in dealing with the issues of multiple compound sentences.

Key words: multiple compound sentences;the collocations between relation words;the resolution space tree