"Acronym Expansion via Hidden Markov Models" by Kazem Taghva and Lakshmi Vyas
 

Acronym Expansion via Hidden Markov Models

Meeting name

21st International Conference on Systems Engineering

Document Type

Conference Proceeding

Meeting location

Las Vegas, NV

Publication Date

7-16-2011

Abstract

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.

Keywords

Acronym expansion; Acronyms; Hidden Markov models; HMM; Maximum likelihood estimation; Maximum likelihood estimation algorithm; MLE; Pattern recognition systems; Supervised learning

Disciplines

Computer Engineering | Electrical and Computer Engineering | Software Engineering

Permissions

Acronym expansion; Acronyms; Hidden Markov models; HMM; Maximum likelihood estimation; Maximum likelihood estimation algorithm; MLE; Supervised learning

UNLV article access

Share

COinS