S-MART: Novel Tree-based Structured Learning Algorithms Applied to Tweet Entity Linking
- Yi Yang ,
- Ming-Wei Chang
ACL 2015 |
Non-linear models recently receive a lot of attention as people are starting to discover the power of statistical and embedding features. However, tree-based models are seldom studied in the context of structured learning despite their recent success on various classification and ranking tasks. In this paper, we propose S-MART, a tree-based structured learning framework based on multiple additive regression trees. S-MART is especially suitable for handling tasks with dense features, and can be used to learn many different structures under various loss functions.
We apply S-MART to the task of tweet entity linking — a core component of tweet information extraction, which aims to identify and link name mentions to entities in a knowledge base. A novel inference algorithm is proposed to handle the special structure of the task. The experimental results show that S-MART significantly outperforms state-of-the-art tweet entity linking systems.
Related Tools
Tweet Entity Linking Data v2 Release (NEEL Challenge)
July 2, 2015
Datasets and Python evaluation code used in the paper: S-MART: Novel Tree-based Structured Learning Algorithms Applied to Tweet Entity Linking, ACL 2015. Part of the data is based on the Making Sense of Microposts 2014 Challenge (http://www.scc.lancs.ac.uk/microposts2014/challenge/index.html).