Here, for a given observed information w m obs , the top-K words that correspond to concept C n t and have high probabilities w n t = {w n t1 , w n t2 , • • • , w n tK } are used.
hence, the set of all words for a sequence of concepts C n can be written as K Tn number of patterns for a candidate of the sentence can be considered for C n and the corresponding words W n .