Decision on legal separation form of separable triggers based on dependency parsing
Xiao Xia Shen · Computer Engineering and Applications Journal · 2014
The morphemes of separable triggers may produce a variety of legal separation form due to the insertion, invertion, ellipsis, and the legal separation form can also characterize events as the primary form of separable triggers. A decision algorithm of legal separation form of separable triggers based on dependency parsing is proposed, for the purpose of complete extraction of events. Firstly some dependency constraints of the legal separation form of separable triggers are found with the help of dependency parsing. Then some computable decision rules are extracted from those dependency constraints. Finally decision on the legal separation form of separable triggers are executed using decision rules. Experimental results show that the precision, recall, F-Measure of this approach is 82.2%, 88.3%, 85.1%; and the precision, recall, F-Measure of this approach is 82.4%, 88.7%, 85.4% exclusion of sparse data, so the approach has the application potential basically.