National Research Council of Canada. NRC Institute for Information Technology
The Eighteenth Canadian Conference on Artificial Intelligence (AI'2005), May 9-11, 2005
This paper addresses the task of finding acronym-definition pairs in text. Most of the previous work on the topic is about systems that involve manually generated rules or regular expressions. In this paper, we present a supervised learning approach to the acronym identification task. Our approach reduces the search space of the supervised learning system by putting some weak constraints on the kinds of acronym-definition pairs that can be identified. We obtain results comparable to hand-crafted systems that use stronger constraints. We describe our method for reducing the search space, the features used by our supervised learning system, and our experiments with various learning schemes.
The Eighteenth Canadian Conference on Artificial Intelligence (AI'2005) [Proceedings].