Mining, ranking, and using acronym patterns

  • Authors:
  • Xiaonan Ji;Gu Xu;James Bailey;Hang Li

  • Affiliations:
  • NICTA Victoria Laboratory, Department of CSSE, University of Melbourne, Australia;Microsoft Research Asia, Beijing, China;NICTA Victoria Laboratory, Department of CSSE, University of Melbourne, Australia;Microsoft Research Asia, Beijing, China

  • Venue:
  • APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Techniques for being able to automatically identify acronym patterns are very important for enhancing a multitude of applications that rely upon search. This task is challenging, due to the many ways that acronyms and their expansions can be embedded in text. Methods for ranking and exploiting acronym patterns are another related, yet mostly untouched area. In this paper we present a new and extensible approach to discover acronym patterns. Furthermore, we present a new approach that can also be used for both ranking the patterns, as well as utilizing them within search queries. In our pattern discovery system, we are able to achieve a clear separation between higher and lower level functionalities. This enables great flexibility and allows users to easily configure and tune the system for different target domains. We evaluate our system and show how it is able to offer new capabilities, compared to existing work in the area.