| P08-1050 | will perform certain number of | n-way classification | tasks . For each n-way task , |
| W00-1301 | algorithm learns rule sequences for | n-way classification | , where the condition of a rule |
| S13-2100 | ) . We see the n-way task as a | n-way classification | problem . The instances of this |
| P08-1050 | a better performance on every | n-way classification | than CO. . Although SCF and CO |
| P06-2007 | provides a benchmark for automatic | n-way classification | into WordNet 's semantic classes |
| P06-2007 | we could use these features for | n-way classification | . From the same TREC corpus we |
| P08-1050 | mation , outperforms SCF on every | n-way classification | when n > 10 , suggesting that |
| P08-1050 | accuracy reported for the overall | n-way classification | for each selected n , is obtained |
