Font Size: a A A

Finding acronyms and their definitions using HMM

Posted on:2012-08-14Degree:M.S.C.SType:Thesis
University:University of Nevada, Las VegasCandidate:Vyas, LakshmiFull Text:PDF
GTID:2456390008495807Subject:Computer Science
Abstract/Summary:
In this thesis, 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/Search Tags:Recall and precision
Related items