Mining all maximal frequent word sequences in a set of sentences
Helena Ahonen-Myka · 2005
We present an efficient algorithm for finding all maximal frequent word sequences in a set of sentences. A word sequence s is considered frequent, if all its words occur in at least σ sentences and the words occur in each of these sentences in the same order as in s, given a frequency threshold σ. Hence, the words of a sequence s do not have to occur consecutively in the sentences.