An Accuracy-Oriented Divide-and-Conquer Strategy for Recognizing Textual Entailment.
Rui Wang, Günter Neumann · Theory and applications of categories · 2008
The Two-Way Task: Run1: TAC-M, TS-M, and Tri-BM Run2: TAC-M, TS-M, and BoW-BM Run3: TAC-M, TS-M, NE-M, & Tri-BM, BoW-BM The Three-Way Task: Run1: TAC-M, TS-M, and Tri-BM, BoWBM Run2: TAC-M, TS-M, NE-M (partial), and Tri-BM, BoW-BM Run3: TAC-M, TS-M, NE-M, and Tri-BM, BoW-BM From Two-Way to Three-Way: If BoW-BM=YES & Tri-BM=NO then CONTRADICTION If BoW-BM=YES & Tri-BM=YES then ENTAILMENT Others UNKNOWN Tasks TAC-M TS-M NE-M BoW-BM Tri-BM Run1 Run2 Run3 IR(300) 75.0%/4 76.5%/85 61.0%/164 63.3% 54.3% 66.0% 72.3% 71.7% QA(200) 90.0%/10 73.2%/82 54.8%/93 49.0% 53.5% 73.0% 72.0% 74.0% SUM(200) 83.3%/6 74.5%/51 55.2%/67 63.5% 54.0% 64.0% 69.5% 71.5%