A language independent acronym extraction from biomedical texts with hidden Markov models.
This paper proposes to model the extraction of acronyms and their meaning from unstructured text as a stochastic process using Hidden Markov Models (HMM). The underlying, or hidden, chain is derived from the acronym where the states in the chain are made by the acronyms characters. The transition between two states happens when the origin state emits a signal. Signals recognizable by the HMM are tokens extracted from text. Observations are sequence of tokens also extracted from text. Given a set of observations, the acronym definition will be the observation with the highest probability to emerge from the HMM. Modelling this extraction probabilistically allows us to deal with two difficult aspects of this process: ambiguity and noise. We characterize ambiguity when there is no unique alignment between a character in the acronym with a token in the expansion while the feature characterizing noise is the absence of such alignment. Our experiments have proven that this approach has high precision (93.50%) and recall (85.50%) rates in an environment where acronym coinage is ambiguous and noisy such as the biomedical domain. Processing and comparing the HMM approach with different ones, showed ours to reach the highest F1 score (89.40%) on the same corpus.
Osiek
Bruno Adam
BA
Xexeo
Gexéo
G
Vidal de Carvalho
Luis Alfredo
LA
D000004:Abbreviations as Topic; D035843:Biomedical Research; D057225:Data Mining / Q000379:methods*; D016208:Databases, Factual; D057286:Electronic Health Records; D006801:Humans; D016247:Information Storage and Retrieval; D008390:Markov Chains; D008491:Medical Informatics Applications