论文信息 - Acronym Expansion Via Hidden Markov Models

Acronym Expansion Via Hidden Markov Models

In this paper, we report on design and implementation of a Hidden Markov Model (HMM) to extract acronyms and their expansions. We also report on the training of this HMM with Maximum Likelihood Estimation (MLE) algorithm using a set of examples. Finally, we report on our testing using standard recall and precision. The HMM achieves a recall and precision of 98% and 92% respectively.

Kazem Taghva | Lakshmi Vyas

[1] Peter D. Turney,et al. A Supervised Learning Approach to Acronym Identification , 2005, Canadian AI.

[2] Sergey Brin,et al. Extracting Patterns and Relations from the World Wide Web , 1998, WebDB.

[3] Oren Etzioni,et al. Open Information Extraction from the Web , 2007, CACM.

[4] Russ B. Altman,et al. Research Paper: Creating an Online Dictionary of Abbreviations from MEDLINE , 2002, J. Am. Medical Informatics Assoc..

[5] Frederick Reiss,et al. Enterprise information extraction: recent developments and open challenges , 2010, SIGMOD Conference.

[6] Youngja Park,et al. Hybrid Text Mining for Finding Abbreviations and their Definitions , 2001, EMNLP.

[7] Alex Bateman,et al. An introduction to hidden Markov models. , 2007, Current protocols in bioinformatics.

[8] L. Rabiner,et al. An introduction to hidden Markov models , 1986, IEEE ASSP Magazine.

[9] Marti A. Hearst,et al. A Simple Algorithm for Identifying Abbreviation Definitions in Biomedical Text , 2002, Pacific Symposium on Biocomputing.