Exploiting Dependency Tree for Multiple Constraint Relation Detection
Exploited the dependency tree for case comparison to detect multiple constraint relations within a sentence,collecting signal words and relevant examples to construct a case-base of different kinds of constraint relations;defined a Partial Dependency Tree(PDT)kernel for similarity measurement.Apriori algorithm is applied for efficiently computing the kernel function.Experiments show that,compared with the method of string matching with semantic feature,the method can increase the detection precision by 18.05% and the recall by 16.98%.It also gives a steady performance over a test set which consists of three TREC question corpora.