Nested Mention Detection on KBP 2017 (test)
81.8PrecisionFOFE
Evaluation Results
| Method | Links | |||
|---|---|---|---|---|
| FOFEmax mention length (c)=6, Time Complexity=O(mn²)2019.06 | 81.8 | 62 | 70.6 | |
| SHmax mention length (c)=n, Time Complexity=O(mn²)2019.06 | 79.2 | 66.5 | 72.3 | |
| FOFEmax mention length (c)=n, Time Complexity=O(mn²)2019.06 | 79.1 | 62.5 | 69.8 | |
| Anchor-Region Networksmax mention length (c)=n, Time Complexity=O(mn+nk)2019.06 | 77.7 | 71.8 | 74.6 | |
| Anchor-Region Networksmax mention length (c)=6, Time Complexity=O(mn+ck)2019.06 | 76.2 | 71.5 | 73.8 | |
| TransitionTime Complexity=O(mn)2019.06 | 74.7 | 67 | 70.1 | |
| SHmax mention length (c)=6, Time Complexity=O(cmn)2019.06 | 73.3 | 65.8 | 69.4 | |
| KBP2017 Best2019.06 | 72.6 | 73 | 72.8 | |
| LSTM-CRFTime Complexity=O(mn)2019.06 | 71.5 | 53.3 | 61.1 | |
| Multi-CRFTime Complexity=O(mn)2019.06 | 69.7 | 60.8 | 64.9 |