Efficient Acronym-Expansion Matching for Automatic Acronym Acquisition

Acronyms are a very dynamic area of many languages. An efficient dynamic programming algorithm for matching acronyms with their expansions by maximizing a linguistic plausibility score is presented and is found to be very accurate, to =99.6% on a corpus of acronym definitions. Given its high precision, the algorithm can be used as a component in new or existing automatic acronym acquisition systems