In this paper, we use the co-occurrence path to explain the relationship between the index words and extract the semantic information in the term-term matrix to expand the query.

Finally, we present an efficient algorithm for computing the minimal polynomial of a polynomial matrix. It determines the coefficient polynomials term by term from lower to higher degree.