16. The computer program product as recited in claim 10 , the processor further configured to: disregard one or more candidate short form and n-gram combination pairs that fail to meet the first pre-determined threshold criteria and the second pre-determined threshold.
10. A computer program product for short form/long form detection, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to: ingest a corpus comprising one or more documents; split the one or more documents into one or more tokens; select one or more tokens as one or more candidate short forms; for each candidate short form, generate one or more n-gram combinations, resulting in one or more candidate short form and n-gram combination pairs; for each candidate short form and n-gram combination pair; calculate an approximate string matching distance; calculate a best possible alignment score using a string matching scoring algorithm based on a maximum pooling over one or more possible alignments between the candidate short form and n-gram combination; evaluating the n-gram combination to determine if the approximate string matching distance meets a first pre-determined threshold or the best possible alignment score meets a second pre-determined threshold; if the n-gram combination meets either the first pre-determined threshold or the second pre-determined threshold, then; calculate a confidence score; calculate a topic similarity score; and calculate a semantic similarity score; determine the validity, through a meta learner, of each candidate short form and n-gram combination pair based upon each short form and n-gram combination pair's confidence score, topic similarity score, and semantic similarity score; and if valid, store the short form and n-gram combination pair in a repository.